Sciweavers

1521 search results - page 91 / 305
» Kernelized map matching
Sort
View
CVPR
2001
IEEE
14 years 10 months ago
Semi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
SEMWEB
2007
Springer
14 years 2 months ago
An Empirical Study of Instance-Based Ontology Matching
Instance-based ontology mapping is a promising family of solutions to a class of ontology alignment problems. It crucially depends on measuring the similarity between sets of annot...
Antoine Isaac, Lourens van der Meij, Stefan Schlob...
IJCV
2007
179views more  IJCV 2007»
13 years 8 months ago
A Performance Study on Different Cost Aggregation Approaches Used in Real-Time Stereo Matching
Many vision applications require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most real-time stereo applications rely on local winner-takes-a...
Minglun Gong, Ruigang Yang, Liang Wang 0002, Mingw...
DEXAW
2009
IEEE
73views Database» more  DEXAW 2009»
13 years 11 months ago
Matching Semantic Web Resources
—In this paper, we propose knowledge-chunk based techniques for instance matching and mapping discovery of Semantic Web resources. Knowledge chunks provide a synthetic representa...
Silvana Castano, Alfio Ferrara, Stefano Montanelli...
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
14 years 2 months ago
Building a better Boolean matcher and symmetry detector
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
Donald Chai, Andreas Kuehlmann