Robust image hashing

R. Venkatesan, S. M. Koon, M. H. Jakubowski, P. Moulin

Research output: Contribution to conferencePaperpeer-review

Abstract

The proliferation of digital images creates problems for managing large image databases, indexing individual images, and protecting intellectual property. This paper introduces a novel image indexing technique that may be called an image hash function. The algorithm uses randomized signal processing strategies for a non-reversible compression of images into random binary strings, and is shown to be robust against image changes due to compression, geometric distortions, and other attacks. This algorithm brings to images a direct analog of Message Authentication Codes (MACs) from cryptography, in which a main goal is to make hash values on a set of distinct inputs pairwise independent. This minimizes the probability that two hash values collide, even when inputs are generated by an adversary.

Original languageEnglish (US)
Pages[d]664-666
StatePublished - 2000
Externally publishedYes
EventInternational Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada
Duration: Sep 10 2000Sep 13 2000

Other

OtherInternational Conference on Image Processing (ICIP 2000)
Country/TerritoryCanada
CityVancouver, BC
Period9/10/009/13/00

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Robust image hashing'. Together they form a unique fingerprint.

Cite this