High-Quality Image Compression Algorithm Design Based on Unsupervised Learning

被引:1
作者
Han, Shuo [1 ]
Mo, Bo [1 ]
Zhao, Jie [1 ]
Xu, Junwei [1 ]
Sun, Shizun [1 ]
Jin, Bo [2 ]
机构
[1] Beijing Inst Technol, Sch Aerosp Engn, Beijing 100081, Peoples R China
[2] Chongqing Changan Wang Jiang Ind Grp Co Ltd, Chongqing 400023, Peoples R China
关键词
high-quality image compression; content-weighted autoencoder; compression ratio; multi-scale discriminator; unsupervised learning;
D O I
10.3390/s24206503
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Increasingly massive image data is restricted by conditions such as information transmission and reconstruction, and it is increasingly difficult to meet the requirements of speed and integrity in the information age. To solve the urgent problems faced by massive image data in information transmission, this paper proposes a high-quality image compression algorithm based on unsupervised learning. Among them, a content-weighted autoencoder network is proposed to achieve image compression coding on the basis of a smaller bit rate to solve the entropy rate optimization problem. Binary quantizers are used for coding quantization, and importance maps are used to achieve better bit allocation. The compression rate is further controlled and optimized. A multi-scale discriminator suitable for the generative adversarial network image compression framework is designed to solve the problem that the generated compressed image is prone to blurring and distortion. Finally, through training with different weights, the distortion of each scale is minimized, so that the image compression can achieve a higher quality compression and reconstruction effect. The experimental results show that the algorithm model can save the details of the image and greatly compress the memory of the image. Its advantage is that it can expand and compress a large number of images quickly and efficiently and realize the efficient processing of image compression.
引用
收藏
页数:19
相关论文
共 43 条
[1]   Digital image and video watermarking: methodologies, attacks, applications, and future directions [J].
Aberna, P. ;
Agilandeeswari, L. .
MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 83 (2) :5531-5591
[2]   A Fast and Accurate Prediction of Distortions in DCT-Based Lossy Image Compression [J].
Abramova, Victoriya ;
Lukin, Vladimir ;
Abramov, Sergey ;
Kryvenko, Sergii ;
Lech, Piotr ;
Okarma, Krzysztof .
ELECTRONICS, 2023, 12 (11)
[3]   Multi-Realism Image Compression with a Conditional Generator [J].
Agustsson, Eirikur ;
Minnen, David ;
Toderici, George ;
Mentzer, Fabian .
2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, :22324-22333
[4]   Frei-Chen bases based lossy digital image compression technique [J].
Al-khassaweneh, Mahmood ;
AlShorman, Omar .
APPLIED COMPUTING AND INFORMATICS, 2024, 20 (1/2) :105-118
[5]   Generative Adversarial Network-Based Data Augmentation for Enhancing Wireless Physical Layer Authentication [J].
Alhoraibi, Lamia ;
Alghazzawi, Daniyal ;
Alhebshi, Reemah .
SENSORS, 2024, 24 (02)
[6]   Lossless and Near-Lossless Compression Algorithms for Remotely Sensed Hyperspectral Images [J].
Altamimi, Amal ;
Ben Youssef, Belgacem .
ENTROPY, 2024, 26 (04)
[7]   Deep Lossy Plus Residual Coding for Lossless and Near-Lossless Image Compression [J].
Bai, Yuanchao ;
Liu, Xianming ;
Wang, Kai ;
Ji, Xiangyang ;
Wu, Xiaolin ;
Gao, Wen .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2024, 46 (05) :3577-3594
[8]  
Balakumar P., 2023, P 2023 INT C EM RES, P1
[9]   Design Tradeoffs in CXL-Based Memory Pools for Public Cloud Platforms [J].
Berger, Daniel. S. S. ;
Ernst, Daniel ;
Li, Huaicheng ;
Zardoshti, Pantea ;
Shah, Monish ;
Rajadnya, Samir ;
Lee, Scott ;
Hsu, Lisa ;
Agarwal, Ishwar ;
Hill, Mark. D. D. ;
Bianchini, Ricardo .
IEEE MICRO, 2023, 43 (02) :30-38
[10]   Segmentation-Less Extraction of Text and Non-Text Regions From JPEG 2000 Compressed Document Images Through Partial and Intelligent Decompression [J].
Bisen, Tejasvee ;
Javed, Mohammed ;
Nagabhushan, P. ;
Watanabe, Osamu .
IEEE ACCESS, 2023, 11 :20673-20687