DOCSLIB.ORG

DCT Image Codec Using Variance of Sub-Regions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
DCT Image Codec Using Variance of Sub-Regions Open Comput. Sci. 2015; 5:13–21 Research Article Open Access Pooneh Bagheri Zadeh*, Akbar Sheikh Akbari, and Tom Buggy DCT image codec using variance of sub-regions DOI 10.1515/comp-2015-0003 1 Introduction Received May 20, 2011; accepted July 21, 2015 Abstract: This paper presents a novel variance of sub- With advances in multimedia technologies and internet regions and discrete cosine transform based image-coding applications, demand for transmission and storage of vo- scheme. The proposed encoder divides the input image luminous amounts of multimedia data have dramatically into a number of non-overlapping blocks. The coecients increased. Over the past two decades much eort has been in each block are then transformed into their spatial fre- invested in developing ecient image compression tech- quencies using a discrete cosine transform. Coecients niques and has led to the development of many image with the same spatial frequency index at dierent blocks compression algorithms¹ [1, 2]. In recent years wavelet are put together generating a number of matrices, where based image coding schemes have achieved impressive each matrix contains coecients of a particular spatial success, mainly due to the novel approaches taken by frequency index. The matrix containing DC coecients is these schemes in data organization and representation losslessly coded to preserve its visually important infor- of wavelet-transformed coecients [1, 2]. Wavelet based mation. Matrices containing high frequency coecients methods oer very high compression eciency in terms are coded using a variance of sub-regions based encod- of PSNR. However, the high compression eciency in the ing algorithm proposed in this paper. Perceptual weights rate/distortion sense does not necessarily correspond to a are used to regulate the threshold value required in the similar degree of compression eciency in terms of visual coding process of the high frequency matrices. An exten- quality versus bitrates [3, 4]. Grgic et al. [5] has shown that sion of the system to the progressive image transmission Discrete Cosine Transform (DCT) produces slightly better is also developed. The proposed coding scheme, JPEG and results than wavelets especially at low compression ra- JPEG2000 were applied to a number of test images. Results tios while its computational complexity is less expensive show that the proposed coding scheme outperforms JPEG than that of wavelets. A comparative study on wavelets and JPEG2000 subjectively and objectively at low compres- and DCT, reported by Xiong et al. [6], shows that the sion ratios. Results also indicate that the proposed codec main factors to distinguish image compression schemes decoded images exhibit superior subjective quality at high are the way the transformed coecients are re-arranged, compression ratios compared to that of JPEG, while oer- quantized and coded rather than the dierence between ing satisfactory results to that of JPEG2000. the transforms used. Although wavelets appear to provide more exible space-frequency resolution tradeos than Keywords: discrete cosine transform; image compression; DCT, the latter has been successfully employed as the rst perceptual weights; quad-tree coding; variance of sub- step in several coding algorithms such as: JPEG¹, MEPG² regions and H.26x³ because of its compression capabilities and processing speeds. JPEG, the rst image compression standard¹, divides an image into blocks of 8x8. The resulting blocks are then decorrelated using a DCT. The transformed coecients are *Corresponding Author: Pooneh Bagheri Zadeh: Bagheri Zadeh School of Computer Science and Informatics, De Montfort Univer- sity, U.K., Email: [email protected] 1 Information Technology-JPEG-Digital Compression and Coding Akbar Sheikh Akbari: School of Computing, Creative Tech- of Continuous-Cone Still Image-Part 1: Req. and Guidelines, 1994. nology and Engineering, Faculty of Arts, Environment and ISO/IEC 10918-1 and ITU-T Recom. T.81. Technology, Leeds Beckett University, U.K., Email: a.sheikh- 2 ISO/IEC JTC1/SC29/WG11. MPEG-4 Overview, available from [email protected] http://mpeg.telecomitalialab.com/standards/mpeg-4/mpeg- Tom Buggy: Division of Communication, Network and Electronic 4.htm#E25E3, March 2001. Engineering, School of Engineering & Computing, Glasgow Caledo- 3 ITU-T Recommendation H.263, Video codec for Low bit rate commu- nian University, 70 Cowcaddens Road, Glasgow G4 0BA, UK E-mail: nication, Version 1, November 1995; Version 2, January 1998, Version [email protected] 3, November 2000. © 2015 P.B. Zadeh et al., licensee De Gruyter Open. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License. The article is published with open access at www.degruyter.com. 14 Ë P.B. Zadeh et al. zigzag scanned, quantized and human coded. JPEG pro- frequency index at dierent DCT blocks are grouped to- vides good compression ratios, particularly when dealing gether to make a number of matrices. The matrix contain- with natural images. However, the decoded image using ing the DC coecients is losslessly coded. The matrices JPEG suers from blocking artifacts especially in smooth containing high frequency coecients are coded using a regions, and the Gibbs phenomenon, which causes rip- novel variance of sub-regions based encoding algorithm. ples or oscillations around sharp edges at high compres- The proposed encoder applies a hierarchical estimation sion ratios [7]. Recent DCT-based encoders with novel ap- algorithm to code the coecients in each matrix. The hi- proaches to data organization and representation of DCT erarchical estimation algorithm assumes that the distri- coecients have obtained higher compression eciency butions of the coecients in the matrices are Gaussian compared to JPEG [4, 8, 9]. A DCT-based embedded im- in some regions. A threshold on the variance of the coef- age coding (EZDCT) algorithm was proposed by Xiong cients is used to determine if it is possible to estimate et al. [8], which like JPEG, divides an image into blocks the coecients in the input matrix with a single Gaus- of 8x8 and performs DCT on each block. Each resulting sian distribution or if it needs further dividing into four DCT block is viewed as wavelet decomposition with a uni- sub-blocks. This hierarchal algorithm is repeated until the form 8x8 subband decomposition. The DCT coecients distribution of the coecients in all sub-blocks fulls the are then rearranged into a 3-level wavelet pyramidal struc- above criteria. Finally, the mean value of the Gaussian dis- ture and the re-arranged coecients are coded using em- tribution of each block is taken as an estimation value for bedded zerotree coding scheme. Another DCT-based im- all coecients in that block. During the encoding process age codec that uses the morphological representation of a quadtree-like binary map is generated to save a record DCT coecients (MRDCT) was presented by Debin et al. of the hierarchical operation, which is used in decoding [4]. It re-arranges DCT coecients like the EZDCT and then process. The application of the codec to progressive im- uses a morphological dilation to represent the re-arranged age transmission is also investigated. The rest of the pa- DCT coecients. An Embedded Quadtree DCT based im- per is organized as follows: in Section 2 the proposed cod- age compression scheme (EQDCT) was suggested by Xing- ing scheme is discussed; Section 3 explains the progressive Song et al. [9]. It re-arranges the DCT coecients in a simi- mode of operation. Section 4 presents comparative exper- lar manner to the EZDCT scheme and then uses an adaptive imental results; nally Section 5 concludes the paper. quadtree splitting algorithm, which is similar to the quad tree coding strategy of EZBC in wavelet domain, to code the signicant DCT coecients. They reported superior perfor- 2 Variance of sub-regions and DCT mance to that of EZDCT, MRDCT and JPEG at high compres- sion ratios. based image encoder Variance of the image data have been used in a num- ber of image compression techniques and oers promis- A block diagram of the Variance of Sub-regions and Dis- ing visual quality especially at high compression ratios crete Cosine Transform (VSDCT) based image encoder is [10, 11], while the application of variance of the trans- illustrated in Figure 1. A gray scale image is input to the formed image data in image compression has been less re- encoder. The encoder divides the input image into a num- ported in the literature. In progressive image transmission, ber of 8x8 non-overlapping pixel blocks called B11 to Bnn an image is transmitted in two or more stages. A coarse but as shown in Figure 1(a). The coecients in each block are recognizable image with basic quality is rst transmitted then transformed into the frequency domain using a dis- to the receiver. The transmission of further details is made crete cosine transform as shown in Figure 1 (b) where A0−ij at the later stages upon the request of the viewer. Some im- to A63−ij are DCT transformed coecients in the Bij block. age coding schemes, e.g. JPEG, JPEG2000, SPIHT and EZW, The transformed coecients with the same frequency in- are very suitable for progressive image transmission due dex at dierent blocks are then grouped together generat- to the good energy compaction properties of their trans- ing 64 matrices called M0 to M63, where M0 contains the forms, i.e. Wavelets and DCT [12]. DC coecients and M1 to M63 contain the AC coecients In this paper, a novel Variance of Sub-regions and DCT from the lowest to the highest frequency, respectively. (VSDCT) based image-coding scheme is presented. The Figure 1(c) shows one of these matrices (Mk), where proposed coding scheme divides the input image into a Ak−11 to Ak−nn in this matrix represent coecients with the number of non-overlapping blocks.
Load more

