 |
cv.snu.ac.kr
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blending of the scribbles. Unlike previous works which utilize the shortest distance as the blending weights, we employ a new intrinsic distance measure based on the Random Walks with Restart (RWR), known as a very successful technique for defining the relevance between two nodes in a graph. In our work, we devise new modified data-driven RWR framework that can incorporate locally adaptive and data-driven restarting probabilities. In this new framework, the restarting probability of each pixel becomes dependent on its edgeness, generated by the canny detector. Since this data-driven RWR enforces color consistency in the areas bounded by the edges, it produces more reliable edge-preserving colorization results that are less sensitive to the size and position of each scribble. Moreover, if the additional information about the scribbles which indicate the foreground object is available, our method can be readily applied to the object segmentation and matting. Experiments on several synthetic, cartoon and natural images demonstrate that our method achieves much high quality colorization results compared with the state-of-the-art methods.
Tae Hoon Kim, Kyoung Mu Lee, and Sang Uk Lee
|
2
Weave it
ICIP - 2009
IEEE
Visitor Map
|
|||||||||||||
| |||||||||||||||
|
 | 25 | United States |
 | 7 | Turkey |
 | 4 | Russian Federation |
 | 2 | Korea, Republic of |
 | 1 | United Kingdom |
 | 1 | China |
 | 1 | Germany |
 | 1 | Iran, Islamic Republic of |
 | 1 | Taiwan |
| 7 | Hellenic Open University |
| 2 | Seoul National University |
| 1 | the Pennsylvania State University |
Discussion Board (0)