Sciweavers

13 search results - page 1 / 3
» Double-Bit Quantization for Hashing
Sort
View
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
LREC
2010
155views Education» more  LREC 2010»
13 years 6 months ago
Efficient Minimal Perfect Hash Language Models
The recent availability of large collections of text such as the Google 1T 5-gram corpus (Brants and Franz, 2006) and the Gigaword corpus of newswire (Graff, 2003) have made it po...
David Guthrie, Mark Hepple, Wei Liu
CORR
2011
Springer
182views Education» more  CORR 2011»
12 years 12 months ago
Short-Message Quantize-Forward Network Coding
—Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message en...
Gerhard Kramer, Jie Hou
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...
ICB
2007
Springer
185views Biometrics» more  ICB 2007»
13 years 11 months ago
Biometric Hashing Based on Genetic Selection and Its Application to On-Line Signatures
We present a general biometric hash generation scheme based on vector quantization of multiple feature subsets selected with genetic optimization. The quantization of subsets overc...
Manuel R. Freire, Julian Fiérrez-Aguilar, J...