PatchMatch: A Randomized Correspondence Algorithm for ...

← Back to document page

PatchMatch: A Randomized Correspondence Algorithm for Structural Image EditingConnelly Barnes1Eli Shechtman2,3Adam Finkelstein1Dan B Goldman21Princeton University2Adobe Systems3University of Washington(a)original(b) hole+constraints(c) hole filled(d) constraints(e) constrained retarget(f) reshuffleFigure 1:Structural image editing. Left to right: (a) the original image; (b) a hole is marked (magenta) and we use line constraints(red/green/blue) to improve the continuity of the roofline; (c) the hole is filled in; (d) user-supplied line constraints for retargeting;(e) retargeting using constraints eliminates two columns automatically; and (f) user translates the roof upward using paper presents interactive image editing tools using a newrandomized Algorithm for quickly finding approximate nearest-neighbor matches between image patches.

sible patch offsets, achieving greater speed and memory efficiency. Natural structure of images. Second, the usual independent search for each pixel ignores the natural structure in images. In patch-sampling synthesis algorithms, the output typically contains large contiguous chunks of data from the input (as observed by Ashikhmin [2001]).

  Patch