Image colorization based on the mixed l<inf>0</inf>/l<inf>1</inf> norm minimization

Kazunori Uruma, Katsumi Konishi, Tomohiro Takahashi, Toshihiro Furukawa

2012 · 11 citations · 7 references

Concepts

Abstract

This paper proposes a new image colorization algorithm based on the mixed L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> /L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> norm minimization. Introducing some assumptions, a problem of recovering a color image from a grayscale image with the small number of known color pixels is formulated as a mixed L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> /L <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> norm minimization, which is solved approximately by an iterative reweighted least squares (IRLS) algorithm. Numerical examples show that the proposed algorithm colorizes a grayscale image well using a small number of color pixels.

References

7