{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:13:57Z","timestamp":1760242437267,"version":"build-2065373602"},"reference-count":51,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T00:00:00Z","timestamp":1500076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61601112"],"award-info":[{"award-number":["61601112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DHU Distinguished Young Professor Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Parsimony, including sparsity and low-rank, has shown great importance for data mining in social networks, particularly in tasks such as segmentation and recognition. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with convex l1-norm or nuclear norm constraints. However, the obtained results by convex optimization are usually suboptimal to solutions of original sparse or low-rank problems. In this paper, a novel robust subspace segmentation algorithm has been proposed by integrating lp-norm and Schatten p-norm constraints. Our so-obtained affinity graph can better capture local geometrical structure and the global information of the data. As a consequence, our algorithm is more generative, discriminative and robust. An efficient linearized alternating direction method is derived to realize our model. Extensive segmentation experiments are conducted on public datasets. The proposed algorithm is revealed to be more effective and robust compared to five existing algorithms.<\/jats:p>","DOI":"10.3390\/s17071633","type":"journal-article","created":{"date-parts":[[2017,7,18]],"date-time":"2017-07-18T03:45:16Z","timestamp":1500349516000},"page":"1633","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Non-Convex Sparse and Low-Rank Based Robust Subspace Segmentation for Data Mining"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8998-2973","authenticated-orcid":false,"given":"Wenlong","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Information Science & Technology, Donghua University, Shanghai 200051, China"},{"name":"Department of Electronic Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingbo","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Information Science & Technology, Donghua University, Shanghai 200051, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0394-4635","authenticated-orcid":false,"given":"Naixue","family":"Xiong","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7992-9901","authenticated-orcid":false,"given":"Kwok Tai","family":"Chui","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,7,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2447","DOI":"10.1016\/j.patcog.2014.01.007","article-title":"Face recognition by sparse discriminant analysis via joint l2,1-norm minimization","volume":"47","author":"Shi","year":"2014","journal-title":"Pattern Recogn."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1008000628999","article-title":"A multibody factorization method for independently moving objects","volume":"29","author":"Costeira","year":"1998","journal-title":"Int. J. Comput. Vis."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1214\/ss\/1028905973","article-title":"Metrics and models for handwritten character recognition","volume":"13","author":"Hastie","year":"1998","journal-title":"Stat. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","article-title":"Subspace clustering for high dimensional data: A review","volume":"6","author":"Parsons","year":"2004","journal-title":"SIGKDD Explor."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TPAMI.2005.244","article-title":"Generalized principal component analysis (GPCA)","volume":"27","author":"Vidal","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/358669.358692","article-title":"Random sample consensus-A paradigm for model-fitting with applications to image-analysis and automated cartography","volume":"24","author":"Fischler","year":"1981","journal-title":"Commun. ACM"},{"key":"ref_7","first-page":"4080","article-title":"Non-negative Discriminant Matrix Factorization","volume":"45","author":"Lu","year":"2012","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_8","unstructured":"Bailey, T.L., and Elkan, C. (1994, January 14\u201317). Fitting a mixture model by expectation maximization to discover motifs in bipolymers. Proceedings of the International Conference on Intelligent Systems for Molecular Biology, Menlo Park, CA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1111\/1467-9868.00196","article-title":"Probabilistic principal component analysis","volume":"61","author":"Tipping","year":"1999","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"ref_10","unstructured":"Ng, A.Y., Jordan, M.I., and Weiss, Y. (2006, January 3\u20138). On spectral clustering: Analysis and an algorithm. Proceedings of the Annual Conference on Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","article-title":"Robust face recognition via sparse representation","volume":"31","author":"Wright","year":"2009","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1109\/JPROC.2010.2044470","article-title":"Sparse representation for computer vision and pattern recognition","volume":"98","author":"Wright","year":"2010","journal-title":"Proc. IEEE"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1828","DOI":"10.1109\/TCYB.2015.2454521","article-title":"Robust semi-supervised subspace clustering via non-negative low-rank representation","volume":"46","author":"Fang","year":"2016","journal-title":"IEEE Trans. Cybern."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1109\/TPAMI.2011.282","article-title":"Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images","volume":"34","author":"Peng","year":"2012","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_15","unstructured":"Liu, G., Lin, Z., and Yu, Y. (2010, January 21\u201324). Robust subspace segmentation by low-rank representation. Proceedings of the International Conference on Machine Learning, Haifa, Israel."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","article-title":"Sparse subspace clustering: Algorithm, theory, and applications","volume":"35","author":"Elhamifar","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_17","first-page":"1081","article-title":"Analysis of multi-stage convex relaxation for sparse regularization","volume":"11","author":"Zhang","year":"2010","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_18","first-page":"733","article-title":"Robust sparse and low-rank matrix decomposition based on S1\/2 modeling","volume":"43","author":"Rao","year":"2013","journal-title":"Sci. China Inform. Sci."},{"key":"ref_19","unstructured":"Lin, Z., Liu, R., and Su, Z. (2011, January 12\u201317). Linearized alternating direction method with adaptive penalty for low-rank representation. Proceedings of the Annual Conference on Neural Information Processing Systems, Granada, Spain."},{"key":"ref_20","unstructured":"Zhuang, L., Gao, H., Lin, Z., Ma, Y., Zhang, X., and Yu, N. (2012, January 16\u201321). Non-negative low-rank and sparse graph for semi-supervised learning. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, USA."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Lu, C., Tang, J., Yan, S., and Lin, Z. (2014, January 23\u201328). Generalized non-convex non-smooth low-rank minimization. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA.","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1109\/TCYB.2016.2536752","article-title":"Constructing the l2-graph for robust subspace learning and subspace clustering","volume":"47","author":"Peng","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., and Vidal, R. (2009, January 20\u201325). Sparse subspace clustering. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Miami, FL, USA.","DOI":"10.1109\/CVPRW.2009.5206547"},{"key":"ref_24","first-page":"14","article-title":"Image annotation by kNN-sparse graph-based label propagation over noisily tagged web images","volume":"2","author":"Tang","year":"2011","journal-title":"IEEE Trans. Intell. Trans. Syst."},{"key":"ref_25","unstructured":"Wang, Y., Zhang, W., Wu, L., Lin, X., Fang, M., and Pan, S. (2016, January 9\u201315). In Iterative views agreement: An iterative low-rank based structured optimization method to multi-view spectral clustering. Proceedings of the International Joint Conference on Artificial Intelligence, New York, NY, USA."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2499","DOI":"10.1109\/TNNLS.2015.2490080","article-title":"A unified framework for representation-based subspace clustering of out-of-sample and large-scale data","volume":"27","author":"Peng","year":"2016","journal-title":"IEEE Trans. Neural Netw. Learn Syst."},{"key":"ref_27","first-page":"1","article-title":"Automatic subspace learning via principal coefficients embedding","volume":"PP","author":"Peng","year":"2016","journal-title":"IEEE Trans. Cybern."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3939","DOI":"10.1109\/TIP.2015.2457339","article-title":"Robust subspace clustering for multi-view data by exploiting correlation consensus","volume":"24","author":"Wang","year":"2015","journal-title":"IEEE Trans. Image Process."},{"key":"ref_29","first-page":"1013","article-title":"l1\/2 regularization: A thresholding representation theory and a fast solver","volume":"23","author":"Xu","year":"2012","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Zuo, W.M., Meng, D.Y., Zhang, L., Feng, X.C., and Zhang, D. (2013, January 1\u20138). A generalized iterated shrinkage algorithm for non-convex sparse coding. Proceedings of the IEEE International Conference on Computer Vision, Sydney, Australia.","DOI":"10.1109\/ICCV.2013.34"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TMI.2008.927346","article-title":"Highly undersampled magnetic resonance image reconstruction via homotopic l0-minimization","volume":"28","author":"Trzasko","year":"2009","journal-title":"IEEE Trans. Med. Image"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","article-title":"Variable selection via non-concave penalized likelihood and its oracle properties","volume":"96","author":"Fan","year":"2001","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ijforecast.2012.05.001","article-title":"Fast sparse regression and classification","volume":"28","author":"Friedman","year":"2012","journal-title":"Int. J. Forecast."},{"key":"ref_34","first-page":"932","article-title":"Nonlinear image recovery with half-quadratic regularization","volume":"4","author":"Geman","year":"1995","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_35","unstructured":"Gao, C., Wang, N., Yu, Q., and Zhang, Z. (2011, January 7\u201311). A feasible nonconvex relaxation approach to feature selection. Proceedings of the Conference on Artificial Intelligence, San Francisco, CA, USA."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","article-title":"Nearly unbiased variable selection under minimax concave penalty","volume":"38","author":"Zhang","year":"2010","journal-title":"Ann. Stat."},{"key":"ref_37","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"Mohan","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Kong, D., Zhang, M., and Ding, C. (2013, January 23\u201327). Minimal shrinkage for noisy data recovery using Schatten p-norm objective. Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Prague, Czech Republic.","DOI":"10.1007\/978-3-642-40991-2_12"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","article-title":"Fast and accurate matrix completion via truncated nuclear norm regularization","volume":"35","author":"Hu","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/10556788.2012.700713","article-title":"Augmented lagrangian alternating direction method for matrix separation based on low-rank factorization","volume":"29","author":"Shen","year":"2014","journal-title":"Optim. Methods Softw."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"2195","DOI":"10.1214\/12-AOS1034","article-title":"A geometric analysis of subspace clustering with outliers","volume":"40","author":"Soltanolkotabi","year":"2012","journal-title":"Ann. Stat."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Zhou, W., Li, P., Wang, X., Li, F., Liu, H., Zhang, R., Ma, T., Liu, T., Guo, D., and Yao, D. (2015, January 21\u201324). lp norm spectral regression for feature extraction in outlier conditions. Proceedings of the IEEE Conference on Digital Signal Processing, Singapore.","DOI":"10.1109\/ICDSP.2015.7251930"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Nie, F., Wang, H., Cai, X., Huang, H., and Ding, C. (2012, January 10\u201313). Robust matrix completion via joint Schatten p-norm and lp-norm minimization. Proceedings of the IEEE International Conference on Data Mining, Brussels, Belgium.","DOI":"10.1109\/ICDM.2012.160"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM J. Optim."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Favaro, P., Vidal, R., and Ravichandran, A. (2011, January 6\u201313). A closed form solution to robust subspace estimation and clustering. Proceedings of the International Conference on Computer Vision, Barcelona, Spain.","DOI":"10.1109\/CVPR.2011.5995365"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1109\/TPAMI.2003.1251154","article-title":"The CMU pose, illumination, and expression database","volume":"25","author":"Baker","year":"2003","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","article-title":"The Amsterdam library of object images","volume":"61","author":"Geusebroek","year":"2005","journal-title":"Int. J. Comput. Vis."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/34.291440","article-title":"A database for handwritten text recognition research","volume":"16","author":"Hull","year":"1994","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/34.927464","article-title":"From few to many: Illumination cone models for face recognition under variable lighting and pose","volume":"23","author":"Georghiades","year":"2001","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"3717","DOI":"10.1109\/TIP.2015.2441632","article-title":"Constructing a non-negative low-rank and sparse graph with data-adaptive features","volume":"24","author":"Zhuang","year":"2015","journal-title":"IEEE Trans. Image Process."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1109\/TKDE.2005.198","article-title":"Document clustering using locality preserving indexing","volume":"17","author":"Cai","year":"2005","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/7\/1633\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:42:50Z","timestamp":1760208170000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/17\/7\/1633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,15]]},"references-count":51,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2017,7]]}},"alternative-id":["s17071633"],"URL":"https:\/\/doi.org\/10.3390\/s17071633","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2017,7,15]]}}}