%0 Journal Article %A YU Ping %A YUAN Hui %A ZHAO Zhen-bing %A WANG Bi-cui %T Fast matching algorithm based on interest points %D 2010 %R 10.3778/j.issn.1002-8331.2010.05.040 %J Computer Engineering and Applications %P 132-135 %V 46 %N 5 %X According to the need of the image searches and recognition,one kind of the matching algorithm based on interest points has been brought forward,firstly making use of wavelet transform to realize image dimension reduction and de-noising,extracting its SIFT characteristic points,and finally carrying out matching using nearest neighbor method based on K-d tree.Adop-
ting the algorithm to carry out large numbers of experiments to many kinds of images,final results indicate that the algorithm is superior,has strong matching ability and robustness,is one kind of fairly good image matching algorithm and can be wildly applied to image retrieval and recognition field. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.05.040