Sparse and low-rank coupling image segmentation model via nonconvex regularization

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 29, Issue 2, 2015, Pages

  Zhang, Xiujun ^a   Xu, Chen ^a   Li, Min ^a   Sun, Xiaoli ^a  

^a SHENZHEN UNIVERSITY   (China)

Author keywords

augmented Lagrange multiplier; Image segmentation; low rank representation; nonconvex regularization; sparse representation

Indexed keywords

LAGRANGE MULTIPLIERS; LEARNING TO RANK;

AUGMENTED LAGRANGE MULTIPLIERS; IMAGE SEGMENTATION MODEL; LOW-RANK REPRESENTATIONS; NONCONVEX; NUCLEAR NORM MINIMIZATIONS; REGION BASED IMAGE SEGMENTATION; SPARSE REPRESENTATION; STATE-OF-THE-ART METHODS;

IMAGE SEGMENTATION;

EID: 84928485215     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001415550046     Document Type: Article

References (34)

1. S. Alpert et al., Image segmentation by probabilistic bottom-up aggregation and cue integration, IEEE Conf. Comput. Vis. Patt. Recogn. (2007), pp. 1-8.
2. P. Arbelaez et al., From contours to regions: An empirical evaluation, IEEE Conf. Comput. Vis. Patt. Recogn. (2009), pp. 2294-2301.
3. E. J. Candes and B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math. 9(6) (2009) 717-772.
4. G. Chen and G. Lerman, Spectral curvature clustering (SCC), Int. J. Comput. Vis. 81(3) (2009) 317-330.
5. X. Chen, F. Xu and Y. Ye, Lower bound theory of nonzero entries in solutions of L2-Lp minimization, SIAM J. Sci. Comput. 32(5) (2010) 2832-2852.
6. B. Cheng et al., Multi-task low-rank affinity pursuit for image segmentation, IEEE Int. Conf. Comput. Vis. (IEEE, 2011), pp. 2439-2446.
7. D. Comaniciu and P. Meer, Mean shift: A robust approach toward feature space analysis, IEEE Trans. Patt. Anal. Mach. Intell. 24(5) (2002) 603-619.
8. L. Ding, A. Yilmaz and R. Yan, Interactive image segmentation using Dirichlet process multiple-view learning, IEEE Trans. Image Process. 21(4) (2012) 2119-2129.
9. D. L. Donoho, For most large underdetermined systems of linear equations the minimal L1 norm solution is also the sparsest solution, Commun. Pure Appl. Math. 59(6) (2006) 797-829.
10. D. L. Donoho, For most large underdetermined systems of linear equations the minimal L1 norm solution is also the sparsest solution, Commun. Pure Appl. Math. 59(6) (2006) 797-829.
11. E. Elhamifar and R. Vidal, Sparse subspace clustering, IEEE Conf. Comput. Vis. Patt. Recogn. (2009), pp. 2790-2797.
12. P. F. Felzenszwalb and D. P. Huttenlocher, Efficient graph-based image segmentation, Int. J. Comput. Vis. 59(2) (2004) 167-181.
13. M. Galun et al., Texture segmentation by multiscale aggregation of ¯lter responses and shape elements, Ninth IEEE Int. Conf. Comput. Vis. (IEEE, 2003), pp. 716-723.
14. F. Lauer and C. Schnorr, Spectral clustering of linear subspaces for motion segmentation, IEEE 12th Int. Conf. Comput. Vis. (2009).
15. G. Liu et al., Robust recovery of subspace structures by low-rank representation, IEEE Trans. Patt. Anal. Mach. Intell. 35(1) (2013) 171-184.
16. F. Li, L. Fang et al., A multiphase image segmentation method based on fuzzy region competition, SIAM J. Imag. Sci. 3(3) (2010) 277-299.
17. Z. Lin, M. Chen and Y. Ma, The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices, arXiv preprint arXiv:1009.5055 (2010).
18. G. Liu, Z. Lin and Y. Yu, Robust subspace segmentation by low-rank representation, Proc. 27th Int. Conf. Mach. Learn. (ACM, 2010), pp. 663-670.
19. D. G. Lowe, Object recognition from local scale-invariant features, Seventh IEEE Int. Conf. Comput. Vis. Vol. 2 (IEEE, 1999), pp. 1150-1157.
20. C.-Y. Lu et al., Robust and efficient sub-space segmentation via least squares regression, Comput. VisionCECCV (Springer, Berlin, Heidelberg, 2012), pp. 347-360.
21. M. Meila, Comparing clusterings: An axiomatic view, Proc. 22nd Int. Conf. Mach. Learn. ICML'05 Bonn, Germany (ACM, NY, USA, 2005), pp. 577-584.
22. G. Mori et al., Recovering human body con¯gurations: Combining segmentation and recognition, IEEE Conf. Comput. Vis. Patt. Recogn. Vol. 2 (IEEE, 2004), pp. II-326-II-333.
23. B. Nasihatkon and R. Hartley, Graph connectivity in sparse subspace clustering, IEEE Conf. Comput. Vis. Patt. Recogn. (2011), pp. 2137-2144.
24. D. Peng, N. Xiu and J. Yu, S1=2 regularization methods and ¯xed point algorithms for affine rank minimization problems, http://www.optimization-online.org/.
25. W. M. Rand, Objective criteria for the evaluation of clustering methods, J. Am. Stat. Assoc. 66(336) (1971) 846-850.
26. B. Recht, M. Fazel and P. A. Parrilo, Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization, SIAM Rev. 52(3) (2010) 471-501.
27. X. Ren, C. C. Fowlkes and J. Malik, Scale-invariant contour completion using conditional random ¯elds, Tenth IEEE Int. Conf. Comput. Vis., Vol. 2 (IEEE, 2005), pp. 1214-1221.
28. J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Trans. Patt. Anal. Mach. Intell. 22(8) (2000) 888-905.
29. Y. Wang and C. Dang, An evolutionary algorithm for global optimization based on levelset evolution and latin squares, IEEE Trans. Evol. Comput. 11(5) (2007) 579-595.
30. Y. Wang, Y.-C. Jiao and H. Li, An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme, IEEE Trans. Syst. Man Cybern. Part C 35(2) (2005) 221-232.
31. Z. Xu et al., L1=2 regularization: A thresholding representation theory and a fast solver, IEEE Trans. Neural Netw. Learn. Syst. 23(7) (2012) 1013-1027.
32. Z. Xu et al., Representative of L1=2 regularization among Lq0 33.Z. Xu et al., L1=2 regularization, Sci. China-Information Sci.53(6) (2010)1159-1169
33. Z. Xu et al., L1=2 regularization, Sci. China-Information Sci. 53(6) (2010) 1159-1169.
34. L. Zhuang et al., Non-negative low rank and sparse graph for semi-supervised learning, IEEE Conf. Comput. Vis. Patt. Recogn. (2012), pp. 2328-2335.