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.
Original language | English |
---|---|
Title of host publication | Proceedings of ACM SIGGRAPH Asia 2009, SIGGRAPH Asia '09 |
Pages | 118:1-118:6 |
Volume | 28 |
Edition | 5 |
DOIs | |
State | Published - 2009 |
Event | ACM SIGGRAPH Asia 2009, SIGGRAPH Asia '09 - Yokohama, Japan Duration: Dec 16 2009 → Dec 19 2009 |
Conference
Conference | ACM SIGGRAPH Asia 2009, SIGGRAPH Asia '09 |
---|---|
Country/Territory | Japan |
City | Yokohama |
Period | 12/16/09 → 12/19/09 |