Color Image Super-Resolution Reconstruction Based on Sparse Representation

Article Preview

Abstract:

This paper proposes a YUV color image super-resolution reconstruction algorithm based on sparse representation. The R, G, B components of color image are highly correlated, three-channel super-resolution independent reconstruction will lead to color distortion, so in this paper the color image is firstly converted to the Y, U, V three channels, and then super-resolution reconstruction. For choosing the regularization parameter, this paper proposes an adaptive regularization parameter method; it has a good inhibitory effect on image noise and adaptive super-resolution reconstruction of color images. The results of experiment show that the proposed algorithm has a better PSNR, compared with bicubic interpolation method and sparse representation. The adaptive super-resolution reconstruction can further improve the quality of the reconstructed image and the method is robust to image noise.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1221-1227

Citation:

Online since:

January 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S. Park, M. Park, and M. G. Kang. Super resolution image construction: a technical review, IEEE Signal Processing Magazine, vol. 20, no. 3, p.21–36, May (2003).

DOI: 10.1109/msp.2003.1203207

Google Scholar

[2] BAKER S, KANADE T. Hallucinating faces[C]. Fourth International Conference on Automatic Face and Gesture Recognition. Grenoble, France: IEEE Press , 2000 : 83-89.

DOI: 10.1109/afgr.2000.840616

Google Scholar

[3] Li Xin, Orchard Michael T. New edge-directed interpolation [J]. IEEE Transactions on I mage Processing, 2001, 10 (10): 1521-1527.

DOI: 10.1109/83.951537

Google Scholar

[4] J. Yang, J. Wright, T. Huang, and Y. Ma, Image super-resolution as sparse representation of raw image patches, In Intl. Conf. on Comp. Vis. and Patt. Recog., (2008).

DOI: 10.1109/cvpr.2008.4587647

Google Scholar

[5] H. Lee, A. Battle, R. Raina, and A. Ng, Efficient sparse coding algorithms, In NIPS, (2007).

Google Scholar

[6] D.L. Donoho, For most large underdetermined systems of linear equations, the minimal -norm solution is also the sparsest solution, Comm. on Pure and Applied Math, Vol. 59, No. 6, (2006).

DOI: 10.1002/cpa.20132

Google Scholar