Transformation-Invariant Collaborative Sub-representation

In this paper, we present an efficient and robust image representation method that can handle misalignment, occlusion and big noises with lower computational cost. It is motivated by the sub-selection technique, which uses partial observations to efficiently approximate the original high dimensional problems. While it is very efficient, their method can not handle many real problems in practical applications, such as misalignment, occlusion and big noises. To this end, we propose a robust sub-representation method, which can effectively handle these problems with an efficient scheme. While its performance guarantee was theoretically proved, numerous experiments on practical applications have further demonstrated that the proposed method can lead to significant performance improvement in terms of speed and accuracy.

[1]  Junzhou Huang,et al.  Learning with dynamic group sparsity , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[2]  David Zhang,et al.  Relaxed collaborative representation for pattern classification , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Junzhou Huang,et al.  Composite splitting algorithms for convex optimization , 2011, Comput. Vis. Image Underst..

[4]  P. Anandan,et al.  Hierarchical Model-Based Motion Estimation , 1992, ECCV.

[5]  Hossein Mobahi,et al.  Toward a Practical Face Recognition System: Robust Alignment and Illumination by Sparse Representation , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Robert D. Nowak,et al.  High-dimensional Matched Subspace Detection when data are missing , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  Paul A. Viola,et al.  Robust Real-Time Face Detection , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[8]  Wei Liu,et al.  Sub-Selective Quantization for Large-Scale Image Search , 2014, AAAI.

[9]  Junzhou Huang,et al.  Simultaneous image transformation and sparse representation recovery , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[10]  Aleix M. Martinez,et al.  The AR face database , 1998 .

[11]  David J. Kriegman,et al.  From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[13]  Takeo Kanade,et al.  Multi-PIE , 2008, 2008 8th IEEE International Conference on Automatic Face & Gesture Recognition.

[14]  A. Martínez,et al.  The AR face databasae , 1998 .

[15]  Lei Zhang,et al.  Sparse representation or collaborative representation: Which helps face recognition? , 2011, 2011 International Conference on Computer Vision.

[16]  David Zhang,et al.  Efficient Misalignment-Robust Representation for Real-Time Face Recognition , 2012, ECCV.

[17]  Junzhou Huang,et al.  Efficient MR Image Reconstruction for Compressed MR Imaging , 2010, MICCAI.

[18]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[19]  Vincent Lepetit,et al.  Are sparse representations really relevant for image classification? , 2011, CVPR 2011.

[20]  Allen Y. Yang,et al.  Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.