{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T06:25:48Z","timestamp":1773210348050,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/tip.2012.2205006","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T19:44:44Z","timestamp":1340048684000},"page":"4349-4360","source":"Crossref","is-referenced-by-count":315,"title":["Visual Classification With Multitask Joint Sparse Representation"],"prefix":"10.1109","volume":"21","author":[{"family":"Xiao-Tong Yuan","sequence":"first","affiliation":[]},{"family":"Xiaobai Liu","sequence":"additional","affiliation":[]},{"family":"Shuicheng Yan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030471"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.030"},{"key":"ref33","author":"bach","year":"2012","journal-title":"Structured Sparsity Through Convex Optimization"},{"key":"ref32","first-page":"2541","article-title":"On model selection consistancy of lasso","volume":"7","author":"zhao","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS659"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","article-title":"Least angle regression","volume":"32","author":"efron","year":"2004","journal-title":"Ann Stat"},{"key":"ref37","first-page":"1218","article-title":"Analysis and extensions of the focuss algorithm","author":"rao","year":"1996","journal-title":"Proc Conf Record 30th Asilomar Conf Signals Syst Comput"},{"key":"ref36","author":"singaraju","year":"2011","journal-title":"On the lagrangian biduality of sparsity minimization problems"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS584"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954342"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000013087.49260.fb"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408875"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048473"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref20","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"0","journal-title":"SIAM J Optim"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.177"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.320"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383198"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.68"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICVGIP.2008.47"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459169"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/090756855"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.128"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CRV.2005.87"},{"key":"ref58","author":"sanderson","year":"2008","journal-title":"Biometric Person Recognition Face Speech and Fusion"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2005.09.012"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.42"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.244"},{"key":"ref54","first-page":"456","article-title":"Optimizing costly functions with simple constraints: A limited-memory projected quasi-Newton algorithm","volume":"5","author":"schmidt","year":"2009","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s11760-008-0076-1"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.05.006"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2037655"},{"key":"ref11","author":"kato","year":"2008","journal-title":"Advances in neural information processing systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2007961"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390164"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553458"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9111-x"},{"key":"ref17","author":"zhang","year":"2006","journal-title":"A Probabilistic Framework for Multi-Task Learning"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0606668909"},{"key":"ref19","author":"nesterov","year":"2007","journal-title":"Gradient methods for minimizing composite objective function"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044470"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206654"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.68"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5583.001.0001","author":"rao","year":"2002","journal-title":"Probabilistic Models of the Brain Perception and Neural Function"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2050625"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","article-title":"For most large undertetermined systems of linear equations the minimal <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_{1}$<\/tex><\/formula>-norm solution is also the sparsest solution","volume":"59","author":"donoho","year":"2006","journal-title":"Commun Pure Appl Math"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383084"},{"key":"ref45","first-page":"988","article-title":"Exclusive lasso for multi-task feature selection","author":"zhou","year":"2010","journal-title":"Proc Int Conf Artif Intell Stat"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"tibshirani","year":"1996","journal-title":"J Royal Stat Soc Ser B"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4959720"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995664"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/83\/6303957\/06220250.pdf?arnumber=6220250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T20:36:40Z","timestamp":1714077400000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6220250\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":60,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tip.2012.2205006","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"value":"1057-7149","type":"print"},{"value":"1941-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}