Journal of Multimedia Information System
Korea Multimedia Society
Section C

Spatial Contrast Enhancement using Local Statistics based on Genetic Algorithm

MoonWon Choo1
1Department of Media Software, Sungkyul University, Anyang-City, Republic of Korea, mchoo@sungkyul.edu
*Corresponding Author: MoonWon Choo, 53 Sungkyul University-ro, Manan-gu, Anyang-si, Sungkyul University, Republic of Korea, +82-10-5068-8178, mchoo@sungkyul.edu.

© Copyright 2017 Korea Multimedia Society. This is an Open-Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/4.0/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Received: Jun 27, 2017 ; Revised: Jun 28, 2017 ; Accepted: Jun 29, 2017

Published Online: Jun 30, 2017

Abstract

This paper investigates simple gray level image enhancement technique based on Genetic Algorithms and Local Statistics. The task of GA is to adapt the parameters of local sliding masks over pixels, finding out the best parameters preserving the brightness and possibly preventing the creation of intensity artifacts in the local area of images. The algorithm is controlled by GA as to enhance the contrast and details in the images automatically according to an object fitness criterion. Results obtained in terms of subjective and objective evaluations, show the plausibility of the method suggested here.

Keywords: Contrast enhancement; Genetic algorithm; Image enhancement; Image local statistics

I. INTRODUCTION

Enhancing images with good contrast and details is an essential step to get the best results of image processing analysis such as object detection, recognition and registration [4]. Image enhancement is required for better visualization to help the visual perception, which could be enhanced by adjusting the brightness, changing the tone of color, sharpening the edges and reducing noise [1]. Contrast stretching, high-pass filtering, and histogram equalization and its derivatives are the popular methods in image enhancement.

He is the typical approach for achieving a uniform distribution histogram by using the cumulative density function of the input image. However, HE suffers from lacking of brightness preservation, since global histogram may be redistributed without considering local statistics such as local means and variances which feature details. To overcome these kinds of issues, diverse improvements have been done by involving block processing such as Adaptive HE(AHE), Brightness Preserving Bi-HE(BBHE), Minimum Mean Brightness Error Bi-HE(MMBEBHE) and other GA-based techniques [4][7][8][10][15]. In any case, most of the image enhancement techniques are empirical methods, dependent on the particular type of images [3]. Also these techniques require interactive procedures to obtain satisfactory results, and therefore are not suitable for routine application. To minimize the human intervention, some researches, including this work, have been counting on evolutionary algorithms [2][6][9][13][14].

The remainder of the paper is organized as follows: Section 2 reviews the local statistics method and introduces the Genetic Algorithm and chromosome representation, the objective enhancement criterion and fitness function, Section 3 gives the experimental results and Section 4 draws the conclusions of this paper.

II. PROPOSED ALGORHTHM

The proposed algorithm is based on Yousef’s local statistics approach [6]. The modification is the application of binary Genetic Algorithm to choose the best dimension of local masks. His algorithm is as follows:

  1. Take a mask of 3×3 and slide it over each pixel one by one, from left to right and top to bottom.

  2. Check any background pixel available in the mask and if available avoid that region for processing (the step is skipped in my work since there are no specific background pixels in input image).

  3. At each slide of mask, calculate the mean and standard deviation of the 3×3 region of input image.

  4. Compare the values of local mean and standard deviation and select the center pixel f (x, y) of mask for processing according to the following logic:

