Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Graph-Based Approach to Corner Matching Using Mutual Information as a Local Similarity Measure
 

Summary: A Graph-Based Approach to Corner Matching Using Mutual Information as a
Local Similarity Measure
Manolis I. A. Lourakis, Antonis A. Argyros and Kostas Marias
Institute of Computer Science, Foundation for Research and Technology - Hellas (FORTH)
Vassilika Vouton, P.O. Box 1385, GR 711 10, Heraklion, Crete, GREECE
lourakis, argyros, kmarias @ics.forth.gr http://www.ics.forth.gr/cvrl/
Abstract
Corner matching constitutes a fundamental vision prob-
lem that serves as a building block of several important ap-
plications. The common approach to dealing with this prob-
lem starts by ranking potential matches according to their
affinity, which is assessed with the aid of window-based in-
tensity similarity measures. Then, actual matches are es-
tablished by optimizing global criteria involving all poten-
tial matches. This paper puts forward a novel approach for
solving the corner matching problem that uses mutual in-
formation as a window similarity measure, combined with
graph matching techniques for determining a matching of
corners that is globally optimal. Experimental results illus-
trate the effectiveness of the approach.

  

Source: Argyros, Antonis - Foundation of Research and Technology, Hellas & Department of Computer Science, University of Crete
Trahanias, Panos - Institute of Computer Science, Foundation of Research and Technology, Hellas

 

Collections: Computer Technologies and Information Sciences