Defending Against Noise by Characterizing the Rate-Distortion Functions in End-to-End Noisy Image Compression

Author(s):  
Binzhe Li ◽  
Shurun Wang ◽  
Shiqi Wang
2021 ◽  
Vol 13 (3) ◽  
pp. 447
Author(s):  
Vinicius Alves de Oliveira ◽  
Marie Chabert ◽  
Thomas Oberlin ◽  
Charly Poulliat ◽  
Mickael Bruno ◽  
...  

Recently, convolutional neural networks have been successfully applied to lossy image compression. End-to-end optimized autoencoders, possibly variational, are able to dramatically outperform traditional transform coding schemes in terms of rate-distortion trade-off; however, this is at the cost of a higher computational complexity. An intensive training step on huge databases allows autoencoders to learn jointly the image representation and its probability distribution, possibly using a non-parametric density model or a hyperprior auxiliary autoencoder to eliminate the need for prior knowledge. However, in the context of on board satellite compression, time and memory complexities are submitted to strong constraints. The aim of this paper is to design a complexity-reduced variational autoencoder in order to meet these constraints while maintaining the performance. Apart from a network dimension reduction that systematically targets each parameter of the analysis and synthesis transforms, we propose a simplified entropy model that preserves the adaptability to the input image. Indeed, a statistical analysis performed on satellite images shows that the Laplacian distribution fits most features of their representation. A complex non parametric distribution fitting or a cumbersome hyperprior auxiliary autoencoder can thus be replaced by a simple parametric estimation. The proposed complexity-reduced autoencoder outperforms the Consultative Committee for Space Data Systems standard (CCSDS 122.0-B) while maintaining a competitive performance, in terms of rate-distortion trade-off, in comparison with the state-of-the-art learned image compression schemes.


2021 ◽  
Author(s):  
Yang Li ◽  
Shiqi Wang ◽  
Xinfeng Zhang ◽  
Shanshe Wang ◽  
Siwei Ma ◽  
...  

2007 ◽  
Vol 4 (1) ◽  
pp. 169-173
Author(s):  
Baghdad Science Journal

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.


Sign in / Sign up

Export Citation Format

Share Document