Approximating the problem, not the solution: an alternative view of point set matching
From MaRDI portal
Publication:2369583
Recommendations
- Approximating the problem, not the solution: An alternative view of point set matching
- An optimal probabilistic graphical model for point set matching
- Inexact Bayesian point pattern matching for linear transformations
- Improved approximation bounds for planar point pattern matching
- Approximate one-to-one point pattern matching
Cites work
- A kernel view of spectral point pattern matching
- An optimal probabilistic graphical model for point set matching
- scientific article; zbMATH DE number 3900666 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- Point matching under non-uniform distortions.
- Scene Labeling by Relaxation Operations
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- Spectral correspondence for point pattern matching
Cited in
(6)- Matching point sets with respect to the earth mover's distance
- Algorithms for point set matching with k-differences
- Approximating the problem, not the solution: An alternative view of point set matching
- An optimal probabilistic graphical model for point set matching
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- A dynamic generating graphical model for point-sets matching
This page was built for publication: Approximating the problem, not the solution: an alternative view of point set matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369583)
