Shape Sparse Representation for Joint Object Classification and Segmentation

被引:39
作者
Chen, Fei [1 ]
Yu, Huimin [1 ,2 ]
Hu, Roland [1 ]
机构
[1] Zhejiang Univ, Dept Informat Sci & Elect Engn, Hangzhou 310027, Zhejiang, Peoples R China
[2] Zhejiang Univ, State Key Lab CAD & CG, Zhejiang Prov Key Lab Informat Network Technol, Hangzhou 310027, Zhejiang, Peoples R China
关键词
Image segmentation; shape priors; sparse representation; variational formulations; KERNEL DENSITY-ESTIMATION; UNCERTAINTY PRINCIPLES; IMAGE SEGMENTATION; ACTIVE CONTOURS; PRIORS; RECOGNITION; FRAMEWORK; SINGLE;
D O I
10.1109/TIP.2012.2226044
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a novel variational model based on prior shapes for simultaneous object classification and segmentation is proposed. Given a set of training shapes of multiple object classes, a sparse linear combination of training shapes in a low-dimensional representation is used to regularize the target shape in variational image segmentation. By minimizing the proposed variational functional, the model is able to automatically select the reference shapes that best represent the object by sparse recovery and accurately segment the image, taking into account both the image information and the shape priors. For some applications under an appropriate size of training set, the proposed model allows artificial enlargement of the training set by including a certain number of transformed shapes for transformation invariance, and then the model remains jointly convex and can handle the case of overlapping or multiple objects presented in an image within a small range. Numerical experiments show promising results and the potential of the method for object classification and segmentation.
引用
收藏
页码:992 / 1004
页数:13
相关论文
共 48 条
[1]  
[Anonymous], 2002, Applied Mathematical Sciences
[2]   Interior gradient and proximal methods for convex and conic optimization [J].
Auslender, A ;
Teboulle, M .
SIAM JOURNAL ON OPTIMIZATION, 2006, 16 (03) :697-725
[3]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[4]   NESTA: A Fast and Accurate First-Order Method for Sparse Recovery [J].
Becker, Stephen ;
Bobin, Jerome ;
Candes, Emmanuel J. .
SIAM JOURNAL ON IMAGING SCIENCES, 2011, 4 (01) :1-39
[5]   Templates for convex cone problems with applications to sparse signal recovery [J].
Becker S.R. ;
Candès E.J. ;
Grant M.C. .
Mathematical Programming Computation, 2011, 3 (3) :165-218
[6]   From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images [J].
Bruckstein, Alfred M. ;
Donoho, David L. ;
Elad, Michael .
SIAM REVIEW, 2009, 51 (01) :34-81
[7]   LINEARIZED BREGMAN ITERATIONS FOR COMPRESSED SENSING [J].
Cai, Jian-Feng ;
Osher, Stanley ;
Shen, Zuowei .
MATHEMATICS OF COMPUTATION, 2009, 78 (267) :1515-1536
[8]   Quantitative robust uncertainty principles and optimally sparse decompositions [J].
Candès, Emmanuel J. ;
Romberg, Justin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2006, 6 (02) :227-254
[9]   Geodesic active contours [J].
Caselles, V ;
Kimmel, R ;
Sapiro, G .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1997, 22 (01) :61-79
[10]  
Chan T, 2005, PROC CVPR IEEE, P1164