Sciweavers

298 search results - page 5 / 60
» Measuring Linearity of Ordered Point Sets
Sort
View
TVCG
2010
141views more  TVCG 2010»
13 years 5 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
DPHOTO
2009
353views Hardware» more  DPHOTO 2009»
13 years 5 months ago
Fuzzy-based motion estimation for video stabilization using SIFT interest points
In this paper we present a technique which infers interframe motion by tracking SIFT features through consecutive frames: feature points are detected and their stability is evalua...
Sebastiano Battiato, Giovanni Gallo, Giovanni Pugl...
CVPR
2004
IEEE
14 years 9 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden
ICIP
2004
IEEE
14 years 9 months ago
Using multiscale top points in image matching
In this paper we discuss the feasibility of using singular points in a scale space representation (referred to as top points) for image matching purposes. These points are easily ...
Bram Platel, Frans Kanters, Luc Florack, Evguenia ...
IPM
2007
83views more  IPM 2007»
13 years 7 months ago
Information retrieval performance measures for a current awareness report composition aid
This papers studies a special “small” information retrieval problem where user satisfaction only depends on the ordering of documents. We look for a retrieval performance meas...
Thomas Krichel