Efficient manifold preserving edit propagation with adaptive neighborhood size

Recent manifold preserving edit propagation (Chen et al., 2012) [1] provides a robust way for propagating sparse user edits to a whole image or video, which preserves the manifold structure formed by all pixels in feature space during edit propagation. However, it consumes a big amount of time and memory especially for large images/videos, limiting its practical usage. In this paper, we propose an efficient manifold preserving edit propagation method. We accelerate the original method from two aspects. First, instead of using a fixed neighborhood size in building the manifold structure, we adaptively determine neighborhood size for each pixel based on its local complexity in feature space, which largely reduces average neighborhood size. Secondly, following Xu et al. (2009) [2], we adaptively cluster all pixels, and solve the edit propagation problem on clusters instead of pixels. Our experiment shows that, compared to the original method (Chen et al., 2012) [1], our method significantly reduce time and memory costs without reducing visual fidelity.

[1]  Shi-Min Hu,et al.  Instant Propagation of Sparse Edits on Images and Videos , 2010, Comput. Graph. Forum.

[2]  Shi-Min Hu,et al.  Efficient affinity-based edit propagation using K-D tree , 2009, ACM Trans. Graph..

[3]  Min Chen,et al.  Hierarchical Event Selection for Video Storyboards with a Case Study on Snooker Video Visualization , 2011, IEEE Transactions on Visualization and Computer Graphics.

[4]  Wencheng Wang,et al.  Real Time Edit Propagation by Efficient Sampling , 2011, Comput. Graph. Forum.

[5]  Dani Lischinski,et al.  Colorization using optimization , 2004, ACM Trans. Graph..

[6]  Dani Lischinski,et al.  Spectral Matting , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[8]  Aseem Agarwala,et al.  Efficient gradient-domain compositing using quadtrees , 2007, ACM Trans. Graph..

[9]  Xiaowu Chen,et al.  Manifold preserving edit propagation , 2012, ACM Trans. Graph..

[10]  Zeev Farbman,et al.  Interactive local adjustment of tonal values , 2006, ACM Trans. Graph..

[11]  M. Levoy,et al.  Gaussian KD-trees for fast high-dimensional filtering , 2009, SIGGRAPH 2009.

[12]  Zhenjiang Miao,et al.  Video matting via opacity propagation , 2011, The Visual Computer.

[13]  Joseph JáJá,et al.  Hierarchical Exploration of Volumes Using Multilevel Segmentation of the Intensity-Gradient Histograms , 2012, IEEE Transactions on Visualization and Computer Graphics.

[14]  Meng Liu,et al.  Fast hierarchical animated object decomposition using approximately invariant signature , 2012, The Visual Computer.

[15]  Fabio Pellacini,et al.  AppProp: all-pairs appearance-space edit propagation , 2008, ACM Trans. Graph..

[16]  Yongwei Nie,et al.  Efficient Edit Propagation Using Hierarchical Data Structure , 2011, IEEE Transactions on Visualization and Computer Graphics.

[17]  Jason Lawrence,et al.  AppWand: editing measured materials using appearance-driven optimization , 2007, SIGGRAPH 2007.

[18]  Kun Xu,et al.  Efficient antialiased edit propagation for images and videos , 2012, Comput. Graph..

[19]  Ching-Kuang Shene,et al.  Hierarchical Streamline Bundles , 2012, IEEE Transactions on Visualization and Computer Graphics.

[20]  Raanan Fattal,et al.  Diffusion maps for edge-aware image editing , 2010, SIGGRAPH 2010.