.png){kind=icon}
Return
Efficient Affinity-based Edit Propagation using K-D Tree
.png){kind=icon}
OA
AI
DOI：10.1145/1618452.1618464.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
IMAGE
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.5
Papers:
4.7K
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveTinnitus Retraining Therapy (TRT) as a Method for Treatment of Tinnitus and Hyperacusis Patients
PREAI
ShareSaveShareSaveShareSave
View more