11231 search results - page 2132 / 2247 » Digging for Data Structures |
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. In spite of over two decades of intense research, illumination and pose invariance remain prohibitively challenging aspects of face recognition for most practical applica...
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
ICIP
2004
IEEE
16 years 29 days ago
2004
IEEE
We address the automatic recovery of complete 3-D object models from video streams. Usually, complete 3-D models are built by fusing several depth maps, each computed from a small...
188
click to vote
ICDE
2008
IEEE
16 years 21 days ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...