711 search results - page 2 / 143 » Matching Hierarchical Structures Using Association Graphs |
CRV
2008
IEEE
14 years 1 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
In this work, we address the problem of building recognition across two camera views with large changes in scales and viewpoints. The main idea is to construct a semantically rich...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...