Scientific Research

An Academic Publisher

Color Image Reconstruction by Discrete Orthogonal Moment

**Author(s)**Leave a comment

1. Introduction

Nowadays, all digital cameras acquire chromatic images, which are capable of recording complex details. The conventional approach to color image analysis consists of processing the red, green and blue channels separately using digital image processing techniques, and combines the individual output results [1] . Currently, RGB images are analyzed with orthogonal quaternion moments, which have the advantage of using the quaternion theory to handle color image is that the existing correlation between color components can be taken into consideration [2] . B. Chen et al. proposed the quaternion moments for color images analysis [3] . The authors use the Zernike polynomials as the kernel of the quaternion moments defined in a unit circle. However, the computation of quaternion moments requires a transformation to polar coordinates and an approximation of the integral [4] . The discrete orthogonal moments do not involve any numerical approximation, since the base set is orthogonal in the discrete domain of the image co-ordinate space, the basic functions satisfy exactly the orthogonality property, and thus yield a superior image reconstruction [5] . The classical discrete orthogonal moments such as Tchebichef [5] , Krawtchouk [6] , Hahn [7] , Meixner [8] , Charlier [9] and Racah [10] [11] moments are defined in the coordinate space of the image and preserve the orthogonality condition [7] . Has recently been analyzed color images with images reconstruction from the different channels by orthogonal moments such as Charlier [9] and Racah [10] moments.

In this article we present an analysis based on a reconstruction error of color images using different orders of moments, which allows knowing the capacity of reconstruction with different set of classical orthogonal moments is analyzed, also the recovery error graphs that were obtained are presented.

2. Discrete Orthogonal Moments

The discrete orthogonal moments have the ability to represent global features and describe its most important characteristics, which have a kernel base of discrete orthogonal polynomials [6] .

The orthogonal moments are defined as follows:

${\phi}_{m,n}=\underset{x=1}{\overset{m}{{\displaystyle \sum}}}\underset{y=1}{\overset{n}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}f\left(x,y\right){P}_{n}\left(x\right){P}_{m}\left(y\right)$ (1)

where ${P}_{n}\left(x\right)$ and ${P}_{m}\left(x\right)$ are a set of discrete orthogonal $f\left(x,y\right)$ is an image function and m, n are the image size.

Considering that a color image is formed by RGB channels they can be defined as,

$\begin{array}{l}f\left(x,y,1\right)={f}_{R}\left(x,y\right),\\ f\left(x,y,2\right)={f}_{G}\left(x,y\right),\\ f\left(x,y,3\right)={f}_{B}\left(x,y\right),\end{array}$ (2)

The calculation of the orthogonal moments is defined as

${\phi}_{n,m}^{c}=\underset{x=1}{\overset{m}{{\displaystyle \sum}}}\underset{y=1}{\overset{n}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}f\left(x,y,c\right){P}_{n}\left(x\right){P}_{m}\left(y\right)$ (3)

where ${P}_{n}\left(x\right)$ y ${P}_{m}\left(y\right)$ are polynomial basic functions, $f\left(x,y,c\right)$ is a color image, and c represents the RGB channel of the image.

Discrete Orthogonal Polynomials

A general way to obtain normalized discrete orthogonal polynomials ${\stackrel{\u02dc}{p}}_{n}\left(x\right)$ is by the following recurrence relation (H. Zhu et al. [12] ).

$A{\stackrel{\u02dc}{p}}_{n}\left(x\right)=B\ast D{\stackrel{\u02dc}{p}}_{n-1}\left(x\right)+C\ast E{\stackrel{\u02dc}{p}}_{n-2}\left(x\right)$ (4)

where A, B, C, D, E are terms independent of each of the polynomial sets shown in “Table 1” and “Table 2” and ${\stackrel{\u02dc}{p}}_{n-1}\left(x\right),{\stackrel{\u02dc}{p}}_{n-2}\left(x\right)$ are the initial values in “Table 3” and “Table 4”.

Table 1. Values of the terms A, B, C, D and E of the following polynomial with size N: Tchebichef ${\stackrel{\u02dc}{t}}_{n}\left(x;N\right)$ , Krawtchouk ${\stackrel{\u02dc}{k}}_{n}\left(x;p,N\right)$ y Charlier ${\stackrel{\u02dc}{c}}_{n}^{{a}_{1}}\left(x\right)$ .

Table 2. Values of the terms A, B, C, D and E of the following polynomial with size N: Hahn ${\stackrel{\u02dc}{h}}_{n}^{a,b}\left(x;N\right)$ , Meixner ${\stackrel{\u02dc}{m}}_{n}^{\beta ,\mu}\left(x\right)$ .

A special case of the discrete orthogonal polynomials are the Racah polynomials, which are calculated by the following relation of recurrence with respect to n [10] [11] .

