Effective two-step method for face hallucination based on sparse compensation on over-complete patches

Sparse representation has been successfully applied to image d using low- and high-resolution training face images based on sparse representation. In this study, the sparse residual compensation is adopted to face hallucination. Firstly, a global face image is constructed by optimal coefficients of the interpolated training images. Secondly, the high-resolution residual image (local face image) is found by using an over-complete patch dictionary and the sparse representation. Finally, a hallucinated face image is obtained by combining these two steps. In addition, the more details of the face image in high frequency parts are recovered using a residual compensation strategy. In the authors’ experimental work, it is observed that balance sparsity parameter (λ) has affected the residual compensation. Further, the proposed algorithm can acquire a high-resolution image even though the number of training image pairs is comparatively smaller. The experiments show that the authors’ method is more effective than the other existing two-step face hallucination methods.

[1]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[2]  E. Candès,et al.  The curvelet representation of wave propagators is optimally sparse , 2004, math/0407210.

[3]  D. Yeung,et al.  Super-resolution through neighbor embedding , 2004, CVPR 2004.

[4]  Terrence J. Sejnowski,et al.  Learning Overcomplete Representations , 2000, Neural Computation.

[5]  David J. Field,et al.  Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.

[6]  Yu Hu,et al.  A novel kernel-based framework for facial-image hallucination , 2011, Image Vis. Comput..

[7]  David J. Field,et al.  Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.

[8]  Dahua Lin,et al.  Neighbor combination and transformation for hallucinating faces , 2005, 2005 IEEE International Conference on Multimedia and Expo.

[9]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[10]  P. Tseng,et al.  Block Coordinate Relaxation Methods for Nonparametric Wavelet Denoising , 2000 .

[11]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[12]  Michael Elad,et al.  Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation , 2010, IEEE Transactions on Signal Processing.

[13]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[14]  Thomas S. Huang,et al.  Image super-resolution as sparse representation of raw image patches , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[15]  Yueting Zhuang,et al.  Hallucinating faces: LPH super-resolution and neighbor reconstruction for residue compensation , 2007, Pattern Recognit..

[16]  Joseph F. Murray,et al.  Dictionary Learning Algorithms for Sparse Representation , 2003, Neural Computation.

[17]  Lawrence Sirovich,et al.  The global dimensionality of face space , 2000, Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580).

[18]  E. Candès,et al.  Near-ideal model selection by ℓ1 minimization , 2008, 0801.0345.

[19]  Mohamed-Jalal Fadili,et al.  Inpainting and Zooming Using Sparse Representations , 2009, Comput. J..

[20]  Francisco de Borja Rodríguez Ortiz,et al.  A two-step neural-network based algorithm for fast image super-resolution , 2007, Image Vis. Comput..

[21]  Stephen J. Wright,et al.  Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.

[22]  Michael Elad,et al.  Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries , 2006, IEEE Transactions on Image Processing.

[23]  Subhasis Chaudhuri,et al.  Super-resolution imaging: use of zoom as a cue , 2004, Image Vis. Comput..

[24]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

[25]  Allen Y. Yang,et al.  Distributed recognition of human actions using wearable motion sensor networks , 2009, J. Ambient Intell. Smart Environ..

[26]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[27]  Volkan Cevher,et al.  Compressive Sensing for Background Subtraction , 2008, ECCV.

[28]  Takeo Kanade,et al.  Hallucinating faces , 2000, Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580).

[29]  Mike E. Davies,et al.  Gradient Pursuits , 2008, IEEE Transactions on Signal Processing.

[30]  Chun Qi,et al.  Hallucinating face by position-patch , 2010, Pattern Recognit..

[31]  Harry Shum,et al.  A two-step approach to hallucinating faces: global parametric model and local nonparametric model , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[32]  Xiaogang Wang,et al.  Hallucinating face by eigentransformation , 2005, IEEE Trans. Syst. Man Cybern. Part C.

[33]  M. Savvides,et al.  Robust Super-Resolution of Face Images by Iterative Compensating Neighborhood Relationships , 2007, 2007 Biometrics Symposium.