Construct · 1 fields · 1 citations

PatchMatch: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer graphics

a fast randomized search for approximate nearest-neighbour patches between images, spreading good matches to neighbours.

In computer graphics, PatchMatch refers to a fast randomized search for approximate nearest-neighbour patches between images, spreading good matches to neighbours. This meaning comes from Barnes et al. (2009) in ACM Transactions on Graphics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how PatchMatch sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

good2 fields · 5 citationsjingle · one word, two constructs search4 fields · 7 citationsjingle · one word, four constructs

References

Barnes, C., Shechtman, E., Finkelstein, A., & Goldman, D. B. (2009). PatchMatch: A randomized correspondence algorithm for structural image editing. ACM Transactions on Graphics, 28(3), 1-11. https://doi.org/10.1145/1531326.1531330

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct