“Efficient affinity-based edit propagation using K-D tree”
Conference:
Type(s):
Title:
- Efficient affinity-based edit propagation using K-D tree
Session/Category Title: Vectorization/editing
Presenter(s)/Author(s):
Moderator(s):
Abstract:
Image/video editing by strokes has become increasingly popular due to the ease of interaction. Propagating the user inputs to the rest of the image/video, however, is often time and memory consuming especially for large data. We propose here an efficient scheme that allows affinity-based edit propagation to be computed on data containing tens of millions of pixels at interactive rate (in matter of seconds). The key in our scheme is a novel means for approximately solving the optimization problem involved in edit propagation, using adaptive clustering in a high-dimensional, affinity space. Our approximation significantly reduces the cost of existing affinity-based propagation methods while maintaining visual fidelity, and enables interactive stroke-based editing even on high resolution images and long video sequences using commodity computers.
References:
1. Adams, A., Gelfand, N., Dolson, J., and Levoy, M. 2009. Gaussian kd-trees for fast high-dimensional filtering. ACM Trans. Graph. 28, 3, 21. Google ScholarDigital Library
2. Agarwala, A. 2007. Efficient gradient-domain compositing using quadtrees. ACM Trans. Graph. 26, 3, 94. Google ScholarDigital Library
3. An, X., and Pellacini, F. 2008. Appprop: all-pairs appearance-space edit propagation. ACM Trans. Graph. 27, 3, 40. Google ScholarDigital Library
4. Chen, J., Sylvain, P., and Frédo, D. 2007. Real-time edge-aware image processing with the bilateral grid. ACM Trans. Graph. 26, 3, 103. Google ScholarDigital Library
5. Cheslack-Postava, E., Wang, R., Akerlund, O., and Pellacini, F. 2008. Fast, realistic lighting and material design using nonlinear cut approximation. ACM Trans. Graph. 27, 5, 128. Google ScholarDigital Library
6. Fattal, R., Carroll, R., and Agrawala, M. 2009. Edge-based image coarsening. to appear in ACM Trans. Graph. Google ScholarDigital Library
7. Fattal, R. 2009. Edge-avoiding wavelets and their applications. ACM Trans. Graph. 28, 3, 22. Google ScholarDigital Library
8. Hanrahan, P., Salzman, D., and Aupperle, L. 1991. A rapid hierarchical radiosity algorithm. SIGGRAPH Comput. Graph. 25, 4, 197–206. Google ScholarDigital Library
9. Kopf, J., Cohen, M. F., Lischinski, D., and Uyttendaele, M. 2007. Joint bilateral upsampling. ACM Trans. Graph. 26, 3, 96. Google ScholarDigital Library
10. Levin, A., Lischinski, D., and Weiss, Y. 2004. Colorization using optimization. ACM Trans. Graph. 23, 3, 689–694. Google ScholarDigital Library
11. Li, Y., H., A. E., and Aseem, A. 2008. Scribbleboost: Adding classification to edge-aware interpolation of local image and video adjustments. Computer Graphics Forum 27, 4 (June), 1255–1264.Google ScholarDigital Library
12. Lischinski, D., Farbman, Z., Uyttendaele, M., and Szeliski, R. 2006. Interactive local adjustment of tonal values. ACM Trans. Graph. 25, 3, 646–653. Google ScholarDigital Library
13. Pellacini, F., and Lawrence, J. 2007. Appwand: editing measured materials using appearance-driven optimization. ACM Trans. Graph. 26, 3, 54. Google ScholarDigital Library
14. Shi, J., and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 8, 888–905. Google ScholarDigital Library
15. Walter, B., Fernandez, S., Arbree, A., Bala, K., Donikian, M., and Greenberg, D. P. 2005. Lightcuts: a scalable approach to illumination. ACM Trans. Graph. 24, 3, 1098–1107. Google ScholarDigital Library
16. Walter, B., Arbree, A., Bala, K., and Greenberg, D. P. 2006. Multidimensional lightcuts. ACM Trans. Graph. 25, 3, 1081–1088. Google ScholarDigital Library
17. Yatziv, L., and Sapiro, G. 2006. Fast image and video colorization using chrominance blending. IEEE Transactions on Image Processing 15, 5, 1120–1129. Google ScholarDigital Library
