Sciweavers

244 search results - page 6 / 49
» Generalized RANSAC Framework for Relaxed Correspondence Prob...
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...
ICCV
2003
IEEE
14 years 9 months ago
Entropy-of-likelihood Feature Selection for Image Correspondence
Feature points for image correspondence are often selected according to subjective criteria (e.g. edge density, nostrils). In this paper, we present a general, non-subjective crit...
Matthew Toews, Tal Arbel
ECCV
2010
Springer
13 years 9 months ago
Towards More Efficient and Effective LP-based algorithms for MRF Optimization
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
WIRI
2005
IEEE
14 years 1 months ago
Mapping generation for XML data sources: a general framework
The inter-operability of multiple autonomous and heterogeneous data sources is an important issue in many applications such as mediation systems, datawarehouses, or web-based syst...
Zoubida Kedad, Xiaohui Xue
ECCV
2010
Springer
14 years 25 days ago
3D Point Correspondence by Minimum Description Length in Feature Space
Abstract. Finding point correspondences plays an important role in automatically building statistical shape models from a training set of 3D surfaces. For the point correspondence ...