Sciweavers

21 search results - page 1 / 5
» Feature Correspondence Via Graph Matching: Models and Global...
Sort
View
ECCV
2008
Springer
14 years 6 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...
CVPR
2007
IEEE
14 years 6 months ago
Image Matching via Saliency Region Correspondences
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
Alexander Toshev, Jianbo Shi, Kostas Daniilidis
CGF
2008
262views more  CGF 2008»
13 years 5 months ago
Global Correspondence Optimization for Non-Rigid Registration of Depth Scans
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization....
Hao Li, Robert W. Sumner, Mark Pauly
ACCV
2009
Springer
13 years 11 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
DAGM
2006
Springer
13 years 8 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz