Sparse Representation Shape Models

被引:3
作者
Li, Yuelong [1 ]
Feng, Jufu [2 ]
Meng, Li [3 ]
Wu, Jigang [1 ]
机构
[1] Tianjin Polytech Univ, Sch Comp Sci & Software Engn, Tianjin, Peoples R China
[2] Peking Univ, Sch Elect Engn & Comp Sci, Key Lab Machine Percept MOE, Dept Machine Intelligence, Beijing 100871, Peoples R China
[3] Mil Transportat Univ, Automobile Transport Command Dept, Tianjin, Peoples R China
基金
中国国家自然科学基金;
关键词
Shape extraction; Deformable shape model; Morphological shape model; Sparse representation; Point distribution model; Pose recognition; FACE-RECOGNITION; MIXTURE MODEL; EIGENFACES; FEATURES;
D O I
10.1007/s10851-012-0394-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is well-known that, during shape extraction, enrolling an appropriate shape constraint model could effectively improve locating accuracy. In this paper, a novel deformable shape model, Sparse Representation Shape Models (SRSM), is introduced. Rather than following commonly utilized statistical shape constraints, our model constrains shape appearance based on a morphological structure, the convex hull of aligned training samples, i.e., only shapes that could be linearly represented by aligned training samples with the sum of coefficients equal to one, are defined as qualified. This restriction strictly controls shape deformation modes to reduce extraction errors and prevent extremely poor outputs. This model is realized based on sparse representation, which ensures during shape regularization the maximum valuable shape information could be reserved. Besides, SRSM is interpretable and hence helpful to further understanding applications, such as face pose recognition. The effectiveness of SRSM is verified on two publicly available face image datasets, the FGNET and the FERET.
引用
收藏
页码:83 / 91
页数:9
相关论文
共 32 条
[1]  
ALVAREZ L, 2010, PROC CVPR IEEE, P2197, DOI DOI 10.1109/CVPR.2010.5539900
[2]   On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems [J].
Amaldi, E ;
Kann, V .
THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) :237-260
[3]  
[Anonymous], 2004, Technical Report
[4]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[5]  
Boyd S.P, 2004, Convex optimization, DOI [DOI 10.1017/CBO9780511804441, 10.1017/CBO9780511804441]
[6]  
CANDES E., 2005, l1-magic: Recovery of sparse signals via convex programming
[7]  
Candes EmmanuelJ., 2010, arXiv.org, P1
[8]  
Chen C., 2004, P AS C COMP VIS
[9]   MODEL-BASED RECOGNITION IN ROBOT VISION. [J].
Chin, Roland T. ;
Dyer, Charles R. .
Computing surveys, 1986, 18 (01) :67-108
[10]  
Cootes T., 1992, Proceedings of the British Machine Vision Conference, Leeds, UK, P9, DOI [DOI 10.1007/978-1-4471-3201-1_2, 10.5244/C.6.2]