Fast Search Method Based on Vector Quantization for Raman Spectroscopy Identification
Open Access
- 6 November 2020
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 8 (11) , 1970
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.Keywords
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:
- Assessment of the performance of a handheld Raman device for potential use as a screening tool in evaluating medicines qualityJournal of Pharmaceutical and Biomedical Analysis, 2013
- Relative Intensity Correction of Raman Spectrometers: NIST SRMs 2241 through 2243 for 785 nm, 532 nm, and 488 nm/514.5 nm ExcitationApplied Spectroscopy, 2007
- QuantizationIEEE Transactions on Information Theory, 1998
- Two fast nearest neighbor searching algorithms for image vector quantizationIEEE Transactions on Communications, 1996
- A fast mean-distance-ordered partial codebook search algorithm for image vector quantizationIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1993
- Equal-average hyperplane partitioning method for vector quantization of image dataPattern Recognition Letters, 1992
- Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encodingIEEE Transactions on Signal Processing, 1992
- Fine-coarse vector quantizationIEEE Transactions on Signal Processing, 1991
- Theory of lattice-based fine-coarse vector quantizationIEEE Transactions on Information Theory, 1991
- An improvement of the minimum distortion encoding algorithm for vector quantizationIEEE Transactions on Communications, 1985