{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:29:16Z","timestamp":1760646556443},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T00:00:00Z","timestamp":1478649600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s11042-016-4091-x","type":"journal-article","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T08:38:09Z","timestamp":1478680689000},"page":"23163-23185","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient l q norm based sparse subspace clustering via smooth IRLS and ADMM"],"prefix":"10.1007","volume":"76","author":[{"given":"Shenfen","family":"Kuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HongYang","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"4091_CR1","doi-asserted-by":"crossref","unstructured":"Basri R, Jacobs DW (2001) Lambertian reflectance and linear subspaces. International Conference on Computer Vision","DOI":"10.1109\/ICCV.2001.937651"},{"key":"4091_CR2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TPAMI.2003.1177153","volume":"25.2","author":"R Basri","year":"2003","unstructured":"Basri R, Jacobs D W (2003) Lambertian reflectance and linear subspaces. IEEE Trans Pattern Anal Mach Intell 25.2:218\u2013233","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4091_CR3","first-page":"1","volume":"3.1","author":"S Boyd","year":"2011","unstructured":"Boyd S, et al. (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3.1:1\u2013122","journal-title":"Found Trends Mach Learn"},{"key":"4091_CR4","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14.5\u20136","author":"EJ Candes","year":"2008","unstructured":"Candes EJ, Wakin MB, Boyd SP (2008) Enhancing sparsity by reweighted l1 minimization. J Fourier Anal Appl 14.5\u20136:877\u2013905","journal-title":"J Fourier Anal Appl"},{"key":"4091_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.neucom.2016.04.010","volume":"205","author":"W Cheng","year":"2016","unstructured":"Cheng W, Chow T WS, Zhao M (2016) Locality constrained-p sparse subspace clustering for image clustering[J]. Neurocomputing 205:22\u201331","journal-title":"Neurocomputing"},{"key":"4091_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63.1","author":"I Daubechies","year":"2010","unstructured":"Daubechies I, et al. (2010) Iteratively reweighted least squares minimization for sparse recovery. Commun Pure Appl Math 63.1:1\u201338","journal-title":"Commun Pure Appl Math"},{"key":"4091_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/TNNLS.2012.2235082","volume":"24.3","author":"Y Deng","year":"2013","unstructured":"Deng Y, et al. (2013) Low-rank structure learning via nonconvex heuristic recovery. IEEE Trans Neural Netw Learn Syst 24.3:383\u2013396","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1","key":"4091_CR8","first-page":"2487","volume":"14","author":"EL Dyer","year":"2013","unstructured":"Dyer E L, Sankaranarayanan A C, Baraniuk R G (2013) Greedy feature selection for subspace clustering[J]. J Mach Learn Res 14(1):2487\u20132517","journal-title":"J Mach Learn Res"},{"key":"4091_CR9","unstructured":"Dyer EL, et al. (2015) Self-expressive decompositions for matrix approximation and clustering. arXiv preprint arXiv: 1505.00824"},{"key":"4091_CR10","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35.11","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar E, Vidal R (2013) Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans Pattern Anal Mach Intell 35.11:2765\u20132781","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"4091_CR11","doi-asserted-by":"crossref","unstructured":"Feng J, Lin Z, Xu H, et al. (2014) Robust subspace segmentation with block-diagonal prior[C]. In: IEEE Conference on computer vision and pattern recognition (CVPR), 2014. IEEE, pp 3818\u20133825","DOI":"10.1109\/CVPR.2014.482"},{"key":"4091_CR12","doi-asserted-by":"crossref","first-page":"1614","DOI":"10.1137\/100811404","volume":"21.4","author":"M Fornasier","year":"2011","unstructured":"Fornasier M, Rauhut H, Ward R (2011) Low-rank matrix recovery via iteratively reweighted least squares minimization. SIAM J Optim 21.4:1614\u20131640","journal-title":"SIAM J Optim"},{"key":"4091_CR13","unstructured":"Fornasier M, et al. (2015) Conjugate gradient acceleration of iteratively re-weighted least squares methods. arXiv preprint arXiv: 1509.04063"},{"key":"4091_CR14","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.neucom.2012.05.028","volume":"99","author":"S Guo","year":"2013","unstructured":"Guo S, Wang Z, Ruan Q (2013) Enhancing sparsity via l p (0 < p < 1) minimization for robust face recognition. Neurocomputing 99:592\u2013602","journal-title":"Neurocomputing"},{"key":"4091_CR15","doi-asserted-by":"crossref","first-page":"4001","DOI":"10.1109\/TIP.2015.2456504","volume":"24.11","author":"R He","year":"2015","unstructured":"He R, et al. (2015) Robust subspace clustering with complex noise. IEEE Trans Image Process 24.11:4001\u20134013","journal-title":"IEEE Trans Image Process"},{"key":"4091_CR16","unstructured":"Heckel R, B?lcskei H (2013) Robust subspace clustering via thresholding[J]. arXiv preprint arXiv: 1307.4891"},{"key":"4091_CR17","unstructured":"Heckel R, Tschannen M, B\u00f6lcskei H (2015) Dimensionality-reduced subspace clustering[J]. arXiv preprint arXiv: 1507.07105"},{"issue":"3","key":"4091_CR18","first-page":"3179","volume":"53","author":"S-Y Huang","year":"2009","unstructured":"Huang S-Y, Yeh Y-R, Eguchi S, Candes E J, Li X, Ma Y, Wring J (2009) Robust principal component analysis. J Assoc Comput Mach 53(3):3179\u2013213","journal-title":"J Assoc Comput Mach"},{"key":"4091_CR19","doi-asserted-by":"crossref","unstructured":"Hund M, B\u00f6hm D, Sturm W, et al. (2016) Visual analytics for concept exploration in subspaces of patient groups[J]. Brain Inform:1\u201315","DOI":"10.1007\/s40708-016-0043-5"},{"key":"4091_CR20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/090775397","volume":"21.1","author":"M-J Lai","year":"2011","unstructured":"Lai M-J, Wang J (2011) An unconstrained l q minimization with l q for sparse solution of underdetermined linear systems. SIAM J Optim 21.1:82\u2013101","journal-title":"SIAM J Optim"},{"key":"4091_CR21","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51.2","author":"M-J Lai","year":"2013","unstructured":"Lai M-J, Yangyang X, Yin W (2013) Improved iteratively reweighted least squares for unconstrained smoothed \u0142 q minimization. SIAM J Numer Anal 51.2:927\u2013957","journal-title":"SIAM J Numer Anal"},{"key":"4091_CR22","unstructured":"Liu G, Lin Z, Yong Y (2010) Robust subspace segmentation by low-rank representation. In: Proceedings of the 27th international conference on machine learning (ICML-10)"},{"issue":"9","key":"4091_CR23","doi-asserted-by":"crossref","first-page":"4022","DOI":"10.1109\/TIP.2014.2343458","volume":"23","author":"J Liu","year":"2014","unstructured":"Liu J, Chen Y, Zhang J, et al. (2014) Enhancing low-rank subspace clustering by manifold regularization[J]. IEEE Trans Image Process 23(9):4022\u20134030","journal-title":"IEEE Trans Image Process"},{"key":"4091_CR24","doi-asserted-by":"crossref","unstructured":"Lu C (2012) Robust and efficient subspace segmentation via least squares regression, ECCV. pp 1\u201314","DOI":"10.1007\/978-3-642-33786-4_26"},{"key":"4091_CR25","first-page":"646","volume":"24.2","author":"C Lu","year":"2015","unstructured":"Lu C, Lin Z, Yan S (2015) Smoothed low rank and sparse matrix recovery by iteratively reweighted least squares minimization. IEEE Trans Image Process 24.2:646\u2013654","journal-title":"IEEE Trans Image Process"},{"key":"4091_CR26","doi-asserted-by":"crossref","unstructured":"Peng X, Yi Z, Tang H (2015) Robust subspace clustering via thresholding ridge regression. In: AAAI Conference on artificial intelligence (aaaI)","DOI":"10.1609\/aaai.v29i1.9788"},{"key":"4091_CR27","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1214\/13-AOS1199","volume":"42.2","author":"M Soltanolkotabi","year":"2014","unstructured":"Soltanolkotabi M, Elhamifar E, Candes E J (2014) Robust subspace clustering. Ann Stat 42.2:669\u2013699","journal-title":"Ann Stat"},{"issue":"12","key":"4091_CR28","doi-asserted-by":"crossref","first-page":"4686","DOI":"10.1109\/TIP.2015.2462076","volume":"24","author":"Y Sui","year":"2015","unstructured":"Sui Y, Zhang S, Zhang L (2015) Robust visual tracking via sparsity-induced subspace learning[J]. IEEE Trans Image Process 24(12):4686\u20134700","journal-title":"IEEE Trans Image Process"},{"key":"4091_CR29","doi-asserted-by":"crossref","unstructured":"Tron R, Vidal R (2007) A benchmark for the comparison of 3-d motion segmentation algorithms. In: IEEE Conference on computer vision and pattern recognition, 2007. CVPR\u201907. IEEE","DOI":"10.1109\/CVPR.2007.382974"},{"key":"4091_CR30","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.patrec.2013.08.006","volume":"43","author":"R Vidal","year":"2014","unstructured":"Vidal R, Favaro P (2014) Low rank subspace clustering (LRSC). Pattern Recog Lett 43:47\u201361","journal-title":"Pattern Recog Lett"},{"key":"4091_CR31","doi-asserted-by":"crossref","unstructured":"Wang S, Yuan X, Yao T, Yan S (2011) Efficient subspace segmentation via quadratic programming. In: Proc. Twenty-Fifth AAAI conf. artif. intell., pp 519\u2013524","DOI":"10.1609\/aaai.v25i1.7892"},{"key":"4091_CR32","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.acha.2014.06.003","volume":"38.1","author":"J Wen","year":"2015","unstructured":"Wen J, Li D, Zhu F (2015) Stable recovery of sparse signals via lp-minimization. Appl Comput Harm Anal 38.1:161\u2013176","journal-title":"Appl Comput Harm Anal"},{"key":"4091_CR33","doi-asserted-by":"crossref","unstructured":"Xu J, et al. (2015) Reweighted sparse subspace clustering. Comput Vis Image Understand","DOI":"10.1016\/j.cviu.2015.04.003"},{"key":"4091_CR34","doi-asserted-by":"crossref","first-page":"3234","DOI":"10.1109\/TIP.2013.2262292","volume":"22.8","author":"AY Yang","year":"2013","unstructured":"Yang AY, et al. (2013) Fast-minimization algorithms for robust face recognition. IEEE Trans Image Process 22.8:3234\u20133246","journal-title":"IEEE Trans Image Process"},{"key":"4091_CR35","unstructured":"You C, Vidal R (2015) Subspace-sparse representation. arXiv preprint arXiv: 1507.01307"},{"key":"4091_CR36","doi-asserted-by":"crossref","unstructured":"Zhang C H, Zhang T (2012) A general theory of concave regularization for high-dimensional sparse estimation problems[J]. Stat Sci:576\u2013593","DOI":"10.1214\/12-STS399"},{"key":"4091_CR37","doi-asserted-by":"crossref","unstructured":"Zhang Y, et al. (2013) Robust subspace clustering via half-quadratic minimization. In: 2013 IEEE International conference on computer vision (ICCV). IEEE","DOI":"10.1109\/ICCV.2013.384"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-016-4091-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-4091-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-4091-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T20:51:26Z","timestamp":1692564686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-016-4091-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,9]]},"references-count":37,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["4091"],"URL":"https:\/\/doi.org\/10.1007\/s11042-016-4091-x","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,9]]}}}