DOI QR코드

DOI QR Code

The Fast Search Algorithm for Raman Spectrum

라만 스펙트럼 고속 검색 알고리즘

  • Received : 2015.03.04
  • Accepted : 2015.05.07
  • Published : 2015.05.31

Abstract

The problem of fast search for raman spectrum has attracted much attention recently. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet codeword. To overcome this problem, The fast codeword search algorithm based on the mean pyramids of codewords is currently used in image coding applications. In this paper, we present three new methods for the fast algorithm to search for the closet codeword. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely codewords and save a great deal of computation time. The Experiment results show about 42.8-55.2% performance improvement for the 1DMPS+PDS. The results obtained confirm the effectiveness of the proposed algorithm.

Keywords

Fast Search Algorithms;Mean and Variance Features;MPS(Mean Pyramids Search);PDS(Partial Distortion Search);Raman Spectrum

References

  1. LINDE, Y., BUZO, A.,and GRQY, R.M, "An algorithm for vector quantizer design", IEEE Trans., pp. 84-95, 1980. DOI: http://dx.doi.org/10.1109/TCOM.1980.1094577 https://doi.org/10.1109/TCOM.1980.1094577
  2. GRAY, R.M, "Vector quantization", Proc. of 2nd IEEE ASSP Mag, pp. 4-29, 1984. DOI: http://dx.doi.org/10.1109/MASSP.1984.1162229 https://doi.org/10.1109/MASSP.1984.1162229
  3. BEI, C.D, GRAY, R.M, "An improvement of the minimum distortion encoding algorithm for vector quantization", IEEE Trans., pp. 1132-1133, 1985. DOI: http://dx.doi.org/10.1109/TCOM.1985.1096214 https://doi.org/10.1109/TCOM.1985.1096214
  4. HSIEH, C.H, LU,P,C, CHANG,J,C, "Fast codebook generation algorithms for vector quantization of images", Pattern Recognition Lett, pp. 605-609, 1991. DOI: http://dx.doi.org/10.1016/0167-8655(91)90014-D https://doi.org/10.1016/0167-8655(91)90014-D
  5. ORCHARD, M. D, "A fast nearest-neighbour search algorithm", IEEE ICASSP, pp. 2297-2300, 1991. DOI: http://dx.doi.org/10.1109/ICASSP.1991.150755 https://doi.org/10.1109/ICASSP.1991.150755
  6. GUAN, L, KAMEL, M, "Equal-average hyper-plane partitioning method for vector quantization of image data", Pattern Recognition Lett, pp. 693-699, 1992. DOI: http://dx.doi.org/10.1016/0167-8655(92)90098-K https://doi.org/10.1016/0167-8655(92)90098-K
  7. Lee, C.H, Chen, L,H, "Fast closet code word search algorithm for vector quantization", IEEE Porc., pp. 143-148, 1994. DOI: http://dx.doi.org/10.1049/ip-vis:19941140 https://doi.org/10.1049/ip-vis:19941140
  8. Lee, C.H, Chen, L,H, "A Fast Search Algorithm for Vector Quantization Using Mean Pyramids of Codewords", IEEE Trans., pp. 1697-1702, 1995. DOI: http://dx.doi.org/10.1109/26.380218 https://doi.org/10.1109/26.380218

Cited by

  1. A Fast Search Algorithm for Raman Spectrum using Singular Value Decomposition vol.16, pp.12, 2015, https://doi.org/10.5762/KAIS.2015.16.12.8455

Acknowledgement

Supported by : 한국연구재단