The PatchMatch Randomized Matching Algorithm for Image Manipulation

By Connelly Barnes, Dan B. Goldman, Eli Shechtman, Adam Finkelstein
Communications of the ACM, Vol. 54 No. 11, Pages 103-110
10.1145/2018396.2018421
Comments

View as: Print ACM Digital Library Full Text (PDF) In the Digital Edition Share: Send by email Share on reddit Share on StumbleUpon

Share on Tweeter Share on Facebook

This paper presents a new randomized algorithm for quickly finding approximate nearest neighbor matches between image patches. Our algorithm offers substantial performance improvements over the previous state of the art.

The full text of this article is premium content

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Communications of the ACM