Fast Colorization Using Edge and Gradient Constrains

This paper proposes a fast but effective user-guided colorization algorithm. The main difficulty with colorization is its intensive computational cost. And the color sometimes diffuses from one region to others. We make full use of the information given by the gray-scale images, including the edge, gradient and gradient direction, to propagate color over regions from the user’s scribbles. We introduce a novel local distance definition which reduces the color confusion between two regions obviously. Two-Dimensional Programming is used to get the minimum distance from the scribbles to every pixel, and every pixel is blended by the chrominance with top three minimum distances. This speeds up the colorization process. Our algorithm can also be extended to recolorization and movie colorization. Experimental results show that our algorithm outperforms many state-ofthe-art algorithms from small amount of user scribbles. Besides, the implementation require less than 1 second on the image with 320*240 pixels.

[1]  Dani Lischinski,et al.  Colorization using optimization , 2004, ACM Trans. Graph..

[2]  Guillermo Sapiro,et al.  Inpainting the colors , 2005, IEEE International Conference on Image Processing 2005.

[3]  Wilson Markle The Development and Application of Colorization , 1984 .

[4]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Guillermo Sapiro,et al.  Fast image and video colorization using chrominance blending , 2006, IEEE Transactions on Image Processing.

[6]  Jirí Zára,et al.  Unsupervised colorization of black-and-white cartoons , 2004, NPAR '04.

[7]  David Salesin,et al.  Image Analogies , 2001, SIGGRAPH.

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[9]  Dani Lischinski,et al.  Colorization by example , 2005, EGSR '05.