Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 497

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Robust image hashing

Venkatesan, R., Koon, S.-M., Jakubowski, M.H., Moulin, P.·2002·Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icip.2000.899541

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 497

Metadata

Authors
Venkatesan, R., Koon, S.-M., Jakubowski, M. H., & Moulin, P.
Venue
Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101)
Publisher
IEEE
Published
2002-11-11
Pages
664-666
ISSN
1522-4880 (ISSN-L)
OpenAlex
W2109376948
Cited by
497
References
8
FWCI
13.47
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Robust image hashing. https://app.cochat.ai/papers/10.1109/icip.2000.899541
The paper
Venkatesan, R., Koon, S.-M., Jakubowski, M. H., & Moulin, P. (2002). Robust image hashing. Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101). https://doi.org/10.1109/icip.2000.899541

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.