Sciweavers

280 search results - page 35 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
CVPR
2006
IEEE
15 years 1 months ago
Accurate Tracking of Monotonically Advancing Fronts
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
M. Sabry Hassouna, Aly A. Farag
AAAI
2012
13 years 1 days ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
75
Voted
PCM
2004
Springer
171views Multimedia» more  PCM 2004»
15 years 3 months ago
SketchIt: Basketball Video Retrieval Using Ball Motion Similarity
Abstract. A prototype basketball video retrieval system is presented in this report. Retrieval is based on the similarity of ball motion in the clip with that in the query. The sys...
Sitaram Bhagavathy, Motaz A. El Saban
TIFS
2008
157views more  TIFS 2008»
14 years 9 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
84
Voted
ICALP
2001
Springer
15 years 2 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...