Robust point pattern matching based on spectral context

Tang, Jun, Shao, Ling and Zhen, Xiantong (2014) Robust point pattern matching based on spectral context. Pattern Recognition, 47 (3). pp. 1469-1484. ISSN 0031-3203

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Point pattern matching; Graph spectrum; Structural descriptor; Geometric consistency
Subjects:	G400 Computer Science
Department:	Faculties > Engineering and Environment > Computer and Information Sciences
Related URLs:	Publisher
Depositing User:	Paul Burns
Date Deposited:	10 Jun 2015 12:50
Last Modified:	13 Oct 2019 00:37
URI:	http://nrl.northumbria.ac.uk/id/eprint/22821

Downloads