ACM Home Page
Please provide us with feedback. Feedback
Coordinates for instant image cloning
Full text PdfPdf (9.15 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 28 ,  Issue 3  (August 2009) table of contents
Proceedings of ACM SIGGRAPH 2009
SESSION: Visual, cut, paste, and search table of contents
Article No. 67  
Year of Publication: 2009
ISSN:0730-0301
Also published in ...
Authors
Zeev Farbman  Hebrew University
Gil Hoffer  Tel Aviv University
Yaron Lipman  Princeton University
Daniel Cohen-Or  Tel Aviv University
Dani Lischinski  Hebrew University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 66,   Downloads (12 Months): 205,   Citation Count: 0
Additional Information:

appendices and supplements   abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1531326.1531373
What is a DOI?

APPENDICES and SUPPLEMENTS
The auxiliary material for this paper consists of two movie files: 1. a supplemental video (an integral part of the paper) 2. additional examples of real-time seamless video cloning


ABSTRACT

Seamless cloning of a source image patch into a target image is an important and useful image editing operation, which has received considerable research attention in recent years. This operation is typically carried out by solving a Poisson equation with Dirichlet boundary conditions, which smoothly interpolates the discrepancies between the boundary of the source patch and the target across the entire cloned area. In this paper we introduce an alternative, coordinate-based approach, where rather than solving a large linear system to perform the aforementioned interpolation, the value of the interpolant at each interior pixel is given by a weighted combination of values along the boundary. More specifically, our approach is based on Mean-Value Coordinates (MVC). The use of coordinates is advantageous in terms of speed, ease of implementation, small memory footprint, and parallelizability, enabling real-time cloning of large regions, and interactive cloning of video streams. We demonstrate a number of applications and extensions of the coordinate-based framework.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
Carrier, J., Greengard, L., and Rokhlin, V. 1988. A fast adaptive multipole algorithm for particle simulations. SIAM Journal on Scientific and Statistical Computing 9, 669--686.
 
5
Cgal, 2007. Computational Geometry Algorithms Library. http://www.cgal.org.
6
 
7
 
8
 
9
 
10
Georgiev, T. 2004. Photoshop healing brush: a tool for seamless cloning. In Workshop on Applications of Computer Vission (ECCV 2004), 1--8.
11
12
13
14
15
16
 
17
Land, E. H., and McCann, J. J. 1971. Lightness and Retinex Theory. J. Opt. Soc. Amer. 61 (Jan.), 1--11.
 
18
Langer, T., and Seidel, H.-P. 2008. Higher order barycentric coordinates. Computer Graphics Forum (Eurographics 2008) 27, 2, 459--466.
 
19
Levin, A., Zomet, A., Peleg, S., and Weiss, Y. 2004. Seamless image stitching in the gradient domain. In Proc. ECCV, Springer-Verlag, vol. IV, 377--389.
 
20
21
 
22
Palmer, S. E. 1999. Vision Science: Photons to Phenomenology. The MIT Press, May.
23
24
25
 
26
Wachpress, E. L. 1975. A Rational Finite Element Basis. Academic Press, New York.
 
27
Wang, J., and Cohen, M. F. 2007. Optimized color sampling for robust matting. In Proc. CVPR, 1--8.
 
28
 
29
Warren, J. 1996. Barycentric coordinates for convex polytopes. Advances in Computational Mathematics 6, 2, 97--108.
 
30
Weiss, Y. 2001. Deriving intrinsic images from image sequences. In Proc. ICCV, 68--75.

Collaborative Colleagues:
Zeev Farbman: colleagues
Gil Hoffer: colleagues
Yaron Lipman: colleagues
Daniel Cohen-Or: colleagues
Dani Lischinski: colleagues