Sciweavers

2031 search results - page 22 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
IJCV
2008
157views more  IJCV 2008»
14 years 9 months ago
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
Systems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the s...
Anurag Mittal, Larry S. Davis
75
Voted
JMIV
2006
116views more  JMIV 2006»
14 years 9 months ago
Geodesic Matching with Free Extremities
In this paper, we describe how to use geodesic energies defined on various sets of objects to solve several distance related problems. We first present the theory of metamorphoses ...
Laurent Garcin, Laurent Younes
DLOG
2004
14 years 11 months ago
Towards Explaining Semantic Matching
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...
Deborah L. McGuinness, Pavel Shvaiko, Fausto Giunc...
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 3 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
SIGMOD
2008
ACM
100views Database» more  SIGMOD 2008»
14 years 9 months ago
Incorporating string transformations in record matching
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
Arvind Arasu, Surajit Chaudhuri, Kris Ganjam, Ragh...