REDUCING AMBIGUITY IN FEATURE POINT MATCHING BY PRESERVING LOCAL GEOMETRIC CONSISTENCY

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 433
  • Download : 340
In this paper, feature point matching is formulated as an optimization problem in which the uniqueness condition is constrained. We propose a novel score function based on homography-induced pairwise constraints, and a novel optimization algorithm based on relaxation labeling. Homographyinduced pairwise constraints are effective for image pairs with viewpoint or scale changes, unlike previous pairwise constraints. The proposed optimization algorithm searches for a uniqueness-constrained solution, while the original relaxation-labeling algorithm is appropriate for finding manyto- one correspondences. The effectiveness of the proposed method is shown by experiments involving image pairs with viewpoint or scale changes in addition to repeated textures and nonrigid deformation. The proposed method is also applied to object recognition, giving some promising results.
Publisher
IEEE
Issue Date
2008
Keywords

wide-baseline stereo; affine regions; pairwise constraints; relaxation labeling

Citation

IEEE International Conference on Image Processing

URI
http://hdl.handle.net/10203/24863
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
ICIP2008published.pdf(324.83 kB)Download

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0