1-2hit |
Yu-Long QIAO Zhe-Ming LU Sheng-He SUN
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.
Jeng-Shyang PAN Yu-Long QIAO Sheng-He SUN
A novel fast KNN classification algorithm is proposed for pattern recognition. The technique uses one important feature, mean of the vector, to reduce the search space in the wavelet domain. Since the proposed algorithm rejects those vectors that are impossible to be the k closest vectors in the design set, it largely reduces the classification time and holds the classification performance as that of the original classification algorithm. The simulation on texture image classification confirms the efficiency of the proposed algorithm.