{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T06:43:32Z","timestamp":1768977812301,"version":"3.49.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/lsp.2021.3101670","type":"journal-article","created":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T20:04:11Z","timestamp":1628107451000},"page":"1734-1738","source":"Crossref","is-referenced-by-count":15,"title":["A Dual Rank-Constrained Filter Pruning Approach for Convolutional Neural Networks"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7429-0245","authenticated-orcid":false,"given":"Fugui","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5165-204X","authenticated-orcid":false,"given":"Yuting","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2648-7358","authenticated-orcid":false,"given":"Peiguang","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6566-775X","authenticated-orcid":false,"given":"Wei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref12","first-page":"1","article-title":"Very deep convolutional networks for large-scale image recognition","author":"simonyan","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298594"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref15","author":"absil","year":"2009","journal-title":"Optimization Algorithms on Matrix Manifolds"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01235"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2020.2975394"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.387"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2603342"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2286200"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2482598"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2937387"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.155"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.911184"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00290"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2657381"},{"key":"ref20","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low-rank representation","author":"lin","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","first-page":"3547","article-title":"Robust subspace segmentation by simultaneously learning data representations and their affinity matrix","author":"guo","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90031-5"},{"key":"ref24","first-page":"1","article-title":"Pruning filters for efficient ConvNets","author":"li","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref23","first-page":"1","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009","journal-title":"CiteSeer"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017197"},{"key":"ref25","first-page":"1","article-title":"Automatic differentiation in PyTorch","author":"paszke","year":"0","journal-title":"Proc NIPS Autodiff Workshop"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/9325893\/09506816.pdf?arnumber=9506816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:38Z","timestamp":1652194238000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9506816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/lsp.2021.3101670","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}