Image Compression去除多余数据·以数学的观点来看,这一过程实际上就是将二维像素阵列变换为一个在统计上无关联的数据集合。图像压缩是指以较少的比特有损或无损地表示原来的像素矩阵的技术,也称图像编码
We proposed a new variable-rate image compression framework, by applying generalized octave convolutions and generalized octave transposed-convolutions layers and incorporating the octave-based shortcut connections
Cited by0BibtexViews4Links
0
0
Block partition brings the possibility of acceleration, contextual prediction module effectively utilizes the correlation between blocks to improve coding efficiency, and boundary-aware post-processing module takes into account block effect to improve subjective and objective qua...
Cited by0BibtexViews8Links
0
0
Lahiru D. Chamain, Fabien Racapé, Jean Bégaint, Akshay Pushparaja, Simon Feltman
This paper detailed an end-to-end framework enabling efficient image compression for remote machine task analysis, using a chain composed of a compression module and a task algorithm that can be optimized end-to-end
Cited by0BibtexViews1Links
0
0
CVPR, (2019): 10629-10638
We proposed and evaluated a fully parallel hierarchical probabilistic model with auxiliary feature representations
Cited by18BibtexViews45Links
0
0
ICLR, (2018)
We describe an end-to-end trainable model for image compression based on variational autoencoders. The model incorporates a hyperprior to effectively capture spatial dependencies in the latent representation. This hyperprior relates to side information, a concept universal to vir...
Cited by188BibtexViews104Links
0
0
CVPR, (2018)
A convolutional network-based system is developed for content weighted image compression
Cited by163BibtexViews60Links
0
0
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), (2018)
We showed in Figure 2 that a Gaussian mixture model-based entropy model provides a net benefit and outperforms the simpler Gaussian scale mixture-based model in terms of rate–distortion performance without increasing the asymptotic complexity of the model
Cited by157BibtexViews60Links
0
0
CVPR, (2018): 4394-4402
We focus on the latter challenge and propose a new technique to navigate the ratedistortion trade-off for an image compression auto-encoder
Cited by138BibtexViews28Links
0
0
International Conference on Computer Vision, (2018): 221-231
We demonstrated that constraining the application domain to street scene images leads to additional storage savings, and explored selectively combining fully synthesized image contents with preserved ones when semantic label maps are available
Cited by129BibtexViews72Links
0
0
ICLR, (2017)
Hardware chips optimized for convolutional neural networks are likely to be widely available soon, given that these networks are key to good performance in so many applications
Cited by405BibtexViews88Links
0
0
computer vision and pattern recognition, (2017)
We presented a general architecture for compressing with recurrent neural network, content-based residual scaling, and a new variation of Gated Recurrent Unit [3], which provided the highest Peak Signal to Noise Ratio-HVS out of the models trained on the high entropy dataset
Cited by392BibtexViews114Links
0
0
international conference on learning representations, (2017)
We have presented a complete image compression method based on nonlinear transform coding, and a framework to optimize it end-to-end for rate–distortion performance
Cited by352BibtexViews35Links
0
0
ICML, (2017): 2922-2930
We present a machine learning-based approach to lossy image compression which outperforms all existing codecs, while running in real-time. Our algorithm typically produces files 2.5 times smaller than JPEG and JPEG 2000, 2 times smaller than WebP, and 1.7 times smaller than BPG o...
Cited by217BibtexViews32Links
0
0
international conference on learning representations, (2016)
We propose a general framework for variable-rate image compression and a novel architecture based on convolutional and deconvolutional Long short-term memory recurrent networks
Cited by270BibtexViews101Links
0
0
CoRR, (2014)
The last step is combined of decoding the zigzag order and recreating the 8 x 8 blocks.The inverse discrete cosine transform(IDCT) takes each value in the spatial domain and examines the contributions that each of the 64 frequency values make to that pixel.
Cited by2BibtexViews0Links
0
0
CoRR, (2013)
This paper demonstrates the potential of the five module method based image compression techniques
Cited by7BibtexViews1Links
0
0
Signal & Image Processing : An International Journal, no. 5 (2012): 19-28
Data is compressed by reducing its redundancy, but this also makes the data less reliable, more prone to errors. In this paper a novel approach of image compression based on a new method that has been created for image compression which is called Five Modulus Method (FMM). The ...
Cited by7BibtexViews0Links
0
0
Signal Processing Letters, IEEE, no. 10 (2011): 579-582
The reconstructed images have better quality and less blocking artifacts when compared to the BAS-2008 algorithm. This correspondence introduced an approximation algorithm for the discrete cosine transform computation based on matrix polar decomposition
Cited by31BibtexViews6Links
0
0
(2010)
The rapid increase in the range and use of electronic imaging justifies attention for systematic design of an image compression system and for providing the image quality needed in different applications
Cited by78BibtexViews2Links
0
0
IEEE Geosci. Remote Sensing Lett., no. 2 (2007): 201-205
We investigate the performance of principal component analysis for spectral decorrelation in conjunction with JPEG2000 coding
Cited by337BibtexViews2Links
0
0
Keywords
Data CompressionImage CompressionImage CodingTransform CodingWavelet TransformsComputational ComplexityWavelet TransformCompression RatioCompression RatiosDecorrelation
Authors
David Minnen
Paper 4
Johannes Ballé
Paper 3
Radu Timofte
Paper 3
Michael Tschannen
Paper 3
Sung Jin Hwang
Paper 3
George Toderici
Paper 3
Eirikur Agustsson
Paper 3
Luc Van Gool
Paper 3
 Fabian Mentzer
Paper 3
Michele Covell
Paper 2