Feature matching with bounded distortion

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

Research output: Contribution to journalArticlepeer-review


We consider the problem of finding a geometrically consistent set of point matches between two images. We assume that local descriptors have provided a set of candidate matches, which may include many outliers. We then seek the largest subset of these correspondences that can be aligned perfectly using a nonrigid deformation that exerts a bounded distortion. We formulate this as a constrained optimization problem and solve it using a constrained, iterative reweighted least-squares algorithm. In each iteration of this algorithm we solve a convex quadratic program obtaining a globally optimal match over a subset of the bounded distortion transformations. We further prove that a sequence of such iterations converges monotonically to a critical point of our objective function. We show experimentally that this algorithm produces excellent results on a number of test sets, in comparison to several state-of-the-art approaches.

Original languageEnglish
Article number26
JournalACM Transactions on Graphics
Issue number3
StatePublished - May 2014
Externally publishedYes


  • Bounded distortion
  • Feature correspondence
  • Image matching

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Feature matching with bounded distortion'. Together they form a unique fingerprint.

Cite this