|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Eel-Wan Lee, Soo-Ik Chae, "Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular Inequality," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 5, pp. 562-566, May, 1998. | |||
| BibTex | x | ||
| @article{ 10.1109/34.682187, author = {Eel-Wan Lee and Soo-Ik Chae}, title = {Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular Inequality}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {20}, number = {5}, issn = {0162-8828}, year = {1998}, pages = {562-566}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.682187}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - Fast Design of Reduced-Complexity Nearest-Neighbor Classifiers Using Triangular Inequality IS - 5 SN - 0162-8828 SP562 EP566 EPD - 562-566 A1 - Eel-Wan Lee, A1 - Soo-Ik Chae, PY - 1998 KW - Nearest-neighbor classifier KW - triangular inequality KW - computational complexity KW - NIST database KW - fast design. VL - 20 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
Abstract—In this paper, we propose a method of designing a reduced complexity nearest-neighbor (RCNN) classifier with near-minimal computational complexity from a given nearest-neighbor classifier that has high input dimensionality and a large number of class vectors. We applied our method to the classification problem of handwritten numerals in the NIST database. If the complexity of the RCNN classifier is normalized to that of the given classifier, the complexity of the derived classifier is 62 percent, 2 percent higher than that of the optimal classifier. This was found using the exhaustive search.
[1] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis.New York: John Wiley, 1973.
[2] B.V. Dasarathy, Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques.Los Alamitos, Calif.: IEEE CS Press, 1991.
[3] F.P. Fisher and E.A. Patrick, "A Preprocessing Algorithm for Nearest Neighbor Decision Rules," Proc. Nat'l Electronic Conf., vol. 26, pp. 481-485, Dec. 1970.
[4] J.H. Friedman, F. Baskett, and L.J. Shustek, "An Algorithm for Finding Nearest Neighbors," IEEE Trans. Computers, vol. 24, pp. 1,000-1,006, Oct. 1975.
[5] A. Gersho and R.M. Gray, Vector Quantizer and Signal Compression.Boston: Kluwer Academic Publisher, 1992.
[6] W. Li and E. Salari, "A Fast Vector Quantization Encoding Method for Image Compression," IEEE Trans. CAS for Video Tech., vol. 5, no. 2, pp. 119-123, Apr. 1995.
[7] G. Poggi, "Fast Algorithm for Full-Search VQ Encoding," Electron. Lett., vol. 29, pp. 1,141-1,142, June 1993.
[8] C.-M. Huang, Q. Bi, G.S. Stiles, and R.W. Harris, "Fast Full Search Equivalent Encoding Algorithm for Image Compression Using Vector Quantization," IEEE Trans. Image Processing, vol. 1, no. 3, pp. 413-416, July 1992.
[9] "NIST Special Database 1(HWDB)," Standard Reference Data, National Institute of Science and Technology, 221/A323, Gaithersburg, Md.
[10] S.-W. Ra and J.-K. Kim, "A Fast Mean-Distance-Oriented Partial Codebook Search Algorithm for Image Vector Quantization," IEEE Trans. CAS, vol. 40, no. 9, pp. 576-579, Sept. 1993.
[11] W.K. Pratt, Digital Image Processing, 2nd ed. New York: John Wiley, 1991.