AppProp: all-pairs appearance-space edit propagation

We present an intuitive and efficient method for editing the appearance of complex spatially-varying datasets, such as images and measured materials. In our framework, users specify rough adjustments that are refined interactively by enforcing the policy that similar edits are applied to spatially-close regions of similar appearance. Rather than proposing a specific user interface, our method allows artists to quickly and imprecisely specify the initial edits with any method or workflow they feel most comfortable with. An energy optimization formulation is used to propagate the initial rough adjustments to the final refined ones by enforcing the editing policy over all pairs of points in the dataset. We show that this formulation is equivalent to solving a large linear system defined by a dense matrix. We derive an approximate algorithm to compute such a solution interactively by taking advantage of the inherent structure of the matrix. We demonstrate our approach by editing images, HDR radiance maps, and measured materials. Finally, we show that our framework generalizes prior methods while providing significant improvements in generality, robustness and efficiency.

[1]  Harry Shum,et al.  Natural Image Colorization , 2007, Rendering Techniques.

[2]  Petros Drineas,et al.  On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..

[3]  Zeev Farbman,et al.  Interactive local adjustment of tonal values , 2006, SIGGRAPH 2006.

[4]  Dani Lischinski,et al.  Joint bilateral upsampling , 2007, SIGGRAPH 2007.

[5]  Michael Cohen,et al.  Soft scissors: an interactive tool for realtime high quality matting , 2007, SIGGRAPH 2007.

[6]  Gene H. Golub,et al.  Matrix computations , 1983 .

[7]  Richard Szeliski,et al.  Digital photography with flash and no-flash image pairs , 2004, ACM Trans. Graph..

[8]  Jiawen Chen,et al.  Real-time edge-aware image processing with the bilateral grid , 2007, SIGGRAPH 2007.

[9]  Greg Ward,et al.  High dynamic range imaging , 2004, SIGGRAPH '04.

[10]  Dani Lischinski,et al.  Colorization using optimization , 2004, SIGGRAPH 2004.

[11]  Wojciech Matusik,et al.  Inverse shade trees for non-parametric material representation and editing , 2006, SIGGRAPH 2006.

[12]  Jitendra Malik,et al.  Spectral grouping using the Nystrom method , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Hans-Peter Seidel,et al.  Image-based reconstruction of spatial appearance and geometric detail , 2003, TOGS.

[14]  K. Bala,et al.  Matrix row-column sampling for the many-light problem , 2007, ACM Trans. Graph..

[15]  Matthias W. Seeger,et al.  Using the Nyström Method to Speed Up Kernel Machines , 2000, NIPS.

[16]  Jitendra Malik,et al.  Efficient spatiotemporal grouping using the Nystrom method , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[17]  S. Marschner,et al.  Measuring and modeling the appearance of finished wood , 2005, SIGGRAPH 2005.

[18]  Frédo Durand,et al.  Flash photography enhancement via intrinsic relighting , 2004, SIGGRAPH 2004.

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

[20]  Shree K. Nayar,et al.  Time-varying surface appearance , 2006, SIGGRAPH 2006.

[21]  Tien-Tsin Wong,et al.  Manga colorization , 2006, SIGGRAPH 2006.

[22]  Dani Lischinski,et al.  Colorization by example , 2005, EGSR '05.