IPOL Journal · Image Processing On Line
- published
- 2011-10-24
- reference
- Nicolas Limare, Jose-Luis Lisani, Jean-Michel Morel, Ana Belén Petro, and Catalina Sbert, Simplest Color Balance, Image Processing On Line, 1 (2011), pp. 297–315. https://doi.org/10.5201/ipol.2011.llmps-scb
Communicated by Yann Gousseau
Demo edited by Jose-Luis Lisani
Abstract
In this paper we present the simplest possible color balance algorithm. The assumption underlying this algorithm is that the highest values of R, G, B observed in the image must correspond to white, and the lowest values to obscurity. The algorithm simply stretches, as much as it can, the values of the three channels Red, Green, Blue (R, G, B), so that they occupy the maximal possible range [0, 255] by applying an affine transform ax+b to each channel. Since many images contain a few aberrant pixels that already occupy the 0 and 255 values, the proposed method saturates a small percentage of the pixels with the highest values to 255 and a small percentage of the pixels with the lowest values to 0, before applying the affine transform.
Download
- full text manuscript: PDF low-res. (867K) PDF (13.7M) [?]
- source code: TAR/GZ
Supplementary Materials
- The source code is provided and distributed under the GPL license. Source code documentation: online, tar/gz
History
- this article was converted to PDF on 2016-09-05.
- the original version was published on 2011-09-27: manuscript, html version
- Note from the editor: the manuscript of the article was modified on 2022-01-01 to include information about its editors. The original version of the manuscript is available here.
