Tang, Jun, Shao, Ling, Li, Xuelong and Lu, Ke (2016) A local structural descriptor for image matching via normalized graph laplacian embedding. IEEE Transactions on Cybernetics, 46 (2). pp. 410-420. ISSN 2168-2267
Preview |
PDF (Accepted manuscript)
- Accepted Version
Download (1MB) | Preview |
Abstract
This paper investigates graph spectral approaches to the problem of point pattern matching. Specifically, we concentrate on the issue of how to effectively use graph spectral properties to characterize point patterns in the presence of positional jitter and outliers. A novel local spectral descriptor is proposed to represent the attribute domain of feature points. For a point in a given point-set, weight graphs are constructed on its neighboring points and then their normalized Laplacian matrices are computed. According to the known spectral radius of the normalized Laplacian matrix, the distribution of the eigenvalues of these normalized Laplacian matrices is summarized as a histogram to form a descriptor. The proposed spectral descriptor is finally combined with the approximate distance order for recovering correspondences between point-sets. Extensive experiments demonstrate the effectiveness of the proposed approach and its superiority to the existing methods.
Item Type: | Article |
---|---|
Additional Information: | (c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. |
Faculty \ School: | Faculty of Science > School of Computing Sciences |
Depositing User: | Pure Connector |
Date Deposited: | 16 Feb 2017 02:21 |
Last Modified: | 22 Oct 2022 02:11 |
URI: | https://ueaeprints.uea.ac.uk/id/eprint/62617 |
DOI: | 10.1109/TCYB.2015.2402751 |
Downloads
Downloads per month over past year
Actions (login required)
View Item |