.png){kind=icon}
.png){kind=icon}
Return
Robust point pattern matching based on spectral context
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2013.09.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Point pattern matching
Graph spectrum
Structural descriptor
Geometric consistency
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W