Referenced Items are not available for this document.
A problem commonly encountered in computer vision is the recovery of the transformation parameters between two affinely distorted images. In this paper, we propose a novel feature-based approach that casts the matching problem to the search of a maximum clique over an auxiliary hypergraph. We also introduce a continuous-based characterization of cliques in hypergraphs that allows us to handle the hard combinatorial problem using tools from the continuous domain. Finally, we present experimental result and comparisons with a state-of-the-art algorithm.
Published in:
Pattern Recognition, 2008. ICPR 2008. 19th International Conference on
Date of Conference: 8-11 Dec. 2008
- Page(s):
- 1 - 4
- ISSN :
- 1051-4651
- E-ISBN :
- 978-1-4244-2175-6
- Print ISBN:
- 978-1-4244-2174-9
- INSPEC Accession Number:
- 10457695
- Conference Location :
- Tampa, FL
- Digital Object Identifier :
- 10.1109/ICPR.2008.4761349
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