${A}_{n}{U}_{n}^{\alpha ,\beta}\left(s,a,b\right)={B}_{n}\frac{{d}_{n}}{{d}_{n-1}}{U}_{n-1}^{\alpha ,\beta}\left(s,a,b\right){C}_{n}\frac{{d}_{n}}{{d}_{n-2}}{U}_{n-2}^{\alpha ,\beta}\left(s,a,b\right)$ (5)

where ${A}_{n},{B}_{n},{C}_{n}$ are terms independent of Racah polynomials and ${U}_{n-1}^{\alpha ,\beta}\left(s,a,b\right)$ ,

Table 3. Zero and first order polynomials of the following functions: Tchebichef ${\stackrel{\u02dc}{t}}_{n}\left(x;N\right)$ , Krawtchouk ${\stackrel{\u02dc}{k}}_{n}\left(x;p,N\right)$ y Charlier ${\stackrel{\u02dc}{c}}_{n}^{{a}_{1}}\left(x\right)$ .

Table 4. Zero and first order polynomials of the following functions: Hahn ${\stackrel{\u02dc}{h}}_{n}^{a,b}\left(x;N\right)$ , Meixner ${\stackrel{\u02dc}{m}}_{n}^{\beta ,\mu}\left(x\right)$ y Racah.

${U}_{n-2}^{\alpha ,\beta}\left(s,a,b\right)$ are the initial values of Zero and first order polynomials shown in “Table 5”.

Below, the graphs obtained from the calculation of the first 5 polynomials of the six families of discrete orthogonal moments are shown in Figure 1.

3. RGB Color Images Reconstruction

One of the different applications of the moments’ functions with orthogonal base is the reconstruction of color images $f\left(x,y,c\right)$ , which allows to determine the number of descriptors that can characterize the color image.

It is possible to reconstruct an image from its moments using the respective inverse transformation. The reconstruction of an image $f\left(x,y\right)$ is given by [4] :

