By Topic

Fast kNN classification algorithm based on partial distance search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wen-Jyi Hwang ; Dept. of Electr. Eng., Chung Yuan Christian Univ., Chung Li ; Kuo-Wei Wen

A new fast kNN classification algorithm is presented for texture and pattern recognition. The algorithm identifies the fat k closest vectors in the design set of a kNN classifier for each input vector by performing the partial distance search in the wavelet domain. Simulation results show that, without increasing the classification error rate, the algorithm requires only 12.94% of the computational time of the original kNN technique

Published in:

Electronics Letters  (Volume:34 ,  Issue: 21 )