Abstract
In spectroscopy, matching a measured spectrum to a reference spectrum in a large database is often computationally intensive. To solve this problem, we propose a novel fast search algorithm that finds the most similar spectrum in the database. The proposed method is based on principal component transformation and provides results equivalent to the traditional full search method. To reduce the search range, hierarchical clustering is employed, which divides the spectral data into multiple clusters according to the similarity of the spectrum, allowing the search to start at the cluster closest to the input spectrum. Furthermore, a pilot search was applied in advance to further accelerate the search. Experimental results show that the proposed method requires only a small fraction of the computational complexity required by the full search, and it outperforms the previous methods.
Funding Information
  • Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education ((2017R1A2B4012450))
  • the Korea Institute of Industrial Technology as “Development of color/light-emitting textile products for detection of industrial harmful materials and prevention of danger" ((kitech EO-20-0006))

This publication has 35 references indexed in Scilit: