{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T17:40:39Z","timestamp":1769622039830,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"IITP","award":["RS-2024-00459797"],"award-info":[{"award-number":["RS-2024-00459797"]}]},{"DOI":"10.13039\/100031839","name":"Korea Research Institute for Defense Technology Planning and Advancement","doi-asserted-by":"publisher","award":["KRIT-CT-22-040"],"award-info":[{"award-number":["KRIT-CT-22-040"]}],"id":[{"id":"10.13039\/100031839","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3654106","type":"journal-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:40:58Z","timestamp":1768423258000},"page":"9532-9543","source":"Crossref","is-referenced-by-count":0,"title":["CNN Compression via Channel-Wise Variance-Based Filter Pruning"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3091-9926","authenticated-orcid":false,"given":"Jinse","family":"Kwon","sequence":"first","affiliation":[{"name":"Artificial Intelligence Computing Research Laboratory, Electronics and Telecommunications Research Institute, Daejeon, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9332-3508","authenticated-orcid":false,"given":"Jemin","family":"Lee","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Computing Research Laboratory, Electronics and Telecommunications Research Institute, Daejeon, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8244-4817","authenticated-orcid":false,"given":"Sihyeong","family":"Park","sequence":"additional","affiliation":[{"name":"SoC Platform Research Center, Korea Electronics Technology Institute, Seongnam-si, Gyeonggi-do, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9615-1644","authenticated-orcid":false,"given":"Hyungshin","family":"Kim","sequence":"additional","affiliation":[{"name":"4Division of Computer Convergence, Chungnam National University, Daejeon, Republic of Korea"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Optimal brain damage","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"2","author":"LeCun"},{"key":"ref2","article-title":"Pruning filters for efficient ConvNets","author":"Li","year":"2016","journal-title":"arXiv:1608.08710"},{"key":"ref3","first-page":"16305","article-title":"Rethinking the pruning criteria for convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Huang"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.298"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00447"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WACV51458.2022.00341"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/525"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01467"},{"issue":"12","key":"ref9","first-page":"7070","article-title":"Pruning networks with cross-layer ranking and k-reciprocal filters","volume":"33","author":"Lin","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01152"},{"key":"ref11","article-title":"SNIP: Single-shot network pruning based on connection sensitivity","author":"Lee","year":"2018","journal-title":"arXiv:1810.02340"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00159"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533908"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.09.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref16","article-title":"AutoSlim: Towards one-shot architecture search for channel numbers","author":"Yu","year":"2019","journal-title":"arXiv:1903.11728"},{"key":"ref17","article-title":"Structured pruning for deep convolutional neural networks: A survey","author":"He","year":"2023","journal-title":"arXiv:2303.00566"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3447085"},{"key":"ref19","first-page":"1135","article-title":"Learning both weights and connections for efficient neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Han"},{"key":"ref20","article-title":"Pruning convolutional neural networks for resource efficient inference","author":"Molchanov","year":"2016","journal-title":"arXiv:1611.06440"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.541"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045167"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/309"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3084856"},{"key":"ref25","article-title":"Variance pruning: Pruning language models via temporal neuron variance","author":"Weinstein","year":"2021","journal-title":"arXiv:2106.04450"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.l803.03635"},{"key":"ref27","article-title":"Decoupled weight decay regularization","author":"Loshchilov","year":"2017","journal-title":"arXiv:1711.05101"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3179616"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00289"},{"key":"ref30","article-title":"Provable filter pruning for efficient neural networks","author":"Liebenwein","year":"2019","journal-title":"arXiv:1911.07412"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/WACV48630.2021.00100"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01544"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11352833.pdf?arnumber=11352833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:13:29Z","timestamp":1769577209000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11352833\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3654106","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}