Automatic Image Colorization Via Multimodal Predictions

We aim to color greyscale images automatically, without any manual intervention. The color proposition could then be interactively corrected by user-provided color landmarks if necessary. Automatic colorization is nontrivial since there is usually no one-to-one correspondence between color and local texture. The contribution of our framework is that we deal directly with multimodality and estimate, for each pixel of the image to be colored, the probability distribution of all possible colors, instead of choosing the most probable color at the local level. We also predict the expected variation of color at each pixel, thus defining a non-uniform spatial coherency criterion. We then use graph cuts to maximize the probability of the whole colored image at the global level. We work in the L-a-b color space in order to approximate the human perception of distances between colors, and we use machine learning tools to extract as much information as possible from a dataset of colored examples. The resulting algorithm is fast, designed to be more robust to texture noise, and is above all able to deal with ambiguity, in contrary to previous approaches.

[1]  Diego Reforgiato Recupero,et al.  Fast colorization of gray images , 2003 .

[2]  Marisa E. Campbell,et al.  SIGGRAPH 2004 , 2004, INTR.

[3]  Klaus Mueller,et al.  Transferring color to greyscale images , 2002, ACM Trans. Graph..

[4]  Christopher Hunt,et al.  Notes on the OpenSURF Library , 2009 .

[5]  Kiyoharu Aizawa,et al.  Advances in Multimedia Information Processing - PCM 2004, 5th Pacific Rim Conference on Multimedia, Tokyo, Japan, November 30 - December 3, 2004, Proceedings, Part I , 2005, Pacific Rim Conference on Multimedia.

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

[7]  Anthony Widjaja,et al.  Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond , 2003, IEEE Transactions on Neural Networks.

[8]  Mads Nielsen,et al.  Computer Vision — ECCV 2002 , 2002, Lecture Notes in Computer Science.

[9]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

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

[11]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields , 2006, ECCV.

[12]  Takahiko Horiuchi,et al.  Colorization algorithm using probabilistic relaxation , 2004, Image Vis. Comput..

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

[14]  J. M. Gerzso,et al.  Computer graphics and interactive techniques: 15th-17th July 1974. Boulder, Colorado, USA. Sponsored by the University of Colorado Computing Centre and ACM/SIGGRAPH , 1975, Comput. Aided Des..

[15]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Takahiko Horiuchi,et al.  Improvement on Colorization Accuracy by Partitioning Algorithm in CIELAB Color Space , 2004, PCM.

[17]  Antti Oulasvirta,et al.  Computer Vision – ECCV 2006 , 2006, Lecture Notes in Computer Science.

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

[19]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.