This letter proposes a fast k nearest neighbors search algorithm based on the wavelet transform. This technique exploits the important information of the approximation coefficients of the transform coefficient vector, from which we obtain two crucial inequalities that can be used to reject those vectors for which it is impossible to be k nearest neighbors. The computational complexity for searching for k nearest neighbors can be largely reduced. Experimental results on texture classification verify the effectiveness of our algorithm.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yu-Long QIAO, Zhe-Ming LU, Sheng-He SUN, "Fast K Nearest Neighbors Search Algorithm Based on Wavelet Transform" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 8, pp. 2239-2243, August 2006, doi: 10.1093/ietfec/e89-a.8.2239.
Abstract: This letter proposes a fast k nearest neighbors search algorithm based on the wavelet transform. This technique exploits the important information of the approximation coefficients of the transform coefficient vector, from which we obtain two crucial inequalities that can be used to reject those vectors for which it is impossible to be k nearest neighbors. The computational complexity for searching for k nearest neighbors can be largely reduced. Experimental results on texture classification verify the effectiveness of our algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.8.2239/_p
Copy
@ARTICLE{e89-a_8_2239,
author={Yu-Long QIAO, Zhe-Ming LU, Sheng-He SUN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast K Nearest Neighbors Search Algorithm Based on Wavelet Transform},
year={2006},
volume={E89-A},
number={8},
pages={2239-2243},
abstract={This letter proposes a fast k nearest neighbors search algorithm based on the wavelet transform. This technique exploits the important information of the approximation coefficients of the transform coefficient vector, from which we obtain two crucial inequalities that can be used to reject those vectors for which it is impossible to be k nearest neighbors. The computational complexity for searching for k nearest neighbors can be largely reduced. Experimental results on texture classification verify the effectiveness of our algorithm.},
keywords={},
doi={10.1093/ietfec/e89-a.8.2239},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Fast K Nearest Neighbors Search Algorithm Based on Wavelet Transform
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2239
EP - 2243
AU - Yu-Long QIAO
AU - Zhe-Ming LU
AU - Sheng-He SUN
PY - 2006
DO - 10.1093/ietfec/e89-a.8.2239
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2006
AB - This letter proposes a fast k nearest neighbors search algorithm based on the wavelet transform. This technique exploits the important information of the approximation coefficients of the transform coefficient vector, from which we obtain two crucial inequalities that can be used to reject those vectors for which it is impossible to be k nearest neighbors. The computational complexity for searching for k nearest neighbors can be largely reduced. Experimental results on texture classification verify the effectiveness of our algorithm.
ER -