Graph-based point drift: graph centrality on the registration of point-sets
From MaRDI portal
Recommendations
- Smooth simultaneous structural graph matching and point-set registration
- Computer Vision - ECCV 2004
- Registration algorithm based on fuzzy shape context and local vector similarity constraint
- A robust and outlier-adaptive method for non-rigid point registration
- Spectral correspondence for point pattern matching
Cites work
- scientific article; zbMATH DE number 3016052 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- A sum-over-paths extension of edit distances accounting for all sequence alignments
- A taxonomy and evaluation of dense two-frame stereo correspondence algorithms
- An eigendecomposition approach to weighted graph matching problems
- Geometry and convergence analysis of algorithms for registration of 3D shapes
- Laplace eigenvalues of graphs---a survey
- Lower Bounds for the Partitioning of Graphs
- Machine Learning: ECML 2004
- On the evaluation of graph centrality for shape matching
- Ranking of Closeness Centrality for Large-Scale Social Networks
- Rotation-Invariant Nonrigid Point Set Matching in Cluttered Scenes
- Spectra of graphs
- Spectral correspondence for point pattern matching
- The Eccentricity Transform (of a Digital Shape)
- The Euclidean traveling salesman problem is NP-complete
- The centrality index of a graph
Cited in
(5)- Group-wise point-set registration using a novel CDF-based Havrda-Charvát divergence
- Graph regularization centrality
- Preface of special issue on ``Graph-based processing for pattern recognition
- Probabilistic learning coherent point drift for 3D ultrasound fetal head registration
- Data graph formulation as the minimum-weight maximum-entropy problem
This page was built for publication: Graph-based point drift: graph centrality on the registration of point-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677064)
