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

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

PatchMatch: a randomized correspondence algorithm for structural image editing

Barnes, Connelly, Shechtman, Eli, Finkelstein, Adam, Goldman, Dan B·2009·ACM SIGGRAPH 2009 papers

Abstract

This paper presents interactive image editing tools using a new randomized algorithm for quickly finding approximate nearest-neighbor matches between image patches. Previous research in graphics and vision has leveraged such nearest-neighbor searches to provide a variety of high-level digital image editing tools. However, the cost of computing a field of such matches for an entire image has eluded previous efforts to provide interactive performance. Our algorithm offers substantial performance improvements over the previous state of the art (20-100x), enabling its use in interactive editing tools. The key insights driving the algorithm are that some good patch matches can be found via random sampling, and that natural coherence in the imagery allows us to propagate such matches quickly to surrounding areas. We offer theoretical analysis of the convergence properties of the algorithm, as well as empirical and practical evidence for its high quality and performance. This one simple algorithm forms the basis for a variety of tools -- image retargeting, completion and reshuffling -- that can be used together in the context of a high-level image editing application. Finally, we propose additional intuitive constraints on the synthesis process that offer the user a level of control unavailable in previous methods.

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.1145/1576246.1531330

Cites

30 of 30 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 30 references

Research works printed but not linked: 6

  1. 10.1145/1276377.1276392 · doi:10.1145/1276377.1276392
  2. 10.1145/1073204.1073261 · doi:10.1145/1073204.1073261
  3. Mount , D. M. , and Arya , S. , 1997 . ANN: A library for approximate nearest neighbor searching, Oct. 28. Mount, D. M., and Arya, S., 1997. ANN: A library for approximate nearest neighbor searching, Oct. 28.
  4. 10.1145/1111411.1111431 · doi:10.1145/1111411.1111431
  5. 10.1145/1186822.1073274 · doi:10.1145/1186822.1073274
  6. 10.1145/1457515.1409071 · doi:10.1145/1457515.1409071

Cited by

See all 364

Metadata

Authors
Barnes, C., Shechtman, E., Finkelstein, A., & Goldman, D. B.
Venue
ACM SIGGRAPH 2009 papers
Publisher
ACM
Published
2009-07-27
Pages
1-11
OpenAlex
W4249710618
Cited by
364
References
30
FWCI
9.00
Type
conference paper
Language
en
Open access
closed
Funders
Division of Information and Intelligent Systems (IIS-0511965)

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: PatchMatch: a randomized correspondence algorithm for structural image editing. https://app.cochat.ai/papers/10.1145/1576246.1531330
The paper
Barnes, C., Shechtman, E., Finkelstein, A., & Goldman, D. B. (2009). PatchMatch: a randomized correspondence algorithm for structural image editing. ACM SIGGRAPH 2009 papers. https://doi.org/10.1145/1576246.1531330

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.