1348 search results - page 45 / 270 » Matching planar maps |
HLK
2003
IEEE
14 years 3 months ago
2003
IEEE
Man-made environments possess many regularities which can be efficiently exploited for image based rendering as well as robotic visual navigation and localization tasks. In this ...
PAMI
2007
13 years 9 months ago
2007
—Three-dimensional shape matching is a fundamental issue in computer vision with many applications such as shape registration, 3D object recognition, and classification. However,...
COMBINATORICS
2000
13 years 9 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
Recovering 3D geometry from a single view of an object is an important and challenging problem in computer vision. Previous methods mainly focus on one specific class of objects ...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...