Chapter

Image Analysis and Processing – ICIAP 2005

Volume 3617 of the series Lecture Notes in Computer Science pp 171-179

Greedy Algorithm for Local Contrast Enhancement of Images

  • Kartic SubrAffiliated withSchool of Information and Computer Science, University of California
  • , Aditi MajumderAffiliated withSchool of Information and Computer Science, University of California
  • , Sandy IraniAffiliated withSchool of Information and Computer Science, University of California

* Final gross prices may vary according to local VAT.

Get Access

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.