Cart (Loading....) | Create Account
Close category search window
 

Feature matching by searching maximum clique on high order association graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Branca, A. ; Ist. Elaborazione Segnali ed Immagini, CNR, Bari, Italy ; Stella, E. ; Distante, A.

In this work we consider the most important problem in computer vision of performing matching among elementary features of objects when observed from different points of view. We formulate the problem in terms of subgraph isomorphism between relational graphs characterized by nodes representing interested object features and linking edges weighted by projective invariant values. The matching involves determination of all nodes in the association graph mutually compatible according to the similarity of the imposed invariant relations encoded on the edges. The solution requires us to determine subsets of nodes totally interconnected by edges with highest weights. Moreover, in most contexts, relations among more than two features can be involved, giving rise to association graphs of higher order. Recently it has been recognized that a particular class of dynamical equations are able to solve the maximum clique problem in an optimal manner. In our work, we have extended and applied such results to solve the most general problem of searching for the maximum edge-weighted clique on high-order association graphs. Moreover we have applied the method to a classical problem in computer vision of planar 3D surface reconstruction which is of fundamental importance for an autonomous moving vehicle in order to accomplish some elementary tasks, such as detection of ground floor obstacles or independent moving objects

Published in:

Image Analysis and Processing, 1999. Proceedings. International Conference on

Date of Conference:

1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.