2009 search results - page 63 / 402 » Dense Interest Points |
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Abstract. Configurations of dynamic points in multiple views are interesting to study. In this paper, we present several view and timeindependent constraints on different configura...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
TIP
2008
13 years 8 months ago
2008
Low-level image analysis systems typically detect "points of interest", i.e., areas of natural images that contain corners or edges. Most of the robust and computationall...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
ICDE
2008
IEEE
14 years 9 months 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...