Real Time Edit Propagation by Efficient Sampling
| dc.contributor.author | Bie, Xiaohui | en_US |
| dc.contributor.author | Huang, Haoda | en_US |
| dc.contributor.author | Wang, Wencheng | en_US |
| dc.contributor.editor | Bing-Yu Chen, Jan Kautz, Tong-Yee Lee, and Ming C. Lin | en_US |
| dc.date.accessioned | 2015-02-27T16:13:42Z | |
| dc.date.available | 2015-02-27T16:13:42Z | |
| dc.date.issued | 2011 | en_US |
| dc.description.abstract | It is popular to edit the appearance of images using strokes, owing to their ease of use and convenience of conveying the user's intention. However, propagating the user inputs to the rest of the images requires solving an enormous optimization problem, which is very time consuming, thus preventing its practical use. In this paper, a two-step edit propagation scheme is proposed, first to solve edits on clusters of similar pixels and then to interpolate individual pixel edits from cluster edits. The key in our scheme is that we use efficient stroke sampling to compute the affinity between image pixels and strokes. Based on this, our clustering does not need to be strokeadaptive and thus the number of clusters is greatly reduced, resulting in a significant speedup. The proposed method has been tested on various images, and the results show that it is more than one order of magnitude faster than existing methods, while still achieving precise results compared with the ground truth. Moreover, its efficiency is not sensitive to the number of strokes, making it suitable for performing dense edits in practice. | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2011.02059.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2011.02059.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Real Time Edit Propagation by Efficient Sampling | en_US |