English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/129444
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

A novel clique formulation for the visual feature matching problem

AuthorsSan Segundo Carrillo, Pablo ; Artieda, Jorge
KeywordsVisual matching
Image registration
3D reconstruction
Maximum clique
Branch-and-bound
Issue Date2015
PublisherKluwer Academic Publishers
CitationApplied Intelligence 43: 325- 342 (2015)
Abstract© 2015, Springer Science+Business Media New York. This paper presents CCMM (acronym for image Clique Matching), a new deterministic algorithm for the visual feature matching problem when images have low distortion. CCMM is multi-hypothesis, i.e. for each feature to be matched in the original image it builds an association graph which captures pairwise compatibility with a subset of candidate features in the target image. It then solves optimum joint compatibility by searching for a maximum clique. CCMM is shown to be more robust than traditional RANSAC-based single-hypothesis approaches. Moreover, the order of the graph grows linearly with the number of hypothesis, which keeps computational requirements bounded for real life applications such as UAV image mosaicing or digital terrain model extraction. The paper also includes extensive empirical validation.
URIhttp://hdl.handle.net/10261/129444
DOI10.1007/s10489-015-0646-1
Identifiersdoi: 10.1007/s10489-015-0646-1
issn: 0924-669X
Appears in Collections:(CAR) Artículos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.