Recommended publications
  • Data Compression: Dictionary-Based Coding 2 / 37 Dictionary-Based Coding Dictionary-Based Coding
    Dictionary-based Coding already coded not yet coded search buffer look-ahead buffer cursor (N symbols) (L symbols) We know the past but cannot control it. We control the future but... Last Lecture Last Lecture: Predictive Lossless Coding Predictive Lossless Coding Simple and effective way to exploit dependencies between neighboring symbols / samples Optimal predictor: Conditional mean (requires storage of large tables) Affine and Linear Prediction Simple structure, low-complex implementation possible Optimal prediction parameters are given by solution of Yule-Walker equations Works very well for real signals (e.g., audio, images, ...) Efficient Lossless Coding for Real-World Signals Affine/linear prediction (often: block-adaptive choice of prediction parameters) Entropy coding of prediction errors (e.g., arithmetic coding) Using marginal pmf often already yields good results Can be improved by using conditional pmfs (with simple conditions) Heiko Schwarz (Freie Universität Berlin) — Data Compression: Dictionary-based Coding 2 / 37 Dictionary-based Coding Dictionary-Based Coding Coding of Text Files Very high amount of dependencies Affine prediction does not work (requires linear dependencies) Higher-order conditional coding should work well, but is way to complex (memory) Alternative: Do not code single characters, but words or phrases Example: English Texts Oxford English Dictionary lists less than 230 000 words (including obsolete words) On average, a word contains about 6 characters Average codeword length per character would be limited by 1
    [Show full text]
  • Video Codec Requirements and Evaluation Methodology
    Video Codec Requirements 47pt 30pt and Evaluation Methodology Color::white : LT Medium Font to be used by customers and : Arial www.huawei.com draft-filippov-netvc-requirements-01 Alexey Filippov, Huawei Technologies 35pt Contents Font to be used by customers and partners : • An overview of applications • Requirements 18pt • Evaluation methodology Font to be used by customers • Conclusions and partners : Slide 2 Page 2 35pt Applications Font to be used by customers and partners : • Internet Protocol Television (IPTV) • Video conferencing 18pt • Video sharing Font to be used by customers • Screencasting and partners : • Game streaming • Video monitoring / surveillance Slide 3 35pt Internet Protocol Television (IPTV) Font to be used by customers and partners : • Basic requirements: . Random access to pictures 18pt Random Access Period (RAP) should be kept small enough (approximately, 1-15 seconds); Font to be used by customers . Temporal (frame-rate) scalability; and partners : . Error robustness • Optional requirements: . resolution and quality (SNR) scalability Slide 4 35pt Internet Protocol Television (IPTV) Font to be used by customers and partners : Resolution Frame-rate, fps Picture access mode 2160p (4K),3840x2160 60 RA 18pt 1080p, 1920x1080 24, 50, 60 RA 1080i, 1920x1080 30 (60 fields per second) RA Font to be used by customers and partners : 720p, 1280x720 50, 60 RA 576p (EDTV), 720x576 25, 50 RA 576i (SDTV), 720x576 25, 30 RA 480p (EDTV), 720x480 50, 60 RA 480i (SDTV), 720x480 25, 30 RA Slide 5 35pt Video conferencing Font to be used by customers and partners : • Basic requirements: . Delay should be kept as low as possible 18pt The preferable and maximum delay values should be less than 100 ms and 350 ms, respectively Font to be used by customers .
    [Show full text]
  • (A/V Codecs) REDCODE RAW (.R3D) ARRIRAW
    What is a Codec? Codec is a portmanteau of either "Compressor-Decompressor" or "Coder-Decoder," which describes a device or program capable of performing transformations on a data stream or signal. Codecs encode a stream or signal for transmission, storage or encryption and decode it for viewing or editing. Codecs are often used in videoconferencing and streaming media solutions. A video codec converts analog video signals from a video camera into digital signals for transmission. It then converts the digital signals back to analog for display. An audio codec converts analog audio signals from a microphone into digital signals for transmission. It then converts the digital signals back to analog for playing. The raw encoded form of audio and video data is often called essence, to distinguish it from the metadata information that together make up the information content of the stream and any "wrapper" data that is then added to aid access to or improve the robustness of the stream. Most codecs are lossy, in order to get a reasonably small file size. There are lossless codecs as well, but for most purposes the almost imperceptible increase in quality is not worth the considerable increase in data size. The main exception is if the data will undergo more processing in the future, in which case the repeated lossy encoding would damage the eventual quality too much. Many multimedia data streams need to contain both audio and video data, and often some form of metadata that permits synchronization of the audio and video. Each of these three streams may be handled by different programs, processes, or hardware; but for the multimedia data stream to be useful in stored or transmitted form, they must be encapsulated together in a container format.
    [Show full text]
  • Image Compression Using Discrete Cosine Transform Method
    Qusay Kanaan Kadhim, International Journal of Computer Science and Mobile Computing, Vol.5 Issue.9, September- 2016, pg. 186-192 Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IMPACT FACTOR: 5.258 IJCSMC, Vol. 5, Issue. 9, September 2016, pg.186 – 192 Image Compression Using Discrete Cosine Transform Method Qusay Kanaan Kadhim Al-Yarmook University College / Computer Science Department, Iraq [email protected] ABSTRACT: The processing of digital images took a wide importance in the knowledge field in the last decades ago due to the rapid development in the communication techniques and the need to find and develop methods assist in enhancing and exploiting the image information. The field of digital images compression becomes an important field of digital images processing fields due to the need to exploit the available storage space as much as possible and reduce the time required to transmit the image. Baseline JPEG Standard technique is used in compression of images with 8-bit color depth. Basically, this scheme consists of seven operations which are the sampling, the partitioning, the transform, the quantization, the entropy coding and Huffman coding. First, the sampling process is used to reduce the size of the image and the number bits required to represent it. Next, the partitioning process is applied to the image to get (8×8) image block. Then, the discrete cosine transform is used to transform the image block data from spatial domain to frequency domain to make the data easy to process.
    [Show full text]
  • MC14SM5567 PCM Codec-Filter
    Product Preview Freescale Semiconductor, Inc. MC14SM5567/D Rev. 0, 4/2002 MC14SM5567 PCM Codec-Filter The MC14SM5567 is a per channel PCM Codec-Filter, designed to operate in both synchronous and asynchronous applications. This device 20 performs the voice digitization and reconstruction as well as the band 1 limiting and smoothing required for (A-Law) PCM systems. DW SUFFIX This device has an input operational amplifier whose output is the input SOG PACKAGE CASE 751D to the encoder section. The encoder section immediately low-pass filters the analog signal with an RC filter to eliminate very-high-frequency noise from being modulated down to the pass band by the switched capacitor filter. From the active R-C filter, the analog signal is converted to a differential signal. From this point, all analog signal processing is done differentially. This allows processing of an analog signal that is twice the amplitude allowed by a single-ended design, which reduces the significance of noise to both the inverted and non-inverted signal paths. Another advantage of this differential design is that noise injected via the power supplies is a common mode signal that is cancelled when the inverted and non-inverted signals are recombined. This dramatically improves the power supply rejection ratio. After the differential converter, a differential switched capacitor filter band passes the analog signal from 200 Hz to 3400 Hz before the signal is digitized by the differential compressing A/D converter. The decoder accepts PCM data and expands it using a differential D/A converter. The output of the D/A is low-pass filtered at 3400 Hz and sinX/X compensated by a differential switched capacitor filter.
    [Show full text]
  • Lossless Compression of Audio Data
    CHAPTER 12 Lossless Compression of Audio Data ROBERT C. MAHER OVERVIEW Lossless data compression of digital audio signals is useful when it is necessary to minimize the storage space or transmission bandwidth of audio data while still maintaining archival quality. Available techniques for lossless audio compression, or lossless audio packing, generally employ an adaptive waveform predictor with a variable-rate entropy coding of the residual, such as Huffman or Golomb-Rice coding. The amount of data compression can vary considerably from one audio waveform to another, but ratios of less than 3 are typical. Several freeware, shareware, and proprietary commercial lossless audio packing programs are available. 12.1 INTRODUCTION The Internet is increasingly being used as a means to deliver audio content to end-users for en­ tertainment, education, and commerce. It is clearly advantageous to minimize the time required to download an audio data file and the storage capacity required to hold it. Moreover, the expec­ tations of end-users with regard to signal quality, number of audio channels, meta-data such as song lyrics, and similar additional features provide incentives to compress the audio data. 12.1.1 Background In the past decade there have been significant breakthroughs in audio data compression using lossy perceptual coding [1]. These techniques lower the bit rate required to represent the signal by establishing perceptual error criteria, meaning that a model of human hearing perception is Copyright 2003. Elsevier Science (USA). 255 AU rights reserved. 256 PART III / APPLICATIONS used to guide the elimination of excess bits that can be either reconstructed (redundancy in the signal) orignored (inaudible components in the signal).
    [Show full text]
  • The H.264 Advanced Video Coding (AVC) Standard
    Whitepaper: The H.264 Advanced Video Coding (AVC) Standard What It Means to Web Camera Performance Introduction A new generation of webcams is hitting the market that makes video conferencing a more lifelike experience for users, thanks to adoption of the breakthrough H.264 standard. This white paper explains some of the key benefits of H.264 encoding and why cameras with this technology should be on the shopping list of every business. The Need for Compression Today, Internet connection rates average in the range of a few megabits per second. While VGA video requires 147 megabits per second (Mbps) of data, full high definition (HD) 1080p video requires almost one gigabit per second of data, as illustrated in Table 1. Table 1. Display Resolution Format Comparison Format Horizontal Pixels Vertical Lines Pixels Megabits per second (Mbps) QVGA 320 240 76,800 37 VGA 640 480 307,200 147 720p 1280 720 921,600 442 1080p 1920 1080 2,073,600 995 Video Compression Techniques Digital video streams, especially at high definition (HD) resolution, represent huge amounts of data. In order to achieve real-time HD resolution over typical Internet connection bandwidths, video compression is required. The amount of compression required to transmit 1080p video over a three megabits per second link is 332:1! Video compression techniques use mathematical algorithms to reduce the amount of data needed to transmit or store video. Lossless Compression Lossless compression changes how data is stored without resulting in any loss of information. Zip files are losslessly compressed so that when they are unzipped, the original files are recovered.
    [Show full text]
  • Mutual Information, the Linear Prediction Model, and CELP Voice Codecs
    information Article Mutual Information, the Linear Prediction Model, and CELP Voice Codecs Jerry Gibson Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106, USA; [email protected]; Tel.: +1-805-893-6187 Received: 14 April 2019; Accepted: 19 May 2019; Published: 22 May 2019 Abstract: We write the mutual information between an input speech utterance and its reconstruction by a code-excited linear prediction (CELP) codec in terms of the mutual information between the input speech and the contributions due to the short-term predictor, the adaptive codebook, and the fixed codebook. We then show that a recently introduced quantity, the log ratio of entropy powers, can be used to estimate these mutual informations in terms of bits/sample. A key result is that for many common distributions and for Gaussian autoregressive processes, the entropy powers in the ratio can be replaced by the corresponding minimum mean squared errors. We provide examples of estimating CELP codec performance using the new results and compare these to the performance of the adaptive multirate (AMR) codec and other CELP codecs. Similar to rate distortion theory, this method only needs the input source model and the appropriate distortion measure. Keywords: autoregressive models; entropy power; linear prediction model; CELP voice codecs; mutual information 1. Introduction Voice coding is a critical technology for digital cellular communications, voice over Internet protocol (VoIP), voice response applications, and videoconferencing systems [1,2]. Code-excited linear prediction (CELP) is the most widely deployed method for speech coding today, serving as the primary speech coding method in the adaptive multirate (AMR) codec [3] and in the more recent enhanced voice services (EVS) codec [4], both of which are used in cell phones and VoIP.
    [Show full text]
  • Acronis Revive 2019
    Acronis Revive 2019 Table of contents 1 Introduction to Acronis Revive 2019 .................................................................................3 1.1 Acronis Revive 2019 Features .................................................................................................... 3 1.2 System Requirements and Installation Notes ........................................................................... 4 1.3 Technical Support ...................................................................................................................... 5 2 Data Recovery Using Acronis Revive 2019 .........................................................................6 2.1 Recover Lost Files from Existing Logical Disks ........................................................................... 7 2.1.1 Searching for a File ........................................................................................................................................ 16 2.1.2 Finding Previous File Versions ...................................................................................................................... 18 2.1.3 File Masks....................................................................................................................................................... 19 2.1.4 Regular Expressions ...................................................................................................................................... 20 2.1.5 Previewing Files ............................................................................................................................................
    [Show full text]
  • The Aim Codec for Windows and OSX
    The AiM Codec for Windows and OSX The Avolites Ai server plays QuickTime movies, but it uses its own special codec called AiM. The AiM codec is not installed with QuickTime by default, but is free to download from the Avolites website for both Windows and Mac. On this same page you will also find download links for the latest Ai Server software and manual. After registering on the Avolites website, you can access these files here: https://www.avolites.com/software/ai-downloads If using Windows, a dedicated installer can be downloaded from the website. This will manually install the Adobe plugin and the QuickTime component. However a download package exists as a zip file. This contains versions for both PC (Windows) and Mac (OSX). Once downloaded, you need to unzip the package and then place the correct version of the codec for your operating system in to the appropriate folder on your computer. Adobe AiM Installer As of April 2018, Adobe have removed support for many Quicktime Codecs – this means that as is, modern versions of Adobe products cannot export AiM encoded video. For this reason, we have created a set of plugins for Adobe products which run on both Windows and OSX and allow AiM based media to be both Imported and Exported with Premiere, After Effects and Media Encoder. Note: The plugins are built for 64 bit version of the Adobe products, which means that you need to be running CS6 or later versions of the relevant Adobe software. The installer can also be found in the downloads section of the Avolites website: https://www.avolites.com/software/ai-downloads PC (Windows) Installer For the PC there is a dedicated AiM installer.
    [Show full text]
  • Image Compression with Encoder-Decoder Matched Semantic Segmentation
    Image Compression with Encoder-Decoder Matched Semantic Segmentation Trinh Man Hoang1, Jinjia Zhou1,2, and Yibo Fan3 1Graduate School of Science and Engineering, Hosei University, Tokyo, Japan 2JST, PRESTO, Tokyo, Japan 3Fudan University, Shanghai, China Abstract Recently, thanks to the rapid evolution of the semantic seg- mentation technique, several techniques have achieved high In recent years, the layered image compression is performance whose results can be used in other tasks[16]. demonstrated to be a promising direction, which encodes The state-of-the-art semantic-based image compression a compact representation of the input image and apply an framework – DSSLIC[4] sent the down-sampled image and up-sampling network to reconstruct the image. To fur- the semantic segment to the decoder. DSSILC then up- ther improve the quality of the reconstructed image, some sampled the compact image and used the GAN-based[7] works transmit the semantic segment together with the com- image synthesis technique[14] to reconstruct the image us- pressed image data. Consequently, the compression ratio is ing the sending semantic segment and the up-sampled ver- also decreased because extra bits are required for trans- sion. With the help of the semantic segment, DSSLIC could mitting the semantic segment. To solve this problem, we reconstruct better image quality than all the existed tradi- propose a new layered image compression framework with tional image compression methods. However, DSSLIC re- encoder-decoder matched semantic segmentation (EDMS). quires the encoder to send extra bits of the semantic seg- And then, followed by the semantic segmentation, a special ment extracted from the original image to the decoder under convolution neural network is used to enhance the inaccu- a lossless compression.
    [Show full text]
  • SANDWICHED IMAGE COMPRESSION: WRAPPING NEURAL NETWORKS AROUND a STANDARD CODEC Onur G. Guleryuz, Philip A. Chou, Hugues Hoppe, D
    SANDWICHED IMAGE COMPRESSION: WRAPPING NEURAL NETWORKS AROUND A STANDARD CODEC Onur G. Guleryuz, Philip A. Chou, Hugues Hoppe, Danhang Tang, Ruofei Du, Philip Davidson, Sean Fanello Google Research foguleryuz, philchou, hopp, danhangtang, ruofei, pdavidson, [email protected] ABSTRACT We sandwich a standard image codec between two neural net- works: a preprocessor that outputs neural codes, and a post- processor that reconstructs the image. The neural codes are compressed as ordinary images by the standard codec. Us- ing differentiable proxies for both rate and distortion, we de- velop a rate-distortion optimization framework that trains the networks to generate neural codes that are efficiently com- (a) Original source image −! (b) Neural code “bottleneck” image pressible as images. This architecture not only improves rate- distortion performance for ordinary RGB images, but also en- ables efficient compression of alternative image types (such as normal maps of computer graphics) using standard image codecs. Results demonstrate the effectiveness and flexibil- ity of neural processing in mapping a variety of input data modalities to the rigid structure of standard codecs. A sur- prising result is that the rate-distortion-optimized neural pro- (d) Reconstructed source − (c) Reconstructed “bottleneck” image cessing seamlessly learns to transport color images using a single-channel (grayscale) codec. Fig. 1: Even with a simple codec (here, grayscale JPEG 4:0:0), a Index Terms— deep learning, image compression neural sandwich architecture can accomplish unconventional results. Whereas 4:0:0 usually just stores luminance, the neural preprocessor is able to encode a full RGB image into a single-channel bottleneck. 1. INTRODUCTION The neural code image has low-frequency dither-like patterns that modulate color information yet also survive JPEG compression.
    [Show full text]