Fast image and video colorization using chrominance blending
- 18 April 2006
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 15 (5), 1120-1129
- https://doi.org/10.1109/tip.2005.864231
Abstract
Colorization, the task of coloring a grayscale image or video, involves assigning from the single dimension of intensity or luminance a quantity that varies in three dimensions, such as red, green, and blue channels. Mapping between intensity and color is, therefore, not unique, and colorization is ambiguous in nature and requires some amount of human interaction or external information. A computationally simple, yet effective, approach of colorization is presented in this paper. The method is fast and it can be conveniently used "on the fly," permitting the user to interactively get the desired results promptly after providing a reduced set of chrominance scribbles. Based on the concepts of luminance-weighted chrominance blending and fast intrinsic distance computations, high-quality colorization results for still images and video are obtained at a fraction of the complexity and computational cost of previously reported techniques. Possible extensions of the algorithm introduced here included the capability of changing the colors of an existing color image or video, as well as changing the underlying luminance, and many other special effects demonstrated here.Keywords
This publication has 21 references indexed in Scilit:
- Fast Sweeping Methods for Static Hamilton--Jacobi EquationsSIAM Journal on Numerical Analysis, 2005
- A fast sweeping method for Eikonal equationsMathematics of Computation, 2004
- Structure and texture filling-in of missing image blocks in wireless transmission and compression applicationsIEEE Transactions on Image Processing, 2003
- Transferring color to greyscale imagesACM Transactions on Graphics, 2002
- Color transfer between imagesIEEE Computer Graphics and Applications, 2001
- A fast marching level set method for monotonically advancing fronts.Proceedings of the National Academy of Sciences of the United States of America, 1996
- Efficient algorithms for globally optimal trajectoriesIEEE Transactions on Automatic Control, 1995
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Euclidean distance mappingComputer Graphics and Image Processing, 1980
- A note on two problems in connexion with graphsNumerische Mathematik, 1959