Sciweavers

10 search results - page 2 / 2
» Spectral Hashing
Sort
View
ECCV
2010
Springer
13 years 9 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
ICASSP
2010
IEEE
13 years 4 months ago
Searching with expectations
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
Harsimrat Sandhawalia, Herve Jegou
ICIP
2004
IEEE
14 years 6 months ago
Robust perceptual image hashing via matrix invariants
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
Mehmet Kivanç Mihçak, Ramarathnam Ve...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 3 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
WACV
2012
IEEE
12 years 4 days ago
CompactKdt: Compact signatures for accurate large scale object recognition
We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...
Mohamed Aly, Mario E. Munich, Pietro Perona