返回
Triangle chain codes for image matching
DOI:10.1016/j.neucom.2012.08.055.png)
摘要
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.
Keyword:
Image matching
Image retrieval
Object recognition
Point set matching
Point pattern matching
Image registration
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
DIAGNOSIS AND TREATMENT: RESPIRATORY DISTRESS AND CARDIAC DISEASE IN INFANCY诊断与治疗:婴儿呼吸窘迫与心脏疾病
Pediatrics
IF0
Fast algorithm for point pattern matching: Invariant to translations, rotations and scale changes
PATTERN RECOGNITION
IF7.6
RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY随机样本共识-模型拟合的范例,可应用于图像分析和自动制图

