The DOI matches its Crossref record.
Detecting image near-duplicate by stochastic attributed relational graph matching with learning
Abstract
Detecting Image Near-Duplicate (IND) is an important problem in a variety of applications, such as copyright infringement detection and multimedia linking. Traditional image similarity models are often difficult to identify IND due to their inability to capture scene composition and semantics. We present a part-based image similarity measure derived from stochastic matching of Attributed Relational Graphs that represent the compositional parts and part relations of image scenes. Such a similarity model is fundamentally different from traditional approaches using low-level features or image alignment. The advantage of this model is its ability to accommodate spatial attributed relations and support supervised and unsupervised learning from training data. The experiments compare the presented model with several prior similarity models, such as color histogram, local edge descriptor, etc. The presented model outperforms the prior approaches with large margin.
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Image retrieval: Ideas, influences, and trends of the new age
Datta, R., Joshi, D., Li, J., & Wang, J. Z. (2008) · ACM Computing Surveys · doi:10.1145/1348246.1348248 · Cited by 3,040
Near Duplicate Image Detection: min-Hash and tf-idf Weighting
Chum, O., Philbin, J., & Zisserman, A. (2008) · Procedings of the British Machine Vision Conference 2008 · doi:10.5244/c.22.50 · Cited by 460
Practical elimination of near-duplicates from web video search
Wu, X., Hauptmann, A. G., & Ngo, C.-W. (2007) · Proceedings of the 15th ACM international conference on Multimedia · doi:10.1145/1291233.1291280 · Cited by 340
Content-Based Copy Retrieval Using Distortion-Based Probabilistic Similarity Search
Joly, A., Buisson, O., & Frelicot, C. (2007) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2006.886278 · Cited by 261
Scalable detection of partial near-duplicate videos by visual-temporal consistency
Tan, H.-K., Ngo, C.-W., Hong, R., & Chua, T.-S. (2009) · Proceedings of the 17th ACM international conference on Multimedia · doi:10.1145/1631272.1631295 · Cited by 110
Metadata
- Authors
- Zhang, D.-Q., & Chang, S.-F.
- Venue
- Proceedings of the 12th annual ACM international conference on Multimedia
- Publisher
- ACM
- Published
- 2004-10-10
- Pages
- 877-884
- OpenAlex
- W1967666795
- Cited by
- 197
- References
- 0
- FWCI
- 11.27
- 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: Detecting image near-duplicate by stochastic attributed relational graph matching with learning. https://app.cochat.ai/papers/10.1145/1027527.1027730
- The paper
- Zhang, D.-Q., & Chang, S.-F. (2004). Detecting image near-duplicate by stochastic attributed relational graph matching with learning. Proceedings of the 12th annual ACM international conference on Multimedia. https://doi.org/10.1145/1027527.1027730
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.