$\stackrel{\u02dc}{f}\left(x,y\right)=\underset{x=1}{\overset{m}{{\displaystyle \sum}}}\underset{y=1}{\overset{n}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{\phi}_{m,n}{P}_{n}\left(x\right){P}_{m}\left(y\right),$ (6)

where ${P}_{n}\left(x\right)$ and ${P}_{m}\left(x\right)$ are polynomial basis functions and ${\phi}_{m,n}$ are the moments of the image to be reconstructed.

The reconstruction of a color image $f\left(x,y,c\right)$ is given by:

${\stackrel{\u02dc}{f}}_{c}\left(x,y\right)=\underset{x=1}{\overset{m}{{\displaystyle \sum}}}\underset{y=1}{\overset{n}{{\displaystyle \sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{\phi}_{n,m}^{c}{P}_{n}\left(x\right){P}_{m}\left(y\right),$ (7)

where ${P}_{n}\left(x\right)$ y ${P}_{m}\left(y\right)$ are polynomial basis functions and ${\phi}_{n,m}^{c}$ are the moments of the image to be reconstructed in its three RGB channels.

Table 5. Values to obtain the Racah polynomials ${\stackrel{\u02dc}{u}}_{n}^{\alpha ,\beta}\left(s,a,b\right)$ .

RGB Image Reconstruction Error

To evaluate the efficiency of the moments, the reconstruction metric based on the normalized image reconstruction error (NIRE) is used, which is defined as the normalized square error between the input image ${f}_{c}\left(x,y\right)$ and the reconstructed image ${\stackrel{\u02dc}{f}}_{c}\left(x,y,c\right)$ , expressed by [4] :

${\text{NIRE}}_{c}=\frac{{{\displaystyle \sum}}_{y=1}^{N}{{\displaystyle \sum}}_{x=1}^{M}{\left[{f}_{c}\left(x,y\right)-{\stackrel{\u02dc}{f}}_{c}\left(x,y\right)\right]}^{2}}{{{\displaystyle \sum}}_{y=1}^{N}{{\displaystyle \sum}}_{x=1}^{M}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{f}_{c}^{2}\left(x,y\right)}$ (8)

Therefore, the measurement for the reconstruction error of a color image that takes into account the three channels is given by:

$\text{MeanNIRE}=\frac{{\text{NIRE}}_{R}+{\text{NIRE}}_{G}+{\text{NIRE}}_{B}}{3}$ (9)

4. Experimental Results

Next are the results obtained with the proposed algorithm for video encryption and recovery of the following three grayscale test images with dimensions of 512 ×

Figure 1. The first ten polynomials n = 0, 1, ・・・, 4. (a) Tchebichef polynomials, (b) Krawtchouk polynomials, (c) Charlier polynomials, (d) Hahn polynimials, (e) Meixner polynomials and (f) Racah polynomials.

512 pixels presented in Figure 2.

We have reconstructed these test images shown in Figure 2 with the moments of the different families of classical polynomials with different orders of reconstruction. The results obtained with the reconstruction are shown in “Tables 6-8”.

Figure 2. Grayscale image of 512 × 512 used as images for video encryption (a) “lena.jpg”, (b) “mandril.jpg” and (c) “plumas.jpg”.

Table 6. Comparison of some pictures of the reconstruction orders of image 1, “lena” with each one of the moments sets mentioned.

Table 7. Comparison of some pictures of the reconstruction orders of image 2, “Mandril” with each one of the moments sets mentioned.

The NIRE graphics of the reconstruction comparison of the three images with the moments sets are shown in Figure 3.

5. Conclusions

According to the value distributions of each set of orthogonal polynomials as shown in Figure 1, it can be observed that the distribution of some polynomials as Tchebichef and Hahn are more uniform in comparison to Krawtchouk, Meixner, Charlier and Racah polynomials. Therefore, better results would be

Table 8. Comparison of some pictures of the reconstruction orders of image 3, “Plumas” with each one of the moments sets mentioned.

expected with these polynomials.

Rectangular moments were used for the reconstruction of an image, with which it was possible to examine the performance of the different moments used for the representation of the information, as well as its convergence through the number of moments necessary for the reconstruction of the images.

As can be seen in the results obtained shown in Tables 6-8. The Tchebichef, Hahn and Racah polynomials present a better capacity of description, since they allow to recover the image with a smaller number of reconstruction orders. In

Figure 3. Graphics of the reconstruction comparison of error for images (a) “lena.jpg”, (b) “mandril.jpg” and (c) “plumas.jpg”.

this case with more than 50 orders it can recover almost the entire image.

Acknowledgements

J. S. Rivera-López thanks CONACyT for the scholarship with number 423649.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

*Journal of Data Analysis and Information Processing*,

**5**, 156-166. doi: 10.4236/jdaip.2017.54012.

[1] |
Suk, T. and Flusser, J. (2009) Affine Moment Invariants of Color Images. In: Proceedings of CAIP 2009, LNCS5702, 334-341. https://doi.org/10.1007/978-3-642-03767-2_41 |

[2] |
Chen, B.J., Shu, H.Z., Zhang, H., Chen, G., Toumoulin, C., Dillenseger, J.L. and Luo, L.M. (2012) Quaternion Zernike Moments and Their Invariants for Color Image Analysis and Object Recognition. In Signal Processing, 92, 308-318. https://doi.org/10.1016/j.sigpro.2011.07.018 |

[3] |
Chen, B., Shu, H., Zhang, H., Chen, G. and Luo, L. (2010) Color Image Analysis by Quaternion Zernike Moments. 2010 20th International Conference on Pattern Recognition, Istanbul, 23-26 Aug. 2010, 625-628. https://doi.org/10.1109/ICPR.2010.158 |

[4] |
Camacho-Bello, C., Padilla-Vivanco, A., Toxqui-Quitl, C. and Báez-Rojas, J.J. (2016) Reconstruction of Color Biomedical Images by Means of Quaternion Generic Jacobi-Fourier Moments in the Framework of Polar Pixels. Journal of Medical Imaging, 3, 014004-014004. https://doi.org/10.1117/1.JMI.3.1.014004 |

[5] |
Mukundan, R., Ong, S.H. and Lee, P.A. (2001) Image Analysis by Tchebichef Moments. IEEE Transactions on image Processing, 10, 1357-1364. https://doi.org/10.1109/83.941859 |

[6] |
Yap, P.T., Paramesran, R. and Ong, S.H. (2003) Image Analysis by Krawtchouk Moments. IEEE Transactions on Image Processing, 12, 1367-1377. https://doi.org/10.1109/TIP.2003.818019 |

[7] |
Zhou, J., Shu, H., Zhu, H., Toumoulin, C. and Luo, L. (2005) Image Analysis by Discrete Orthogonal Hahn Moments. Image Analysis and Recognition, 3656, 524-531. https://doi.org/10.1007/11559573_65 |

[8] |
Sayyouri, M., Hmimid, A. and Qjidaa, H. (2015) A Fast Computation of Novel Set of Meixner Invariant Moments for Image Analysis. Circuits, Systems, and Signal Processing, 34, 875-900. https://doi.org/10.1007/s00034-014-9881-7 |

[9] | Zhang, X. and Liao, S. (2015) Color Image Reconstruction from Charlier Moments. Journal of Theoretical and Applied Computer Science, 9, 3-13. |

[10] | Wu, Y. and Liao, S. (2015) Color Image Analysis via Racah Moments. Journal of Theoretical and Applied Computer Science, 9, 8-18. |

[11] |
Wu, Y. and Liao, S. (2014) Chinese Characters Recognition via Racah Moments. In Audio, Language and Image Processing (ICALIP), 2014 International Conference on, IEEE, 7-9 July 2014, 691-694. https://doi.org/10.1109/ICALIP.2014.7009883 |

[12] |
Zhu, H., Liu, M., Shu, H., Zhang, H. and Luo, L. (2010) General Form for Obtaining Discrete Orthogonal Moments. IET Image Processing, 4, 335-352. https://doi.org/10.1049/iet-ipr.2009.0195 |

Copyright © 2019 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.