78 search results - page 4 / 16 » On low dimensional random projections and similarity search |
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
95
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
AAAI
2008
14 years 12 months ago
2008
With the success of local features in object recognition, feature-set representations are widely used in computer vision and related domains. Pyramid match kernel (PMK) is an effi...
WEBI
2009
Springer
15 years 4 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...