{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T15:52:21Z","timestamp":1784130741509,"version":"3.55.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:00:00Z","timestamp":1640908800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CNS-1629914, CCF-1640081, and CCF-1617735"],"award-info":[{"award-number":["CNS-1629914, CCF-1640081, and CCF-1617735"]}]},{"name":"Nanoelectronics Research Corporation"},{"DOI":"10.13039\/100000028","name":"Semiconductor Research Corporation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Extremely Energy Efficient Collective Electronics"},{"name":"SRC-NRI Nanoelectronics Research Initiative","award":["2698.004 and 2698.005"],"award-info":[{"award-number":["2698.004 and 2698.005"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2022,4,30]]},"abstract":"<jats:p>\n            Compression is a standard procedure for making convolutional neural networks (CNNs) adhere to some specific computing resource constraints. However, searching for a compressed architecture typically involves a series of time-consuming training\/validation experiments to determine a good compromise between network size and performance accuracy. To address this, we propose an image complexity-guided network compression technique for biomedical image segmentation. Given any resource constraints, our framework utilizes data complexity and network architecture to quickly estimate a compressed model which does not require network training. Specifically, we\n            <jats:italic>map<\/jats:italic>\n            the dataset complexity to the target network accuracy degradation caused by compression. Such mapping enables us to predict the final accuracy for different network sizes, based on the computed dataset complexity. Thus, one may choose a solution that meets both the network size and segmentation accuracy requirements. Finally, the mapping is used to determine the convolutional layer-wise multiplicative factor for generating a compressed network. We conduct experiments using 5 datasets, employing 3 commonly-used CNN architectures for biomedical image segmentation as representative networks. Our proposed framework is shown to be effective for generating compressed segmentation networks, retaining up to \u224895% of the full-sized network segmentation accuracy, and at the same time, utilizing \u224832x fewer network trainable weights (average reduction) of the full-sized networks.\n          <\/jats:p>","DOI":"10.1145\/3471190","type":"journal-article","created":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T14:34:17Z","timestamp":1640961257000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Image Complexity Guided Network Compression for Biomedical Image Segmentation"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8922-9068","authenticated-orcid":false,"given":"Suraj","family":"Mishra","sequence":"first","affiliation":[{"name":"University of Notre Dame, Notre Dame, Indiana"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, Indiana"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"X. Sharon","family":"Hu","sequence":"additional","affiliation":[{"name":"University of Notre Dame, Notre Dame, Indiana"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,12,31]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/11744023_32"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/3015812.3015985"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2018.8363547"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.2012.2205687"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00171"},{"key":"e_1_3_1_7_2","unstructured":"Song Han Huizi Mao and William J. Dally. 2016. Deep compression: Compressing deep neural networks with pruning trained quantization and huffman coding. In Proceedings of the 4th International Conference on Learning Representations ICLR 2016 May 2\u20134 2016 San Juan Puerto Rico . http:\/\/arxiv.org\/abs\/1510.00149"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.123"},{"key":"e_1_3_1_9_2","unstructured":"Andrew G. Howard Menglong Zhu Bo Chen Dmitry Kalenichenko Weijun Wang Tobias Weyand Marco Andreetto and Hartwig Adam. 2017. Mobilenets: Efficient convolutional neural networks for mobile vision applications. CoRRabs\/1704.04861 (2017). arXiv:1704.04861 http:\/\/arxiv.org\/abs\/1704.04861"},{"key":"e_1_3_1_10_2","unstructured":"Forrest N. Iandola Matthew W. Moskewicz Khalid Ashraf Song Han William J. Dally and Kurt Keutzer. 2016. SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <1MB model size. CoRRabs\/1602.07360 (2016). arXiv:1602.07360 http:\/\/arxiv.org\/abs\/1602.07360"},{"key":"e_1_3_1_11_2","unstructured":"Woojeong Kim Suhyun Kim Mincheol Park and Geonseok Jeon. 2020. Neuron merging: Compensating for pruned neurons. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020 NeurIPS 2020 December 6\u201312 2020 virtual HugoLarochelle Marc\u2019Aurelio Ranzato Raia Hadsell Maria-Florina Balcan and Hsuan-Tien Lin (Eds.). https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/0678ca2eae02d542cc931e81b74de122-Abstract.html."},{"key":"e_1_3_1_12_2","unstructured":"Diederik P. Kingma and Jimmy Ba. 2017. Adam: A method for stochastic optimization. In Proceedings of the 3rd International Conference on Learning Representations ICLR 2015 San Diego CA USA May 7\u20139 2015 Yoshua Bengio and Yann LeCun (Eds.). http:\/\/arxiv.org\/abs\/1412.6980"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.3390\/s18020556"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2018.8363724"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.106"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2858826"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/850924.851523"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI45749.2020.9098403"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI48211.2021.9433774"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2019.8759448"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01152"},{"key":"e_1_3_1_22_2","volume-title":"Proceedings of the 5th International Conference on Learning Representations","author":"Molchanov Pavlo","year":"2017","unstructured":"Pavlo Molchanov, Stephen Tyree, Tero Karras, Timo Aila, and Jan Kautz. 2017. Pruning convolutional neural networks for resource efficient inference. In Proceedings of the 5th International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=SJGCiw5gl."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2019.2950051"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2019.00336"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.5555\/3305890.3305975"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24574-4_28"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1167\/7.2.17"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2004.825627"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISBI.2017.7950607"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00934-2_14"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.02.018"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/QoMEX.2013.6603194"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2017.2787487"},{"key":"e_1_3_1_34_2","doi-asserted-by":"crossref","unstructured":"Ofir Zafrir Guy Boudoukh Peter Izsak and Moshe Wasserblat. 2019. Q8BERT: quantized 8Bit BERT. In Fifth Workshop on Energy Efficient Machine Learning and Cognitive Computing-NeurIPS Edition (EMC2-NIPS) . 36\u201339.","DOI":"10.1109\/EMC2-NIPS53020.2019.00016"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00934-2_10"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32245-8_71"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2016.7822557"},{"key":"e_1_3_1_38_2","unstructured":"Ritchie Zhao Yuwei Hu Jordan Dotzel Christopher De Sa and Zhiru Zhang. 2019. Improving neural network quantization without retraining using outlier channel splitting. In Proceedings of the 36th International Conference on Machine Learning ICML 2019 9\u201315 June 2019 Long Beach California USA (Proceedings of Machine Learning Research Vol. 97) Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR 7543\u20137552. http:\/\/proceedings.mlr.press\/v97\/zhao19c.html."},{"key":"e_1_3_1_39_2","unstructured":"Aojun Zhou Anbang Yao Yiwen Guo Lin Xu and Yurong Chen. 2017. Incremental network quantization: Towards lossless CNNs with low-precision weights. In Proceedings of the 5th International Conference on Learning Representations ICLR 2017 Toulon France April 24\u201326 2017 . OpenReview.net. https:\/\/openreview.net\/forum?id=HyQJ-mclg"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00889-5_1"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471190","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3471190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:30Z","timestamp":1750268970000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,31]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4,30]]}},"alternative-id":["10.1145\/3471190"],"URL":"https:\/\/doi.org\/10.1145\/3471190","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,31]]},"assertion":[{"value":"2020-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}