Talk:PatchMatch
 | This article was nominated for deletion on 28 June 2013 (UTC). The result of the discussion was no consensus. |
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Connection to Bellman-Ford[edit]
PatchMatch is a variant of the classical Bellman-Ford algorithm (neighboring pixels communicate similarly to Bellman-Ford, while the distances are computed in image-space "outside the graph"). Connecting to the Bellman-Ford article, with explanation on the importance of the image scan-order, would make the description clearer for those who already studied the Bellman-Ford algorithm in standard computer science courses.
Corrections[edit]
Hi, I'm Connelly and PatchMatch was my Ph.D. thesis at Princeton. I wanted to correct the opening sentence which currently says "PatchMatch is an algorithm to fill the missing patches on natural images with little difference to human eyes." I think Wikipedia conflict of interest policy is against people editing topics related to their own work. But perhaps another author can make a few corrections: The core PatchMatch algorithm quickly finds correspondences between small square regions (or patches) of an image. The algorithm can be used in various applications such as object removal from images, reshuffling or moving contents of images, or retargeting or changing aspect ratios of images. - Connelly (talk) 02:26, 24 September 2013 (UTC)