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.

The integral image representation is a remarkable idea that permits to evaluate the sum of image values over rectangular regions of the image with four operations, regardless of the size of the region. It was first proposed under the name of summed area table in the computer graphics community by Crow'84, in order to efficiently filter texture maps. It was later popularized in the computer vision community by Viola & Jones'04 with its use in their real-time object detection framework. In this article we describe the integral image algorithm and study its application in the context of block matching. We investigate tradeoffs and the limits of the performance gain with respect to exhaustive block matching.

In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. Unfortunately, the Retinex Land-McCann original algorithm is both complex and not fully specified. Indeed, this algorithm computes at each pixel an average of a very large set of paths on the image. For this reason, Retinex has received several interpretations and implementations which, among other aims, attempt to tune down its excessive complexity. But, Morel et al. have shown that the original Retinex algorithm can be formalized as a (discrete) partial differential equation. This article describes the PDE-Retinex, a fast implementation of the Land-McCann original theory using only two DFT's. Source CodeThe source code, the code documentation, and the online demo are accessible at the IPOL web part of this article 1 . In this link an implementation is available for download. Compilation and usage instruction are included in the README.txt file of the compressed archive.Keywords: PDE; Retinex; color OverviewIn 1964 Edwin H. Land [1] formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "reset Retinex" [2] were further formalized by Land and McCann in 1971. Several Retinex algorithms have been developed ever since. These color constancy algorithms modify the RGB values at each pixel to give an estimate of the physical color independent of the shading.The Retinex original method was complex and imprecise. Indeed, this algorithm computes at each pixel an average of a very large and unspecified set of paths on the image. For this reason, Retinex has received several interpretations and implementations which, among other aims, attempt to tune down its excessive complexity.

After four years of development of the Image Processing On Line journal (IPOL), this article presents a first analysis and overview of its scientific and technical development. The main issues met and overcome from the beginning of the journal are described with a focus on the purpose of the journal to establish a state of the art on the main Image Processing topics. The evolution of the online demonstration is also presented with a first analysis of author/publisher criticism, which led to a proposal for a new modular architecture of its demo system.

No abstract