Adrian Hatch on PatchMatch

​​Main: Adrian Hatch on "PatchMatch: a randomized correspondence algorithm for structural image editing"

​Abstract: This paper presents interactive image editing tools using 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 (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...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.

​Bio: Forthcoming.

​​Mini: You!

​Come give a 15-minute talk on your favorite paper! Sign up here.