—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...
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...
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...
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 ...
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...