Sciweavers

78 search results - page 5 / 16
» On low dimensional random projections and similarity search
Sort
View
ICIP
2007
IEEE
14 years 9 months ago
Projection onto a Shape Manifold for Image Segmentation with Prior
Image segmentation with shape priors has received a lot of attention over the past years. Most existing work focuses on a linearized shape space with small deformation modes aroun...
Florent Ségonne, Patrick Etyngier, Renaud K...
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
13 years 11 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
CVPR
2010
IEEE
13 years 9 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
BIOCOMP
2007
13 years 9 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
Xuehui Li, Tamer Kahveci
ISNN
2007
Springer
14 years 1 months ago
Two-Dimensional Bayesian Subspace Analysis for Face Recognition
Bayesian subspace analysis (BSA) has been successfully applied in data mining and pattern recognition. However, due to the use of probabilistic measure of similarity, it often need...
Daoqiang Zhang