Journal of Systems Engineering and Electronics ›› 2012, Vol. 23 ›› Issue (3): 453-459.doi: 10.1109/JSEE.2012.00057

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform

Dong Liang1,2,∗, Pu Yan1,2, Ming Zhu1,2, Yizheng Fan1,3, and Kui Wang1,2   

  1. 1. Key Lab of Intelligent Computing & Signal Processing, Ministry of Education, Anhui University, Hefei 230039, P. R. China;
    2. School of Electronics and Information Engineering, Anhui University, Hefei 230039, P. R. China;
    3. School of Mathematics and Computation Sciences, Anhui University, Hefei 230039, P. R. China
  • Online:2012-06-25 Published:2010-01-03

Abstract:

A new spectral matching algorithm is proposed by using nonsubsampled contourlet transform and scale-invariant feature transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency image. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity
matrix, a matching matrix (or matching result) reflecting the matching degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.