g ( x , y ) = { E f ( x , y ) i f   m l k 0   a n d     k 1 σ g σ l k 2 σ g f ( x , y ) o t h e r w i s e

where E, k0, k1, k2 are specified parameters, ml and mg are local and global means respectively, and σl, σg are local and global standard deviations respectively

In order to apply a semi-automatic image enhancement technique, which does not fully require human intervention, and no objective parameters given by the user, a criterion for enhancement method should be chosen. The fitness function of the GA is directly related to this criterion. It is generally agreed that a good contrast and enhanced image has a high number of edgels (edge pixels). In addition to that, an enhanced image has a high intensity of the edges compared to a non-enhanced variant of the same image [11]. The number and intensity of edgels are not enough to describe a valid fitness criterion for a more naturally enhanced image. The problem is that an image can have an extreme contrast with sharp transitions from white to black and vice versa, and a relatively small number of gray levels. In this case the image will have a relatively high number of edges and a very high intensity of edges. A criterion that is proportional to number and intensities of edgels might give an oversized credit to an image that doesn’t have a natural contrast. What is needed is a quantification of the number of gray-levels present in the image, or equivalently the histogram of the image should approach the uniform distribution, as in the case of histogram equalization techniques. Taken these issues into consideration, the followed equation is suggested [1].

F ( x ) = log ( log ( E ( I ( x ) ) ) ) n _ e d g e l s ( I ( x ) ) H _ s i z e × V _ s i z e H ( I ( x ) )

where F(x) denotes the fitness function applied to chromosome x, I(x) denotes the output image processed by local statistics algorithm. E(I(x)) is the intensity of the edges detected with Sobel edge detector, where the detector is applied to the transformed image I(x). n_edgels denotes the number of edgel pixels as detected with the Sobel edge detector. The term H(I(x)) is a measure of the entropy in the image I(x). H_size, V_size are the horizontal and vertical sizes (number of pixels in each direction) of the image. The Sobel detector used, is an automatic threshold detector [6].

III. EXPERIMENTATION

The GA employed has the following parameters: population size pop size=16, chromosome length nbits =16, binary tournament and K-elitism with K=4, generational type replacement, one-point crossover with selection = 0.5, mutation rate mutrate=0.15, iteration range maxit=50, k=[0.4 0.02 0.4], E=4. To demonstrate the objective performance of the proposed method, MSE and PSNR are used to compare the results. The Peak signal-to-noise ratio(PSNR)[2] is defined in decibels. Across contrast enhanced types, PSNR lacks the ability to assess image similarity. PSNR is defined as:

P S N R = 20log 10 ( max I M S E )

where maxI is the maximum value of the pixel in the image and MSE is the mean square error between the input image and the enhanced image. Hence the lesser the MSE and the bigger the PSNR, which means the better results.

jmis-4-2-89-g1
Fig. 1. (top) Courbet image, AHE output, proposed method’s outputs. (middle) Average costs and best costs per GA iteration. mutrate=0.15. #generations=50, best cost=-0.5426, best solution (7,7). (bottom) Evolution of the sizes (x-size and y-size) of local masks during 50 generations. Each pair of mask dimension gives the best cost per generation.
Download Original Figure
jmis-4-2-89-g2
Fig. 2. (top) Lena image, AHE output, proposed method’s outputs. (middle) Average costs and best costs per GA iteration. mutrate=0.15. #generations=50, best cost=-0.55045, best solution (6,7). (bottom) Evolution of the sizes (x-size and y-size) of local masks during 50 generations Each pair of mask dimension gives the best cost per generation.
Download Original Figure
jmis-4-2-89-g3
Fig. 3. (top) butterfly image, AHE output, proposed method’s outputs. (middle) Average costs and best costs per GA iteration. mutrate=0.15. #generations=50, best cost=-0.41687, best solution (6,6). (bottom) Evolution of the sizes (x-size and y-size) of local masks during 50 generations. Each pair of mask dimension gives the best cost per generation.
Download Original Figure
Table 1. Evaluation measures
Courbet Lena butterfly
MSE PSNR MSE PSNR MSE PSNR
AHE 57.81 70.33 31.15 76.52 96.51 65.21
Local 46.52 72.03 21.58 80.19 68.80 68.59
Download Excel Table

The resultant evaluation table shows that the proposed method works well compared with well-established AHE method. But the visual evaluations show that the specified parameters such as E, k0, k1, k2, may dominate the enhancement performances. Therefore, these parameters should be chosen carefully according to imaging conditions before applying GA.

V. CONCLUSION

This work show that the proposed method works successfully converge to optimal solution without human intervention. However, this preliminary experiment is not complete enough to apply in general image processing settings. The GA-generated test image sets are limited in terms of canonical examples and proper comparison approaches are missing or too simplified. Moreover, the processing time is impractically long. Further intensive research is required. In any case, the fitness of each image, taken as an individual in the population, turns out to be subjective scores given by human interpreter, but the objective fitness functions should be explored to set up for automatic GA-based processes.

REFERENCES

[1].

C. Munteanu, “Towards automatic image enhancement using genetic algorithms,” Evolutionary Computation, 2000. Proceedings of the 2000 Congress on, Vol. 2., 2000.

[2].

Chahat, Mahendra Kumar Patil, "Image Enhancement Using Histogram Equalization Based On Genetic Algorithm,” Int’l J. of Engineering Research & Technology, vol.7, Issues 8, pp. 12-17, June 2013.

[3].

D. J. Ketcham, R. Lowe, and W. Weber, “Real-time enhancement techniques,” Proc. SPIE, Vol. 0074, 1976,

[4].

D. Y. Lee, J. H. Kim, ”An Image Contrast Enhancement Method based on Pyramid Fusion Using BBWE and MHMD,” J. of Korea Multimedia Society, Vol. 16, No. 11, November 2013

[5].

M. S. Gaurav, S. K. Mahipal, and D. Manoj, ”A Review of Image Enhancement Techniques in Image Precessing,” HCTL, Open IJTIR, Vol. 5, Sept. 2013

[6].

M. A. Yousuf and M. R. H.Rakib, ”An Effective Image Contrast Enhancement Method Using Global Histogram Equalization,” Journal of Scientific Research, Vol. 3, No. 1, pp.43-50, 2001

[7].

M. Mitchell, ”An Introduction to Genetic Algorithms ,” Cambridge: MIT Press,1996

[8].

N. M. Sasi and V. K. Jayasree, “Contrast Limited Adaptive Histogram Equalization for Qualitative Enhancement of Myocardial Perfusion Images,” Engineering, Vol. 5, No.10B, pp. 326-331, 2013.

[9].

P. Gupta, ”Contrast Enhancement for Retinal Images using Multi-objective Genetic Algortihm, Int’l J. of Emerging Trends in Engineering and Development, Vol. 1, No. 6, pp.7-10, January 2016

[10].

R. Hummel, “Image enhancement by histogram transformation,” Comput. Graph. Image Processing, vol. 6, pp. 184-195, 1977.

[11].

R. C. Gonzalez, R. E. Woods, and S. L. Eddins, “Digital Image Processing,” 2nd Edition, Pearson Education, New Jersey, 2002.

[12].

P. L. Rosin, “Edges: saliency measures and automatic thresholding”, Machine Vision and Applications, Vol. 9, pp.139 – 159, 1997.

[13].

F. Saitoh, “Image Contrast Enhancement Using Genetic Algorithm”, Proceedings of IEEE SMC’99, Tokyo, Japan, pp. 899-904

[14].

S. Shivangini and U. Arvind, ”Image Enhancement Using Genetic Algorithm,” Int’l J. of Engineering Research & Technology, Vol.3, Issues 5, May 2014

[15].

J. B. Zimmerman, S. M. Pizer, E. V. Staa, J. R. Perry, W. McCartney and B. C. Brenton, “An Evaluation of the Effectiveness of Adaptive Histogram Equalization for Contrast Enhancement,” IEEE Transactions of Medical Imaging, Vol. 7, No. 4, pp. 304-312, 1988.