Sciweavers

50 search results - page 2 / 10
» Learning the Probability of Correspondences without Ground T...
Sort
View
CVPR
2010
IEEE
13 years 5 months ago
Label propagation in video sequences
This paper proposes a probabilistic graphical model for the problem of propagating labels in video sequences, also termed the label propagation problem. Given a limited amount of ...
Vijay Badrinarayanan, Fabio Galasso, Roberto Cipol...
SWWS
2008
13 years 6 months ago
A Harmony based Adaptive Ontology Mapping Approach
- Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. Ontology mapping is critical to achieve semantic interoperability in the...
Ming Mao, Yefei Peng, Michael Spring
JMIV
2007
143views more  JMIV 2007»
13 years 5 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
ICCV
2009
IEEE
13 years 3 months ago
BLOGS: Balanced local and global search for non-degenerate two view epipolar geometry
This work considers the problem of estimating the epipolar geometry between two cameras without needing a prespecified set of correspondences. It is capable of resolving the epipo...
Aveek S. Brahmachari, Sudeep Sarkar
CVPR
2009
IEEE
15 years 11 days ago
Unsupervised Learning for Graph Matching
Graph matching is an important problem in computer vision. It is used in 2D and 3D object matching and recognition. Despite its importance, there is little literature on learnin...
Marius Leordeanu, Martial Hebert