Independent components analysis for representation interest point descriptors

  • Authors:
  • Dongfeng Han;Wenhui Li;Tianzhu Wang;Lingling Liu;Yi Wang

  • Affiliations:
  • College of Computer Science and Technology, Key Laboratory of Symbol, Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol, Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol, Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol, Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China;College of Computer Science and Technology, Key Laboratory of Symbol, Computation and Knowledge Engineering of the Ministry of Education, Jilin University, Changchun, P.R. China

  • Venue:
  • ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.04

Visualization

Abstract

This paper presents a new interest point descriptors representation method based on independent components analysis (ICA). The aim of this algorithm is to find a meaningful image subspace and more compact descriptors. Combination the descriptors with an effective interest point detector, the proposed algorithm has a more accurate matching rate besides the robustness towards image deformations. The proposed algorithm first finds the characteristic scale and the location for the interest points using Harris-Laplacian interest point detector. We use Haar wavelet transform on the neighborhood of the interest points and get low frequency gradient feature vectors. Then ICA is used to model the subspace and reduces the dimension of the feature vectors. The experiments show the efficiency of the proposed algorithm.