.png){kind=icon}
Return
Triangle chain codes for image matching
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2012.08.055.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a local descriptor referred to as triangle chain code as well as a matching algorithm for point set matching, image registration, and object recognition and locating. First, feature points are detected using corner detectors. Second, triangle chain code is constructed for every point, which carries the discriminative information regarding its k nearest neighbors (KNN). Third, the KNN neighborhoods of two points are matched using the proposed triangle chain code matching algorithm. Fourth, every matched pair of the KNN structures determines a candidate geometric transformation mapping one point set to the other. Finally, the geometric transformation that is supported by the largest number of matched point pairs is selected and the corresponding matched point pairs are selected in the meantime. The affine transformation to conduct image registration can then be obtained by least-square fitting of the finally selected matched point pairs. The image registration experiments with regard to remote-sensing images show that the performance of the proposed method is satisfactory As for object recognition and locating, evaluation compared with SIFT plus RANSAC is provided in the experimental part. (c) 2013 Elsevier B.V. All rights reserved.
Keywords:
Image matching
Image retrieval
Object recognition
Point set matching
Point pattern matching
Image registration
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
Scale invariant image matching using triplewise constraint and weighted voting.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSave
ShareSaveFast algorithm for point pattern matching: Invariant to translations, rotations and scale changesPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSave
View more