Color normalization
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Color normalization is a topic in computer vision concerned with artificial color vision and object recognition. In general, the distribution of color values in an image depends on the illumination, which may vary depending on lighting conditions, cameras, and other factors. Color normalization allows for object recognition techniques based on color to compensate for these variations.
Color normalization is a topic in computer vision concerned with artificial color vision and object recognition. In general, the distribution of color values in an image depends on the illumination, which may vary depending on lighting conditions, cameras, and other factors. Color normalization allows for object recognition techniques based on color to compensate for these variations. y = f(x) = \int\limits_{0}^{x} p_x (u) du Then assume wanted image z.
The equalization transform of this image is: y' = g(z) = \int\limits_{0}^{z} p_z (u) du Of course p_z (u) is the histogram of the output image.
The formula to find the inverse of the above transform is: z = g^{-1} (y') Therefore, since images y and y' have the same equalized histogram they are actually the same image, meaning y = y' and the transform from the given image x to the wanted image z is: z = g^{-1} (y') = g^{-1} (y) = g^{-1} (f(x)) Histogram specification has the advantage of producing more realistic looking images, as it does not exaggerate the blue channel like histogram equalization. f^{(t)} = [f_{ij}^{(t)}]_{i = 1...N, j = 1...M} which consists of color vectors f_{ij}^{(t)} = (r_{ij}^{(t)}, g_{ij}^{(t)}, b_{ij}^{(t)})^T .
How it works
For the first step explained above, compute: S_{ij} := r_{ij}^{(t)} + g_{ij}^{(t)} + b_{ij}^{(t)} which leads to r_{ij}^{(t+1)} = \frac{r_{ij}^{(t)}}{S_{ij}}, g_{ij}^{(t+1)} = \frac{g_{ij}^{(t)}}{S_{ij}} and b_{ij}^{(t+1)} = \frac{b_{ij}^{(t)}}{S_{ij}}. For the second step explained above, compute: r' = \frac{3}{NM} \sum_{i=1}^N \sum_{j=1}^M r_{ij}^{(t+1)} and normalize r_{ij}^{(t+2)} = \frac{r_{ij}^{(t+1)}}{r'}. Of course the same process is done for b' and g'.
Then these two steps are repeated until the changes between iteration t and t+2 are less than some set threshold. Comprehensive color normalization, just like the histogram equalization method previously mentioned, produces results that may look less natural due to the reduction in the number of color values.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1359133641 under CC BY-SA 4.0; modifications have been made.