Sciweavers

13 search results - page 2 / 3
» Double-Bit Quantization for Hashing
Sort
View
ICIP
2008
IEEE
13 years 12 months ago
Rate-efficient visual correspondences using random projections
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...
Chuohao Yeo, Parvez Ahammad, Kannan Ramchandran
ICCV
2007
IEEE
14 years 7 months ago
Vector Quantizing Feature Space with a Regular Lattice
Most recent class-level object recognition systems work with visual words, i.e., vector quantized local descriptors. In this paper we examine the feasibility of a dataindependent ...
Tinne Tuytelaars, Cordelia Schmid
ICIP
2008
IEEE
14 years 7 months ago
Localization of sparse image tampering via random projections
Hashes can be used to provide authentication of multimedia contents. In the case of images, a hash can be used to detect whether the data has been modified in an illegitimate way....
Marco Tagliasacchi, Giuseppe Valenzise, Stefano Tu...
ICIP
2004
IEEE
14 years 7 months ago
Robust perceptual image hashing using feature points
Perceptual image hashing maps an image to a fixed length binary string based on the image's appearance to the human eye, and has applications in image indexing, authenticatio...
Vishal Monga, Brian L. Evans
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 14 days ago
Strict Authentication Watermarking with JPEG Compression (SAW-JPEG) for Medical Images
This paper proposes a strict authentication watermarking for medical images. In this scheme, we define region of interest (ROI) by taking the smallest rectangle around an image. T...
Jasni Mohamad Zain