Name
Abstract | ||
|---|---|---|
We propose a graph matching-based anime-colorization method from line drawings using multiple reference images. A graph structure of each frame in an input line drawing sequence helps to find correspondences of regions to be colorized between frames. However, it is difficult to find precise correspondences of whole frames only from a single reference image, because the graph structure tends to change drastically during the sequence. Therefore, our method first finds an optimal image from multiple reference images according to a cost function that represents shape similarity between nodes and compatibility of node pairs. While it is necessary to prepare several manually colored reference images, our method is still effective in reducing the effort required for colorization in anime production. We demonstrate the effectiveness of our method using actual images from our production.
|
Year | DOI | Keywords |
|---|---|---|
2019 | 10.1145/3306214.3338560 | anime, colorization, graph matching, multiple references |
Field | DocType | ISSN |
Computer vision,Computer graphics (images),Computer science,Matching (graph theory),Artificial intelligence,Anime | Conference | 978-1-4503-6314-3 |
ISBN | Citations | PageRank |
978-1-4503-6314-3 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akinobu Maejima | 1 | 58 | 20.57 |
| Hiroyuki Kubo | 2 | 11 | 10.03 |
| Takuya Funatomi | 3 | 74 | 24.62 |
| Tatsuo Yotsukura | 4 | 22 | 8.93 |
| Satoshi Nakamura | 5 | 1099 | 194.59 |
| Yasuhiro Mukaigawa | 6 | 478 | 53.31 |