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.

AppProp: All-Pairs Appearance-Space Edit Propagation / X., An; Pellacini, Fabio. - In: ACM TRANSACTIONS ON GRAPHICS. - ISSN 0730-0301. - 27:3(2008), pp. 40:1-40:9. [10.1145/1360612.1360639]

AppProp: All-Pairs Appearance-Space Edit Propagation

PELLACINI, FABIO
2008

Abstract

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.
2008
27
3
40:1
40:9
AppProp: All-Pairs Appearance-Space Edit Propagation / X., An; Pellacini, Fabio. - In: ACM TRANSACTIONS ON GRAPHICS. - ISSN 0730-0301. - 27:3(2008), pp. 40:1-40:9. [10.1145/1360612.1360639]
X., An; Pellacini, Fabio
File in questo prodotto:
File Dimensione Formato  
appprop08-paper.pdf

Accesso riservato

Tipologia: Versione pubblicata dall'editore
Dimensione 1.02 MB
Formato Adobe PDF
1.02 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1299615
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 170
  • ???jsp.display-item.citation.isi??? 157
social impact