Affine consistency graphs for image representation and elastic matching

Jacob Bentolila, Joseph M. Francos

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We present a novel method for graph based image representation and matching. The image is represented as a graph of affine invariant regions. A local affine invariant coordinate system is used to describe the geometry at the location of each graph vertex. Once an image is encoded as a graph, a graph matching process can be initiated against the graph of any other image. Each pair of matched features induces an affine approximation of the deformation. The similarity of the affine approximations between different matchings is the foundation of a graph matching algorithm presented here, as it greatly reduces the ambiguity in matching. The algorithm is much faster than state of the art feature matching methods and produces similar results in the presence of highly complex scenes that contain background clutter, occlusion, viewpoint changes, and elastic geometric deformations.

Original languageEnglish
Title of host publication2012 IEEE International Conference on Image Processing, ICIP 2012 - Proceedings
Pages2365-2368
Number of pages4
DOIs
StatePublished - 1 Dec 2012
Event2012 19th IEEE International Conference on Image Processing, ICIP 2012 - Lake Buena Vista, FL, United States
Duration: 30 Sep 20123 Oct 2012

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference2012 19th IEEE International Conference on Image Processing, ICIP 2012
Country/TerritoryUnited States
CityLake Buena Vista, FL
Period30/09/123/10/12

Keywords

  • Image registration
  • Object detection
  • Object recognition
  • Pattern matching

Fingerprint

Dive into the research topics of 'Affine consistency graphs for image representation and elastic matching'. Together they form a unique fingerprint.

Cite this