An Efficient Color Image Encoding Scheme Based on Colorization

An Efficient Color Image Encoding Scheme Based on Colorization

Noura A. Semary (Menofia University, Egypt & Scientific Research Group in Egypt (SRGE), Egypt)
DOI: 10.4018/978-1-4666-6030-4.ch012
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Image colorization is a new image processing topic to recolor gray images to look as like the original color images as possible. Different methods have appeared in the literature to solve this problem, the way that leads to thinking about decolorization, eliminating the colors of color images to just small color keys, aid in the colorization process. Due to this idea, decolorization is considered as a color image encoding mechanism. In this chapter, the authors propose a new decolorization system depends on extracting the color seeds (Representative Pixels [RP]) using morphology operations. Different decolorization methods are studied and compared to the system results using different quality metrics.
Chapter Preview
Top

Introduction

Image colorization is the process of adding colors to black and white images. One of the problems of colorization is how to select the suitable colors, mainly the original colors, to generate a colored image similar to the original color one. Different colorization methods treats this problem in the literature, most of these trials are covered and discussed in our previous publications (Semary, 2011), (Semary, 2012). One of the common colorization methods is A. Levin et al. technique (Levin, Lischinski, & Weiss, 2004) where the user draws some scribbles on a gray image using a color palette and a brush like tool, then the computer colorizes the image using optimization depending on the fact, the nearby pixels in gray should have the same color.

Levin's method depends on user selection of positions and colors of the scribbles. So it's an important aspect in his method to practice well; where to draw the scribbles and what is the suitable color to be selected for obtaining a color image as the original one. Because of these drawbacks, many researchers like Yao Li et al. (Li, Lizhuang, & Di, 2007) and Liron. Yatziv et al. (Yatziv & Sapiro, 2006) and more appeared in the literature; improve Levin's algorithm quality; speed and the needed number and positions of the scribbles.

Decolorization is a new research field appeared after the fast development in image and video Colorization area. Decolorization means to convert the color image to grayscale by eliminating the colors in the image but keeping some clues refer to the original colors to be used in the Recolorization process; to obtain a recolored image looks like the original one.

From our point of view and literature study, there are two trends for decolorization (Semary, 2011):

Color Embedding: Where the chromatic channels are processed to be hidden or embedded in the gray image. The inverse of the hiding process is performed to extract the color channels back and merge them with the gray (lightness) channel to obtain the color image again, but in lower quality than the original one. This field leads to thinking about encoding color images using decolorization. Ricardo et al. (de Queiroz & Braun, 2006), (de Queiroz, 2010) used wavelet sub-bands to hide chromatic channels. The resulted gray image was a textured one differs a lot from the original gray image but they proposed their method for faxing applications that enables sending the color image by the traditional fax and recolorize them back after receiving. Takahiko Horiuchi et al. (Horiuchi, Nohara, & Tominaga, 2010) used a second-level Haar wavelet transform with a packet assignment technique. The proposed algorithm distributed color information effectively in one-level wavelet subbands for preserving the chroma and spatial resolution. The application permitted color recovery only to a specific user with a key.

Chaumont and Puech (2009) proposed a method to embed the color information of an image in a corresponding grey-level image. This method was made of three major steps which were a fast color quantization, an optimized ordering and an adapted data hiding. The principle was to build an index image which is, in the same time, a semantically intelligible grey-level image. In order to obtain this particular index image, which should be robust to data hiding, a layer running algorithm was proceeded to sort the K colors of the palette.

The algorithm searches for the best scribbles or seeds can be extracted and sent with the gray image to be used in the colorization process. This trend is suitable for user selection colorization techniques, where the decolorization process usually made automatically without user scribbles selection (Vieira, et al., 2003). Next section explains most well-known works in this trend.

Top

One on the simplest methods for color seeds extraction is Brooks’ et al. method (Brooks et al., 2007), where the representative pixels (seeds) were selected using sampling (Figure 1).

Figure 1.

Brooks’ system results (Brooks et al., 2007), (left) Color seeds, (right) The colorization result

Complete Chapter List

Search this Book:
Reset