Greedy Algorithm for Local Contrast Enhancement of Images

  • Kartic Subr
  • Aditi Majumder
  • Sandy Irani
Conference paper

DOI: 10.1007/11553595_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3617)
Cite this paper as:
Subr K., Majumder A., Irani S. (2005) Greedy Algorithm for Local Contrast Enhancement of Images. In: Roli F., Vitulano S. (eds) Image Analysis and Processing – ICIAP 2005. ICIAP 2005. Lecture Notes in Computer Science, vol 3617. Springer, Berlin, Heidelberg

Abstract

We present a technique that achieves local contrast enhancement by representing it as an optimization problem. For this, we first introduce a scalar objective function that estimates the average local contrast of the image; to achieve the contrast enhancement, we seek to maximize this objective function subject to strict constraints on the local gradients and the color range of the image. The former constraint controls the amount of contrast enhancement achieved while the latter prevents over or under saturation of the colors as a result of the enhancement. We propose a greedy iterative algorithm, controlled by a single parameter, to solve this optimization problem. Thus, our contrast enhancement is achieved without explicitly segmenting the image either in the spatial (multi-scale) or frequency (multi-resolution) domain. We demonstrate our method on both gray and color images and compare it with other existing global and local contrast enhancement techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kartic Subr
    • 1
  • Aditi Majumder
    • 1
  • Sandy Irani
    • 1
  1. 1.School of Information and Computer ScienceUniversity of CaliforniaIrvine

Personalised recommendations