版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Université Côte d'Azur I3S Cnrs Sophia Antipolis France Orange Labs Sophia Antipolis France
出 版 物:《arXiv》 (arXiv)
年 卷 期:2022年
核心收录:
摘 要:Recently, convolutional auto-encoders (CAE) were introduced for image coding. They achieved performance improvements over the state-of-the-art JPEG2000 method. However, these performances were obtained using massive CAEs featuring a large number of parameters and whose training required heavy computational power. In this paper, we address the problem of lossy image compression using a CAE with a small memory footprint and low computational power usage. In order to overcome the computational cost issue, the majority of the literature uses Lagrangian proximal regularization methods, which are time consuming themselves. In this work, we propose a constrained approach and a new structured sparse learning method. We design an algorithm and test it on three constraints: the classical 1constraint, the 1,∞and the new 1,1constraint. Experimental results show that the 1,1constraint provides the best structured sparsity, resulting in a high reduction of memory and computational cost, with similar rate-distortion performance as with dense networks. Copyright © 2022, The Authors. All rights reserved.