返回
Robust point pattern matching based on spectral context
DOI:10.1016/j.patcog.2013.09.017.png)
摘要
En 中文
Finding correspondences between two related feature point sets is a basic task in computer vision and pattern recognition. In this paper, we present a novel method for point pattern matching via spectral graph analysis. In particular, we aim to render the spectral matching algorithm more robust for positional jitter and outlier. A local structural descriptor, namely the spectral context, is proposed to describe the attribute domain of point sets, which is fundamentally different from the previous methods. Furthermore, the approximate distance order is defined and employed as the metric for geometric consistency of neighboring points in this work. By combining these two novel ingredients, we formulate feature point set matching as an optimization problem with one-to-one constraints. The correspondences are then obtained by maximizing the given objective function via the technique of probabilistic relaxation. Comparative experiments conducted on both synthetic and real data demonstrate the effectiveness of the proposed method, especially in the presence of positional jitter and outliers. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Point pattern matching
Graph spectrum
Structural descriptor
Geometric consistency
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Object recognition using a generalized robust invariant feature and Gestalt's law of proximity and similarity
PATTERN RECOGNITION
IF7.6
Sequence Analysis of Pigeon, Turkey, and Chicken Rotavirus VP8* Identifies Rotavirus 993/83, Isolated from Calf Feces, as a Pigeon Rotavirus
Virology
IF0

