Abstract
Edge-aware operations, such as edge-preserving smoothing and edge-aware interpolation, require assessing the degree of similarity between pairs of pixels, typically defined as a simple monotonic function of the Euclidean distance between pixel values in some feature space. In this work we introduce the idea of replacing these Euclidean distances with diffusion distances, which better account for the global distribution of pixels in their feature space. These distances are approximated using diffusion maps: a set of the dominant eigenvectors of a large affinity matrix, which may be computed efficiently by sampling a small number of matrix columns (the Nyström method). We demonstrate the benefits of using diffusion distances in a variety of image editing contexts, and explore the use of diffusion maps as a tool for facilitating the creation of complex selection masks. Finally, we present a new analysis that establishes a connection between the spatial interaction range between two pixels, and the number of samples necessary for accurate Nyström approximations.
Original language | English |
---|---|
Title of host publication | Proceedings of ACM SIGGRAPH Asia 2010, SIGGRAPH Asia 2010 |
Volume | 29 |
Edition | 6 |
DOIs | |
State | Published - 2010 |
Event | ACM SIGGRAPH Asia 2010, SIGGRAPH Asia 2010 - Seoul, Korea, Republic of Duration: 15 Dec 2010 → 18 Dec 2010 |
Conference
Conference | ACM SIGGRAPH Asia 2010, SIGGRAPH Asia 2010 |
---|---|
Country/Territory | Korea, Republic of |
City | Seoul |
Period | 15/12/10 → 18/12/10 |
Keywords
- Nyström method
- diffusion maps
- edge-aware interpolation
- edge-preserving smoothing
- edit propagation