Sciweavers

13 search results - page 2 / 3
» Sequential Projection Learning for Hashing with Compact Code...
Sort
View
ICPR
2010
IEEE
13 years 8 months ago
Beyond "Near-Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell
ICIP
2009
IEEE
13 years 2 months ago
A compressive-sensing based watermarking scheme for sparse image tampering identification
In this paper we describe a robust watermarking scheme for image tampering identification and localization. A compact representation of the image is first produced by assembling a...
Giuseppe Valenzise, Marco Tagliasacchi, Stefano Tu...
AAAI
2012
11 years 7 months 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
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
SIGIR
2010
ACM
13 years 8 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu