Sciweavers

55 search results - page 5 / 11
» Quasi-Dense Wide Baseline Matching Using Match Propagation
Sort
View
TIT
2011
209views more  TIT 2011»
13 years 2 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
ICPR
2000
IEEE
14 years 9 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
NIPS
2007
13 years 9 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
SEMWEB
2009
Springer
14 years 2 months ago
Actively Learning Ontology Matching via User Interaction
Ontology matching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However...
Feng Shi, Juanzi Li, Jie Tang, Guo Tong Xie, Hanyu...
PAMI
2008
174views more  PAMI 2008»
13 years 7 months ago
Multiflash Stereopsis: Depth-Edge-Preserving Stereo with Small Baseline Illumination
Traditional stereo matching algorithms are limited in their ability to produce accurate results near depth discontinuities, due to partial occlusions and violation of smoothness co...
Rogerio Feris, Ramesh Raskar, Longbin Chen, Kar-Ha...