Graph-based point drift: graph centrality on the registration of point-sets

DOI10.1016/j.patcog.2014.06.011zbMath1373.68363OpenAlexW1972611912MaRDI QIDQ1677064

Samuel de Sousa, Walter G. Kropatsch

Publication date: 10 November 2017

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2014.06.011

zbMATH Keywords

point set registrationcoherent point drift (CPD)graph centrality

Mathematics Subject Classification ID

Applications of graph theory (05C90) Pattern recognition, speech recognition (68T10)

Related Items (4)

Preface of special issue on ``Graph-based processing for pattern recognition ⋮ Graph regularization centrality ⋮ Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem ⋮ Probabilistic learning coherent point drift for 3D ultrasound fetal head registration

Cites Work

• Unnamed Item
• Unnamed Item
• A sum-over-paths extension of edit distances accounting for all sequence alignments
• Spectra of graphs
• Laplace eigenvalues of graphs---a survey
• The Euclidean traveling salesman problem is NP-complete
• Spectral correspondence for point pattern matching
• A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
• Geometry and convergence analysis of algorithms for registration of 3D shapes
• The centrality index of a graph
• Ranking of Closeness Centrality for Large-Scale Social Networks
• An eigendecomposition approach to weighted graph matching problems
• On the Evaluation of Graph Centrality for Shape Matching
• Rotation-Invariant Nonrigid Point Set Matching in Cluttered Scenes
• The Eccentricity Transform (of a Digital Shape)
• Machine Learning: ECML 2004
• Lower Bounds for the Partitioning of Graphs

This page was built for publication: Graph-based point drift: graph centrality on the registration of point-sets