Feature Matching with Bounded Distortion

DOI10.1145/2602142zbMath1322.68244OpenAlexW2071093471MaRDI QIDQ5176494

Ronen Basri, Stav Yagev, Roi Poranne, David Jacobs, Yaron Lipman

Publication date: 26 February 2015

Published in: ACM Transactions on Graphics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2602142

zbMATH Keywords

bounded distortionimage matchingfeature correspondence

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10) Quadratic programming (90C20) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

Locality preserving matching ⋮ A Hyperelastic Two-Scale Optimization Model for Shape Matching ⋮ Image matching from handcrafted to deep features: a survey ⋮ Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics

Uses Software

• Vlfeat
• PatchMatch

Cites Work

• Efficient Computation of Isometry‐Invariant Distances Between Surfaces
• Convergence Analysis of Generalized Iteratively Reweighted Least Squares Algorithms on Convex Function Spaces
• Iteratively reweighted least squares minimization for sparse recovery
• Weber's problem and weiszfeld's algorithm in general spaces
• A new point matching algorithm for non-rigid registration
• Integer-grid maps for reliable quad meshing

This page was built for publication: Feature Matching with Bounded Distortion