A Survey of Energy-Efficient Compression and Communication Techniques for Multimedia in Resource Constrained Systems
---
paper_title: Energy aware lossless data compression

paper_content:

Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to reduce the number of bits transmitted. If the energy required to compress data is less than the energy required to send it, there is a net energy savings and consequently, a longer battery life for portable computers. This paper reports on the energy of lossless data compressors as measured on a StrongARM SA-110 system. We show that with several typical compression tools, there is a net energy increase when compression is applied before transmission. Reasons for this increase are explained, and hardware-aware programming optimizations are demonstrated. When applied to Unix compress, these optimizations improve energy efficiency by 51%. We also explore the fact that, for many usage models, compression and decompression need not be performed by the same algorithm. By choosing the lowest-energy compressor and decompressor on the test platform, rather than using default levels of compression, overall energy to send compressible web data can be reduced 31%. Energy to send harder-to-compress English text can be reduced 57%. Compared with a system using a single optimized application for both compression and decompression, the asymmetric scheme saves 11% or 12% of the total energy depending on the dataset.
---
paper_title: Energy-Efficient Image Compression for Resource-Constrained Platforms

paper_content:

One of the most important goals of current and future sensor networks is energy-efficient communication of images. This paper presents a quantitative comparison between the energy costs associated with 1) direct transmission of uncompressed images and 2) sensor platform-based JPEG compression followed by transmission of the compressed image data. JPEG compression computations are mapped onto various resource-constrained platforms using a design environment that allows computation using the minimum integer and fractional bit-widths needed in view of other approximations inherent in the compression process and choice of image quality parameters. Advanced applications of JPEG, such as region of interest coding and successive/progressive transmission, are also examined. Detailed experimental results examining the tradeoffs in processor resources, processing/transmission time, bandwidth utilization, image quality, and overall energy consumption are presented.
---
paper_title: The JPEG still picture compression standard

paper_content:

For the past few years, a joint ISO/CCITT committee known as JPEG (Joint Photographic Experts Group) has been working to establish the first international compression standard for continuous-tone still images, both grayscale and color. JPEG’s proposed standard aims to be generic, to support a wide variety of applications for continuous-tone images. To meet the differing needs of many applications, the JPEG standard includes two basic compression methods, each with various modes of operation. A DCT-based method is specified for “lossy’’ compression, and a predictive method for “lossless’’ compression. JPEG features a simple lossy technique known as the Baseline method, a subset of the other DCT-based modes of operation. The Baseline method has been by far the most widely implemented JPEG method to date, and is sufficient in its own right for a large number of applications. This article provides an overview of the JPEG standard, and focuses in detail on the Baseline method.
---
paper_title: The Lifting Scheme: A Custom-Design Construction of Biorthogonal Wavelets

paper_content:

Abstract We present the lifting scheme, a new idea for constructing compactly supported wavelets with compactly supported duals. The lifting scheme uses a simple relationship between all multiresolution analyses with the same scaling function. It isolates the degrees of freedom remaining after fixing the biorthogonality relations. Then one has full control over these degrees of freedom to custom design the wavelet for a particular application. The lifting scheme can also speed up the fast wavelet transform. We illustrate the use of the lifting scheme in the construction of wavelets with interpolating scaling functions.
---
paper_title: Survey of image compression algorithms in wireless sensor networks

paper_content:

The implementation of image processing engines in visual sensor nodes has been a major concern in the development of wireless multimedia sensor networks in a hardware constrained environment. In this paper, a review on eight popular image compression algorithms is presented. After conducting a comprehensive evaluation, it is found that Set-Partitioning in Hierarchical Trees (SPIHT) wavelet-based image compression is the most suitable hardware implemented image compression algorithm in wireless sensor networks due to its high compression efficiency and its simplicity in coding procedures.
---
paper_title: An overview of JPEG-2000

paper_content:

JPEG-2000 is an emerging standard for still image compression. This paper provides a brief history of the JPEG-2000 standardization process, an overview of the standard, and some description of the capabilities provided by the standard. Part I of the JPEG-2000 standard specifies the minimum compliant decoder, while Part II describes optional, value-added extensions. Although the standard specifies only the decoder and bitstream syntax, in this paper we describe JPEG-2000 from the point of view of encoding. We take this approach, as we believe it is more amenable to a compact description more easily understood by most readers.
---
paper_title: High performance scalable image compression with EBCOT

paper_content:

A new image compression algorithm is proposed, based on independent embedded block coding with optimized truncation of the embedded bit-streams (EBCOT). The algorithm exhibits state-of-the-art compression performance while producing a bit-stream with a rich feature set, including resolution and SNR scalability together with a random access property. The algorithm has modest complexity and is extremely well suited to applications involving remote browsing of large compressed images. The algorithm lends itself to explicit optimization with respect to MSE as well as more realistic psychovisual metrics, capable of modeling the spatially varying visual masking phenomenon.
---
paper_title: Low-complexity image coder/decoder with an approaching-entropy quad-tree search code for embedded computing platforms

paper_content:

In this paper, we propose a fast, simple and efficient image codec applicable for embedded processing systems. Among the existing image coding methods, wavelet quad-tree is a foundation leading to an efficient structure to encode images. By searching significant coefficients along quadtrees, an embedded efficient code can be obtained. In this work, we exploit hierarchical relations of the quad-tree structure in terms of searching entropy and present a quadtree searching model that is very close to the searching entropy. By applying this model, our codec surpasses SPIHT [1] by 0.2–0.4 db over wide code rates, and its performance is comparable to SPIHT with arithmetic coding and JPEG2000 [2]. With no additional overhead of arithmetic coding, our code is much faster and simpler than SPIHT with adaptive arithmetic coding and the more complicated JPEG2000 algorithms. This is a critical factor sought in embedded processing in communication systems where energy consumption and speed are priority concerns. Our simulation results demonstrate that the proposed codec is about twice as fast with very low computational overheads and comparable coding performances than existing algorithms.
---
paper_title: EBCOT coprocessing architecture for JPEG2000

paper_content:

JPEG2000 is the latest still image coding standard. It was designed to overcome the limitations of the original JPEG standard and provide high quality images at low bit rates. The JPEG2000 algorithm is fundamentally based on the Discrete Wavelet Transform (DWT) and Embedded Block Coding with Optimal Truncation (EBCOT). Both of the algorithms are computationally intenstive and require significant memory bandwidth. In this paper we propose a JPEG2000 hardware/software co-processing architecture that complements existing JPEG2000 software packages with efficient dedicated hardware units for EBCOT tier-1 coding, enabling significant speedup.
---
paper_title: The Lifting Scheme: A Construction Of Second Generation Wavelets

paper_content:

We present the lifting scheme, a simple construction of second generation wavelets; these are wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads to a faster, in-place calculation of the wavelet transform. Several examples are included.
---
paper_title: Improved Listless Zerotree Image Compression Algorithm and Application

paper_content:

The classic SPIHT algorithm need to maintain three lists to store temporarily the image's zerotree structure and significance information, which represents a major drawback for hardware implementation because a large amount of memory is needed to maintain these lists. Besides, there is still some redundancy in the zerotree structure of SPIHT. Memory requirement of the algorithm is reduced significantly in LZC because of the replacement of lists by flag maps, but the performance of codec is also lowered. In this paper, a new listless zerotree image compression algorithm is presented. An improved zerotree structure and a new coding procedure are adopted, which improves the reconstructed image quality. Moreover, the lists in SPIHT are replaced by flag maps and lifting scheme is adopted to realize wavelet transform, which lowers the memory requirements and speeds up the coding process. The matching experiments of reconstructed standard stereo images demonstrate the feasibility and effectiveness of the proposed method.
---
paper_title: Listless zerotree coding for color images

paper_content:

This paper presents a zerotree coding method for color images that uses no lists during encoding and decoding permitting the omission as the lists requirement in Said and Pearlman's (see IEEE Transactions on Circuit and System for Video Technology, vol.6, no.3, p.243-50, 1996) set partitioning in hierarchical trees (SPIHT) algorithm. Without the lists, the memory requirement in a VLSI implementation is reduced significantly. This coding algorithm is also developed to reduce the circuit complexity of an implementation. Our experimental results show only a minor reduction of PSNR values when compared with the PSNR values obtained by the SPIHT codec illustrating well the trade-off between memory requirement and hardware simplicity.
---
paper_title: Listless Zerotree Image Compression Algorithm

paper_content:

A new listless zerotree image compression algorithm is presented. The classic SPIHT algorithm need to maintain three lists to store temporarily the image's zerotree structure and significance information, which represents a major drawback for hardware implementation because a large amount of memory is needed to maintain these lists. Memory requirement of the algorithm is reduced significantly in LZC because of the replacement of lists by flag maps. But the performance of codec is also lowered. Besides, there is still some redundancy in the zerotree structure of SPIHT. In this paper, an improved zerotree structure and a new coding procedure are adopted, which improves the reconstructed image quality. Moreover, the lists in SPIHT are replaced by flag maps and lifting scheme is adopted to realize wavelet transform, which lowers the memory requirements and speeds up the coding process. Experimental results show that the algorithm is more effective and efficient compared to SPIHT
---
paper_title: Energy-efficient wavelet image compression in Wireless Sensor Network

paper_content:

In the recent years, the wireless technology would have known an exponential growth, which has an impact on developing and improving the field of telecommunications beyond the means of transmission wire to the radio frequency communication. The Wireless Sensor Network (WSN) is enrolled in this context. It's a collection of component (nodes) organized into a cooperative network. The main components of this network are tiny battery powered cameras with wireless communication capability. Therefore, image transfer in WSNs presents major challenge which raises issues related to its representation, its storage and its transmission. However, communication of image content has several bottlenecks, including limited bandwidth of cellular networks, restricted computational power, limited storage capability, and battery constraints of the appliances. In this paper, we address the energy, system lifetime and bandwidth bottlenecks of image communication. We present an efficient adaptive compression scheme that can significantly minimize the energy required for wireless image communication while meeting bandwidth constraints of wireless network and image quality. Based on Discrete Wavelet Transform, we propose an efficient image compression scheme, enabling significant reduction in computation energy needed with minimal degradation of image quality. Simulation results are done with C++ and show that the proposed scheme optimizes network lifetime, reduces significantly the amount of required memory and minimizes both (i) computation energy, by reducing the computation needed to compress an image and (ii) communication energy, consumed by the RF component which is proportional to the number of transmitted bits.
---
paper_title: Adaptive and energy efficient wavelet image compression for mobile multimedia data services

paper_content:

To enable wireless Internet and other data services using mobile appliances, there is a critical need to support content-rich cellular data communication, including voice, text, image and video. However, mobile communication of multimedia content has several bottlenecks, including limited bandwidth of cellular networks, channel noise, and battery constraints of the appliances. We address the energy and bandwidth bottlenecks of image data communication. We present an energy efficient, adaptive data codec for still images that can significantly minimize the energy required for wireless image communication, while meeting bandwidth constraints of the wireless network, the image quality, and latency constraints of the wireless service. Based on wavelet image compression, we propose an energy efficient wavelet image transform algorithm (EEWITA) for lossy compression of still images, enabling significant reductions in computation as well as communication energy needed, with minimal degradation an image quality. Additionally, we identify, wavelet image compression parameters that can be used to effect trade-offs between the energy savings, quality of the image, and required communication bandwidth. We also present a dynamic configuration methodology that selects the optimal set of parameters to minimize energy under network, service, and appliance constraints. We demonstrate the significant energy and air time (service cost) savings possible by using the proposed energy efficient, adaptive image codec under different cellular access technologies.
---
paper_title: A Fast Inter-Mode Decision Algorithm Based on Macro-Block Tracking for P Slices in the H.264/AVC Video Standard

paper_content:

A fast inter-mode determination algorithm based on the macro-block (MB) tracking scheme and rate-distortion (RD) cost is proposed for the H.264/AVC video standard in which residual prediction is composed of intra-modes and inter-modes. In addition to intra-mode prediction, 8 block types exist for the best coding gain based on rate-distortion (RD) optimization in the inter-mode prediction. This scheme gives rise to exhaustive computations (search) in the coding procedure. To reduce the computational load of the inter-mode search at the inter-frame, we propose a new inter-mode determination algorithm based on the rate-distortion (RD) cost of the neighborhood MB that is tracked for the current MB in the previous frame. Based on the MB tracking scheme, an efficient sequential mode search approach is presented. We verify the performance of the proposed scheme through comparative analysis of experimental results using JM reference software.
---
paper_title: Fast Intra Prediction Mode Decision Algorithm for H.264/AVC Video Coding Standard

paper_content:

H.264/AVC video coding uses the intra prediction scheme to compress the spatial redundancy. The main goal of the intra prediction is to achieve a better compression efficiency. For finding the optimal prediction modes, H.264/AVC adopts the full search algorithm in the standard. The high computation complexity of the full search algorithm makes the encoding of H.264/AVC to be difficult to meet real time applications. In this work, we propose a fast intra prediction mode decision algorithm for 4 times 4 intra blocks, which is based on the partially sampling prediction and symmetry of the adjacent angle modes, to reduce the computational complexity of the 4 times 4 block intra-prediction. Experimental results show that the proposed algorithm can reduce the computation time of the intra prediction by more than 60% while maintaining similar video quality and bit rate.
---
paper_title: Low-complexity skip prediction for H.264 through Lagrangian cost estimation

paper_content:

A complexity reduction algorithm for an H.264 encoder is proposed. Computational savings are achieved by identifying, prior to motion estimation, macroblocks (MBs) that are likely to be skipped and hence saving further computational processing of these MBs. This early prediction is made by estimating a Lagrangian rate-distortion cost function which incorporates an adaptive model for the Lagrange multiplier parameter based on local sequence statistics. Simulation results demonstrate that the algorithm can achieve computational savings of 19%-67% (depending on the source sequence) with no significant loss of rate-distortion performance.
---
paper_title: Distributed Video Coding

paper_content:

Distributed coding is a new paradigm for video compression, based on Slepian and Wolf's and Wyner and Ziv's information-theoretic results from the 1970s. This paper reviews the recent development of practical distributed video coding schemes. Wyner-Ziv coding, i.e., lossy compression with receiver side information, enables low-complexity video encoding where the bulk of the computation is shifted to the decoder. Since the interframe dependence of the video sequence is exploited only at the decoder, an intraframe encoder can be combined with an interframe decoder. The rate-distortion performance is superior to conventional intraframe coding, but there is still a gap relative to conventional motion-compensated interframe coding. Wyner-Ziv coding is naturally robust against transmission errors and can be used for joint source-channel coding. A Wyner-Ziv MPEG encoder that protects the video waveform rather than the compressed bit stream achieves graceful degradation under deteriorating channel conditions without a layered signal representation.
---
paper_title: Rate-distortion-complexity optimization of fast motion estimation in H.264/MPEG-4 AVC

paper_content:

This paper presents an operational method for optimizing integer motion estimation in real-time H.264 encoding with respect to the trade-off between rate-distortion and complexity. This three-parameter problem is converted into a more tractable two-parameter problem by a simple approximative elimination of either the rate or the distortion term by converting small differences in the term to be eliminated. This paper also presents an H.264-enhanced implementation of the fast EPZS motion estimation algorithm, which adds three early-stop criteria controlled by predefined thresholds allowing it to stop after 16 16 and 8 8 block types and for each additional reference frame. Results for interlaced SDTV material are presented with indications of the applicability of the operational method when applied to the presented motion estimation procedure. For example, a speed-up by a factor of 4 compared to a basic H.264-adapted EPZS implementation is achieved at only 1% increase in rate.
---
paper_title: Fast inter mode prediction for P slices in the H264 video coding standard

paper_content:

We propose an inter mode decision scheme for P slices in the H264 video coding standard. Our scheme initially exploits neighborhood information jointly with a set of skip mode conditions for enhanced skip mode decision. It subsequently performs inter mode decision for the remaining macroblocks by using a gentle set of smoothness constraints. For RD performance very close to the standard, we achieve 35-58% reduction in run times and 33-55% reduction in CPU cycles for both the rate controlled and the non rate controlled versions of H264. Compared to other non gradient based work that has been proposed as input to the standard, gains of 9-23% in run times and 7-22% in CPU cycles are also reported. Finally, with respect to other gradient based approaches for mode decision, gains of 9% are reported in run times.
---
paper_title: Low-complexity macroblock mode selection for H.264-AVC encoders

paper_content:

Lagrangian minimization is one of the most powerful tools for rate-distortion optimal coding mode selection. However, in the latest video compression standard H.264/AVC, the total calculation for costs of all candidate modes may become huge since the new standard supports a large number of coding modes. In this paper, we propose an algorithm for fast coding mode selection in H.264/AVC encoders by reducing the number of candidate modes. We also present a rate estimation method for further reduction of Lagrangian cost calculation. Extensive experiments show that the proposed methods can reduce the execution time of mode selection in H.264/AVC reference software by 85% on the average while average PSNR loss is only 0.07 dB.
---
paper_title: Computation reduction for intra 4x4 mode decision with SATD criterion in H.264/AVC

paper_content:

In H.264 advanced video coding standard, the intra prediction made by referring to the surrounding coded pixels plays an important role in achieving the compression efficiency. To find the best prediction mode, the H.264 reference software JM 6.1d suggests two criteria, the sum of absolute differences (SAD) and the sum of absolute transformed differences (SATD). The SATD criterion with extra Hadamard transform achieves better coding performance, but needs more computation than the SAD criterion. A fast algorithm is developed to reduce the computation of the SATD, by using the property of linear transform and the fixed-spatial relationship of predicted pixels in each intra mode. With the fast SATD computation, about 50% computation of the original SATD algorithm can be reduced. To further reduce the SATD computation, a two-stage simplified SATD method is proposed, which first uses the SAD criterion to eliminate some unwanted modes and then performs the fast SATD computation to select the best mode. Experimental results show that the proposed two-stage simplified SATD method can save about 70% of computation costs with negligible PSNR loss for H.264 intra prediction.
---
paper_title: Wyner-Ziv coding of motion video

paper_content:

In current interframe video compression systems, the encoder performs predictive coding to exploit the similarities of successive frames. The Wyner-Ziv theorem on source coding with side information available only at the decoder suggests that an asymmetric video codec, where individual frames are encoded separately, but decoded conditionally (given temporally adjacent frames) could achieve similar efficiency. We report the first results on a Wyner-Ziv coding scheme for motion video that uses intraframe encoding, but interframe decoding.
---
paper_title: Shuffled belief propagation decoding

paper_content:

In this paper, we propose a shuffled version of the belief propagation (BP) algorithm for the decoding of low-density parity-check (LDPC) codes. We show that when the Tanner graph of the code is acyclic and connected, the proposed scheme is optimal in the sense of MAP decoding and converges faster (or at least no slower) than the standard BP algorithm. Interestingly, this new version keeps the computational advantages of the forward-backward implementations of BP decoding. Both serial and parallel implementations are considered. We show by simulation that the new schedule offers better performance/complexity trade-offs.
---
paper_title: Parallelization of belief propagation method on embedded multicore processors for stereo vision

paper_content:

Markov random field models provide a robust formulation of low-level vision problems. Among the problems, stereo vision remains the most investigated field. The belief propagation provides accurate result in stereo vision problems, however, the algorithm remains slow for practical use. In this paper we examine and extract the parallelisms in the belief propagation method for stereo vision on multicore processors. The results show that with parallelization exploration on multi-core processors, the belief propagation algorithm can have a 13.5 times speedup compared to the single processor implementation. The experimental results also indicate that the parallelized belief propagation algorithm on multicore processors is able to provide a frame rate in 6 frames per second.
---
paper_title: Distributed Monoview and Multiview Video Coding

paper_content:

Growing percentage of the world population now uses image and video coding technologies on a regular basis. These technologies are behind the success and quick deployment of services and products such as digital pictures, digital television, DVDs, and Internet video communications. Today's digital video coding paradigm represented by the ITU-T and MPEG standards mainly relies on a hybrid of block- based transform and interframe predictive coding approaches. In this coding framework, the encoder architecture has the task to exploit both the temporal and spatial redundancies present in the video sequence, which is a rather complex exercise. As a consequence, all standard video encoders have a much higher computational complexity than the decoder (typically five to ten times more complex), mainly due to the temporal correlation exploitation tools, notably the motion estimation process. This type of architecture is well-suited for applications where the video is encoded once and decoded many times, i.e., one-to-many topologies, such as broadcasting or video-on-demand, where the cost of the decoder is more critical than the cost of the encoder.
---
paper_title: Distributed Source Coding: Theory, Algorithms and Applications

paper_content:

The advent of wireless sensor technology and ad-hoc networks has made DSC a major field of interest. Edited and written by the leading players in the field, this book presents the latest theory, algorithms and applications, making it the definitive reference on DSC for systems designers and implementers, researchers, and graduate students.This book gives a clear understanding of the performance limits of distributed source coders for specific classes of sources and presents the design and application of practical algorithms for realistic scenarios. Material covered includes the use of standard channel codes, such as LDPC and Turbo codes, to DSC, and discussion of the suitability of compressed sensing for distributed compression of sparse signals. Extensive applications are presented and include distributed video coding, microphone arrays and securing biometric data.This book is a great resource covering the breadth and depth of distributed source coding that's appropriate for everyone from theoreticians to practitioners. - Richard Baraniuk, Rice UniversityPier Luigi Dragotti is currently a Senior Lecturer in the Electrical and Electronic Engineering Department at Imperial College, London. He has worked as a researcher at Bell Labs and EPFL and is a member of the IEEE Image and MultiDimensional Signal Processing (IMDSP) Technical Committee.Michael Gastpar is currently an Assistant Professor at the University of California, Berkeley. His research interests are in network information theory and related coding and signal processing techniques, with applications to sensor networks and neuroscience. He won the 2002 EPFL Best Thesis Award, an NSF CAREER award in 2004, and an Okawa Foundation Research Grant in 2008. *Clear explanation of the principles of distributed source coding (DSC), a technology that has applications in sensor networks, ad-hoc networks, and distributed wireless video systems for surveillance*Edited and written by the leading players in the field, providing a complete and authoritative reference*Contains all the latest theory, practical algorithms for DSC design and the most recently developed applications
---
paper_title: Replica Shuffled Belief Propagation Decoding of LDPC Codes

paper_content:

Replica shuffled belief propagation decoders of low-density parity-check codes are presented. The proposed decoders converge faster than standard and shuffled belief propagation decoders. Simulations shw that the new decoders offer good performance versus complexity trade-offs.
---
paper_title: Low complexity hybrid rate control for lower complexity Wyner-ZIV video decoding

paper_content:

Wyner-Ziv (WZ) video coding is an emerging paradigm which promises to lower the encoding complexity at the cost of additional decoding complexity regarding predictive coding solutions. However, the current decoding complexity increase is huge, very likely unacceptable for the relevant applications, asking for solutions which allow reducing this cost without negatively impacting the RD performance and the encoding complexity. This paper proposes hybrid rate control solutions which allow reaching the objectives above for Stanford-like WZ video codecs.
---
paper_title: The rate-distortion function for source coding with side information at the decoder

paper_content:

In this paper we generalize (to nondiscrete sources) the results of a previous paper (Wyner and Ziv, 1976) on source coding with a fidelity criterion in a situation where the decoder (but not the encoder) has access to side information about the source. We define R *( d ) as the minimum rate (in the usual Shannon sense) required for encoding the source at a distortion level about d . The main result is the characterization of R *( d ) by an information theoretic minimization. In a special case in which the source and the side information are jointly Gaussian, it is shown that R *( d ) is equal to the rate which would be required if the encoder (as well as the decoder) is informed of the side information.
---
paper_title: Low complexity video coding and the emerging HEVC standard

paper_content:

This paper describes a low complexity video codec with high coding efficiency. It was proposed to the High Efficiency Video Coding (HEVC) standardization effort of MPEG and VCEG, and has been partially adopted into the initial HEVC Test Model under Consideration design. The proposal utilizes a quad-tree structure with a support of large macroblocks of size 64×64 and 32×32, in addition to macroblocks of size 16×16. The entropy coding is done using a low complexity variable length coding based scheme with improved context adaptation over the H.264/AVC design. In addition, the proposal includes improved interpolation and deblocking filters, giving better coding efficiency while having low complexity. Finally, an improved intra coding method is presented. The subjective quality of the proposal is evaluated extensively and the results show that the proposed method achieves similar visual quality as H.264/AVC High Profile anchors with around 50% and 35% bit rate reduction for low delay and random-access experiments respectively at high definition sequences. This is achieved with less complexity than H.264/AVC Baseline Profile, making the proposal especially suitable for resource constrained environments.
---
paper_title: Replica Shuffled Belief Propagation Decoding of LDPC Codes

paper_content:

Replica shuffled belief propagation decoders of low-density parity-check codes are presented. The proposed decoders converge faster than standard and shuffled belief propagation decoders. Simulations shw that the new decoders offer good performance versus complexity trade-offs.
---
paper_title: A cross-layer approach for energy efficient transmission of progressively coded images over wireless channels

paper_content:

Mobility, made available by today's communication networks, imposes several limitations in the design of multimedia applications, due to high error rates, reduced bandwidth, strong variability, and mobile terminals lifetime. This paper investigates the use of an energy constrained cross-layer approach for the transmission of progressively coded images over packet-based wireless channels. We propose an optimum power allocation algorithm to enable unequal error protection of a pre-encoded image. Simulations are performed modeling transmission over a Rayleigh fading channel. The investigation focuses on JPEG2000, but it is applicable to other progressively coded bitstreams as well. Our experimental results demonstrate that it is possible to achieve a relevant performance enhancement with the proposed approach over uniform error protection. The optimal solution can also serve as a guideline for developing less computationally intensive empiric approaches.
---
paper_title: Energy Efficient Wireless Scalable Video Streaming with Optimal Transmission Rate Adaptation and Unequal Error Protection

paper_content:

The dramatic increase in bandwidth brought by new technologies is beginning to enable video streaming capability in personal communications. We introduce a new energy efficient approach to deal with the wireless scalable video streaming. The goal of the optimization problem is to minimize the energy consumption under delay and expected video quality constraints. An optimal algorithm based on dynamic programming is also proposed to jointly select the scalable enhancement layers, channel transmission rate adaptation and FEC (forward error correction) error protection. Simulation results show that over 5-30% energy can be saved to achieve the same expected video distortion
---
paper_title: Rate-switching unequal error protection for wireless electrocardiogram (ECG) transmission

paper_content:

Energy efficiency for mobile wireless electrocardiography (ECG) communication is an important issue due to resource constraints in wireless Body Area Sensor Networks (BASNs). Traditional high quality ECG transmission schemes require substantial amounts of energy usage, which may not be available in BASN. Therefore, an adaptive approach is necessary to provide high quality ECG transmission with efficient usage of available energy resources. Related literature mainly focuses on data compression, where transmission energy is saved because the amount of data being transmitted is reduced. However, further reduction of energy consumption based on communication strategy is rarely discussed in literature. In this paper, we analyze the characteristics of compressed ECG data, which show that different parts of the data are unequally important to quality of ECG transmission in BASN. In this work, we propose a new Rate-switching Un-Equal Protection (RUEP) mechanism, which optimizes the distortion reduction of ECG data by adaptively assigning different Rate Compatible Punctured Convolutional (RCPC) codes to protect the different parts of the compressed ECG data. Simulation results demonstrate that our RUEP scheme results in an improved communication energy efficiency by at least 45 percent compared with traditional schemes in the AWGN channel.
---
paper_title: Energy efficient JPEG 2000 image transmission over wireless sensor networks

paper_content:

We propose an energy efficient JPEG 2000 image transmission system over point-to-point wireless sensor networks. The objective is to minimize the overall processing and transmission energy consumption with the expected end-to-end QoS guarantee, which is achieved by jointly adjusting the source coding schemes, channel coding rates, and transmitter power levels in an optimal way. The advantages of the proposed system lie in three aspects: adaptivity, optimality, and low complexity. Based on the characteristics of the image content, the estimated channel conditions, and the distortion constraint, the proposed low-complexity joint source channel coding and power control algorithm adjusts the coding and transmission strategies adaptively, which can approximate the optimal solution with a tight bound.
---
paper_title: Joint object-based video encoding and power management for energy efficient wireless video communications

paper_content:

In this paper, we consider dynamic resource allocation for object-based wireless video communications. In object-based video coding, a video frame is comprised of objects that are described by their shape as well as their texture. By jointly considering source coding, error concealment and transmission power management at the physical layer, the proposed framework minimize the expect distortion at the receiver for given energy and delay constraints. In order to provide unequal error protection for the shape and texture information, a new video packetization scheme is proposed. Experimental results indicate that the proposed unequal error protection schemes significantly outperform equal error protection methods.
---
paper_title: Energy-Constrained Distortion Reduction Optimization for Wavelet-Based Coded Image Transmission in Wireless Sensor Networks

paper_content:

Image transmissions in wireless multimedia sensor networks (WMSNs) are often energy constrained. They also have requirement on distortion minimization, which may be achieved through unequal error protection (UEP) based communication approaches. In related literature with regard to wireless multimedia transmissions, significantly different importance levels between image-pixel-position information and image-pixel-value information have not been fully exploited by existing UEP schemes. In this paper, we propose an innovative image-pixel-position information based resource allocation scheme to optimize image transmission quality with strict energy budget constraint for image applications in WMSNs, and it works by exploring these uniquely different importance levels among image data streams. Network resources are optimally allocated cross PHY, MAC and APP layers regarding inter-segment dependency, and energy efficiency is assured while the image transmission quality is optimized. Simulation results have demonstrated the effectiveness of the proposed approach in achieving the optimal image quality and energy efficiency. The performance gain in terms of distortion reduction is especially prominent with strict energy budget constraints and lower image compression ratios.
---
paper_title: A cross-layer approach for energy efficient transmission of progressively coded images over wireless channels

paper_content:

Mobility, made available by today's communication networks, imposes several limitations in the design of multimedia applications, due to high error rates, reduced bandwidth, strong variability, and mobile terminals lifetime. This paper investigates the use of an energy constrained cross-layer approach for the transmission of progressively coded images over packet-based wireless channels. We propose an optimum power allocation algorithm to enable unequal error protection of a pre-encoded image. Simulations are performed modeling transmission over a Rayleigh fading channel. The investigation focuses on JPEG2000, but it is applicable to other progressively coded bitstreams as well. Our experimental results demonstrate that it is possible to achieve a relevant performance enhancement with the proposed approach over uniform error protection. The optimal solution can also serve as a guideline for developing less computationally intensive empiric approaches.
---
paper_title: Rate-based versus distortion-based optimal joint source-channel coding

paper_content:

We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error correction capability. The performance of this system may be measured by the expected distortion or by the expected number of correctly received source bits subject to a target total transmission rate. Whereas a rate-based optimal solution can be found in linear time, the computation of a distortion-based optimal solution is prohibitive. Under the assumption of the convexity of the operational distortion-rate function of the source coder, we give a lower bound on the expected distortion of a distortion-based optimal solution that depends only on a rate-based optimal solution. Then we show that a distortion-based optimal solution provides a stronger error protection than a rate-based optimal solution and exploit this result to reduce the time complexity of the distortion-based optimization. Finally, we propose a fast iterative improvement algorithm that starts from a rate-based optimal solution and converges to a local minimum of the expected distortion. Experimental results for a binary symmetric channel with the SPIHT coder and JPEG 2000 show that our lower bound is close to optimal. Moreover, the solution given by our local search algorithm has about the same quality as a distortion-based optimal solution, whereas its complexity is much lower than that of the previous best solution.
---
paper_title: Progressive transmission of images over memoryless noisy channels

paper_content:

An embedded source code allows the decoder to reconstruct the source progressively from the prefixes of a single bit stream. It is desirable to design joint source-channel coding schemes which retain the capability of progressive reconstruction in the presence of channel noise or packet loss. Here, we address the problem of joint source-channel coding of images for progressive transmission over memoryless bit error or packet erasure channels. We develop a framework for encoding based on embedded source codes and embedded error correcting and error detecting channel codes. For a target transmission rate, we provide solutions and an algorithm for the design of optimal unequal error/erasure protection. Three performance measures are considered: the average distortion, the average peak signal-to-noise ratio, and the average useful source coding rate. Under the assumption of rate compatibility of the underlying channel codes, we provide necessary conditions for progressive transmission of joint source-channel codes. We also show that the unequal error/erasure protection policies that maximize the average useful source coding rate allow progressive transmission with optimal unequal protection at a number of intermediate rates.
---
paper_title: Rate-switching unequal error protection for wireless electrocardiogram (ECG) transmission

paper_content:

Energy efficiency for mobile wireless electrocardiography (ECG) communication is an important issue due to resource constraints in wireless Body Area Sensor Networks (BASNs). Traditional high quality ECG transmission schemes require substantial amounts of energy usage, which may not be available in BASN. Therefore, an adaptive approach is necessary to provide high quality ECG transmission with efficient usage of available energy resources. Related literature mainly focuses on data compression, where transmission energy is saved because the amount of data being transmitted is reduced. However, further reduction of energy consumption based on communication strategy is rarely discussed in literature. In this paper, we analyze the characteristics of compressed ECG data, which show that different parts of the data are unequally important to quality of ECG transmission in BASN. In this work, we propose a new Rate-switching Un-Equal Protection (RUEP) mechanism, which optimizes the distortion reduction of ECG data by adaptively assigning different Rate Compatible Punctured Convolutional (RCPC) codes to protect the different parts of the compressed ECG data. Simulation results demonstrate that our RUEP scheme results in an improved communication energy efficiency by at least 45 percent compared with traditional schemes in the AWGN channel.
---
paper_title: Energy efficient JPEG 2000 image transmission over wireless sensor networks

paper_content:

We propose an energy efficient JPEG 2000 image transmission system over point-to-point wireless sensor networks. The objective is to minimize the overall processing and transmission energy consumption with the expected end-to-end QoS guarantee, which is achieved by jointly adjusting the source coding schemes, channel coding rates, and transmitter power levels in an optimal way. The advantages of the proposed system lie in three aspects: adaptivity, optimality, and low complexity. Based on the characteristics of the image content, the estimated channel conditions, and the distortion constraint, the proposed low-complexity joint source channel coding and power control algorithm adjusts the coding and transmission strategies adaptively, which can approximate the optimal solution with a tight bound.
---
paper_title: Error Protection and Interleaving for Wireless Transmission of JPEG 2000 Images and Video

paper_content:

The transmission of JPEG 2000 images or video over wireless channels has to cope with the high probability and burstyness of errors introduced by Gaussian noise, linear distortions, and fading. At the receiver side, there is distortion due to the compression performed at the sender side, and to the errors introduced in the data stream by the channel. Progressive source coding can also be successfully exploited to protect different portions of the data stream with different channel code rates, based upon the relative importance that each portion has on the reconstructed image. Unequal error protection (UEP) schemes are generally adopted, which offer a close to the optimal solution. In this paper, we present a dichotomic technique for searching the optimal UEP strategy, which lends ideas from existing algorithms, for the transmission of JPEG 2000 images and video over a wireless channel. Moreover, we also adopt a method of virtual interleaving to be used for the transmission of high bit rate streams over packet loss channels, guaranteeing a large PSNR advantage over a plain transmission scheme. These two protection strategies can also be combined to maximize the error correction capabilities.
---
paper_title: Joint Source Coding and Data Rate Adaptation for Energy Efficient Wireless Video Streaming

paper_content:

Rapid growth in wireless networks is fueling demand for video services from mobile users. While the problem of transmitting video over unreliable channels has received some attention, the wireless network environment poses challenges such as transmission power management that have received little attention previously in connection with video. Transmission power management affects battery life in mobile devices, interference to other users, and network capacity. We consider energy efficient transmission of a video sequence under delay and quality constraints. The selection of source coding parameters is considered jointly with transmitter power and rate adaptation, and packet transmission scheduling. The goal is to transmit a video frame using the minimal required transmission energy under delay and quality constraints. Experimental results are presented that illustrate the advantages of the proposed approach.
---
paper_title: Fast algorithm for rate-based optimal error protection of embedded codes

paper_content:

Embedded image codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. P.G. Sherwood and K. Zeger (see IEEE Signal Processing Lett., vol.4, p.191-8, 1997) introduced a powerful system that protects an embedded wavelet image code with a concatenation of a cyclic redundancy check coder for error detection and a rate-compatible punctured convolutional coder for error correction. For such systems, V. Chande and N. Farvardin (see IEEE J. Select. Areas Commun., vol.18, p.850-60, 2000) proposed an unequal error protection strategy that maximizes the expected number of correctly received source bits subject to a target transmission rate. Noting that an optimal strategy protects successive source blocks with the same channel code, we give an algorithm that accelerates the computation of the optimal strategy of Chande and Farvardin by finding an explicit formula for the number of occurrences of the same channel code. Experimental results with two competitive channel coders and a binary symmetric channel showed that the speed-up factor over the approach of Chande and Farvardin ranged from 2.82 to 44.76 for transmission rates between 0.25 and 2 bits per pixel.
---
paper_title: Error resilient image and video transmission over the internet using unequal error protection

paper_content:

This paper presents a new bit-plane-wise unequal error protection algorithm for progressive bitstreams transmitted over lossy networks. The proposed algorithm protects a compressed embedded bitstream generated by a 3-D SPIHT algorithm by assigning an unequal amount of forward error correction (FEC) to each bit-plane. The proposed algorithm reduces the amount of side information needed to send the size of each code to the decoder by limiting the number of quality levels to the number of bit-planes to be sent while providing a graceful degradation of picture quality as packet losses increase. We also apply our proposed algorithm to transmission of JPEG 2000 coded images over the Internet. To get additional error-resilience at high packet loss rates, we extend our algorithm to multiple-substream unequal error protection. Simulation results show that the proposed algorithm is simple, fast and robust in hostile network conditions and, therefore, can provide reasonable picture quality for video applications under varying network conditions.
---
paper_title: Robust image transmission using JPEG2000 and turbo-codes

paper_content:

This work describes a method for providing robustness to errors from a binary symmetric channel for the JPEG2000 (J2K) image compression standard. It does so while maintaining full J2K compliance. The source rate and channel rate are jointly optimized by using a Viterbi Algorithm (VA) on a stream of fixed-size channel packets, such that the rate allocation complexity grows O(N/sup 2/) with the number of transmitted packets. Punctured turbo codes are used for the channel coding, providing stronger error protection than previously available codes. The rate allocation scheme presented obtains all necessary information from the J2K encoder, and does not require image decompression.
---
paper_title: Source-Channel Rate Allocation for Progressive Transmission of Images

paper_content:

Progressive image transmission is difficult in the presence of a noisy channel, mainly due to the propagation of errors during the decoding of a progressive bitstream. Excellent results for this problem are made possible through combined source-channel coding, a method that matches the channel code to the source operational rate distortion as well as channel conditions. This paper focuses on the key component of combined source-channel coding: rate allocation. We develop a parametric methodology for rate allocation in progressive source-channel coding. The key to this technique is an empirical model of decoded bit-error rate as a function of the channel code rate. We investigate several scenarios. In the case of the memoryless channel, we present closed-form expressions. For the fading channel and channels with feedback, where closed-form results are elusive, our analysis leads to low-complexity algorithms. The results presented are applicable to any progressive source code, and any family of channel codes.
---
paper_title: Scalable image and video transmission using irregular repeat-accumulate codes with fast algorithm for optimal unequal error protection

paper_content:

This paper considers designing and applying punctured irregular repeat-accumulate (IRA) codes for scalable image and video transmission over binary symmetric channels. IRA codes of different rates are obtained by puncturing the parity bits of a mother IRA code, which uses a systematic encoder. One of the main ideas presented here is the design of the mother code such that the entire set of higher rate codes obtained by puncturing are good. To find a good unequal error protection for embedded bit streams, we employ the fast joint source-channel coding algorithm in Hamzaoui et al. to minimize the expected end-to-end distortion. We test with two scalable image coders (SPIHT and JPEG-2000) and two scalable video coders (3-D SPIHT and H.26L-based PFGS). Simulations show better results with IRA codes than those reported in Banister et al. with JPEG-2000 and turbo codes. The IRA codes proposed here also have lower decoding complexity than the turbo codes used by Banister et al.
---
paper_title: Combined source and channel coding with JPEG2000 and rate-compatible low-density Parity-check codes

paper_content:

Rate-compatible low-density parity-check (RC-LDPC) codes are used to provide unequal error protection for the robust and efficient transmission of JPEG2000 compressed images over noisy channels. The total bit budget is partitioned between the source and the channel coding by using a Viterbi algorithm (VA) applied to a search trellis, and appropriate channel code rates are assigned to the source blocks. The performance of the proposed scheme is evaluated on binary symmetric channels (BSCs). Experimental results indicate that the proposed scheme compares favorably with other combined source/channel coding schemes over a variety of channel conditions and transmission bit rates. In particular, the proposed scheme outperforms similar schemes based on turbo codes and irregular repeat-accumulate codes by up to about 1.1 and 1 dB in the expected peak signal-to-noise ratio (PSNR) of reconstructed images, respectively.
---
paper_title: Product code optimization for determinate state LDPC decoding in robust image transmission

paper_content:

We propose a novel scheme for error-resilient image transmission. The proposed scheme employs a product coder consisting of low-density parity check (LDPC) codes and Reed-Solomon codes in order to deal effectively with bit errors. The efficiency of the proposed scheme is based on the exploitation of determinate symbols in Tanner graph decoding of LDPC codes and a novel product code optimization technique based on error estimation. Experimental evaluation demonstrates the superiority of the proposed system in comparison to recent state-of-the-art techniques for image transmission.
---
paper_title: Progressive image coding on noisy channels

paper_content:

Numerous sophisticated techniques have been developed over the last several decades to efficiently transmit images across noisy channels. Here, we cascade an existing image coder with carefully chosen error control coding, and thus produce a progressive image compression scheme whose performance on a noisy channel is significantly better than that of previously known image compression techniques. The main idea is to trade off the available transmission rate between source coding and channel coding in an efficient manner. This coding system is easy to implement and has acceptably low complexity. Furthermore, effectively no degradation due to channel noise can be detected; instead, the penalty paid due to channel noise is a reduction in source coding resolution. As an example, for the 512/spl times/512 Lena image, at an overall transmission rate of 1 bit per pixel, and for binary symmetric channels with bit error probabilities 10/sup -3/, 10/sup -2/, and 10/sup -1/, the proposed system typically outperforms other existing systems by at least 2.6 dB, 2.8 dB, and 8.9 dB, respectively.
---
paper_title: Efficient channel protection for JPEG2000 bitstream

paper_content:

An adaptive unequal channel protection technique is proposed for JPEG2000 compressed images exploiting the hierarchical structure of the coded bit stream. The proposed technique takes into account the effect of the channel errors in different packets of the bit stream in order to optimally protect the coded data according to the channel conditions. The robustness of the proposed technique is evaluated over a Rayleigh-fading channel with a concatenation of a cyclic redundancy check code and a rate-compatible convolutional code. Comparisons are made with the cases of equal channel protection and unequal channel protection across the layers. Simulation results show a significant improvement in subjective and objective quality of the received images.
---
paper_title: Joint UEP and layered source coding with application to transmission of JPEG-2000 coded images

paper_content:

This paper presents a joint source-channel coding framework based on layered source coding and Reed-Solomon channel coding for unequal error protection. An iterative procedure is described to search for the best source coding rate and the optimal UEP of layered bitstreams. We apply our JSCC technique to transmission of JPEG-2000 coded images over binary symmetric channels. Compared to results reported in the literature, our UEP based approach gives better results while having lower complexity.
---
paper_title: Power efficient multimedia communications over wireless channels

paper_content:

In this work, we introduce an approach for minimizing the total power consumption of a mobile transmitter due to source compression, channel coding and transmission subject to a fixed end-to-end source distortion. We illustrate our approach both on an abstract class of sources and channels and on a realistic H.263 video transmission system through a wireless channel. Performance under different channel environments and implementation schemes are investigated. Our numerical analysis shows that optimized settings can reduce the total power consumption by a significant factor and prolong battery life considerably compared with fixed parameter settings.
---
paper_title: Power-Aware Mobile Multimedia: a Survey

paper_content:

With the fast-paced development of computing technologies, mobile devices have almost sufficient computation and communication capabilities to support mobile multimedia applications such as multimedia streaming, VoIP, and mobile TV. However, most existing mobile devices are powered by battery with limited energy resource. To support multimedia on battery-powered mobile devices, how to efficiently utilize the limited power source and other limited network resources has become one of the major challenges in mobile multimedia system design. It has been shown that achieving a satisfactory user experience needs a systematic consideration of both video source adaptation and network transmission adaptation, indicating that the core of mobile multimedia system design is how to achieve a good balance of the power consumption between computation usage and communication usage. In other words, it depends on how to jointly select video source parameters and channel parameters based on the video content characteristics, available network resources, and underlying network conditions, given the fact that the power management schemes as well as the nonlinear battery effects also affect the system power consumption of mobile devices. In this paper, we review the recent advances in power-aware mobile multimedia, especially the adaptation technologies applied in video coding and delivery. In addition, the major research challenges in the field are demonstrated and discussed, which include power-management for mobile devices, rate-distortion-complexity optimized video codec design, and computational complexity and power aware cross-layer design and optimization. At the end, we propose a number of future research directions for audiences to continue investigation in this field.
---
paper_title: Joint Mode Selection and Unequal Error Protection for Bitplane Coded Video Transmission Over Wireless Channels ?

paper_content:

In this paper, we study joint source channel coding for bitplane based video coding over wireless channels. We consider using frame-level intra-mode to stop error propagation and using unequal error protection (UEP) to combat channel errors. Our focus is on how to optimally select coding modes and find UEP solutions for bitplane based video coding. In particular, we propose an overall end-to-end rate-distortion (R-D) function, which considers not only the source distortion and the channel distortion introduced in the current frame but also the propagated channel distortion from the previous frames. Based on this end-to-end R-D function, we are able to find the optimal solutions for both mode selection and UEP so that an optimal tradeoff between efficiency and robustness can be achieved. Experimental results demonstrate the significant performance gain.
---
paper_title: From rate-distortion analysis to resource-distortion analysis

paper_content:

The ultimate goal in communication system design is to control and optimize the system performance under resource constraints. As the communication paradigm evolves from the conventional desktop computing, wired, and centralized communication to current mobile, wireless, distributed, and massive communication, video encoding and transmission operate under more and more resource constraints. In traditional video communication applications, such as digital TV broadcast, the major constraint is in the form of transmission bandwidth or storage space, which determines the encoding bit rate. Rate-distortion (R-D) theories have been developed to model the relationship between the coding bit rate and signal distortion. For video communication over mobile devices, the video encoding and transmission operate under additional resource constraints, such as energy supply and on-board computation capability. Therefore, there is a need to extend the traditional R-D analysis to resource-distortion analysis by incorporating the new resource constraints into the R-D analysis framework. In distributed and massive wireless video sensor networks, the resource utilization behaviors of individual video sensors should be well-coordinated through network-level rate allocation and optimum routing so as to maximize the overall performance. In this paper, we start from the classical R-D theory developed by Shannon over 50 years ago, and then review the R-D modelling techniques for modern image and video compression systems. We study the resource-distortion analysis framework for video communication over wireless devices. As one step further, we present the research problem of resource allocation and performance optimization for video compression and communication over a network of wireless communication devices.
---
paper_title: Total Power Minimization for Multiuser Video Communications Over CDMA Networks

paper_content:

In this work, we consider a CDMA cell with multiple terminals transmitting video signals. We adapt the system parameters to minimize the sum of compression powers and transmitter powers of all users while guaranteeing the received video quality at each terminal. The adjustable parameters at user i include the transmitter power Pt,i, the video coding bit rate Rs,i, and video encoder parameters that control the complexity and hence power consumption of the video coder (referred simply as complexity betai). Instead of determining Pt,i directly, we first determine the desired signal to interference-noise ratio (SINR) gammai. Based on the optimal gammai and Rs,i, we then determine P t,i. Our analysis shows that the product of Rs,i and gammai is an important quantity. Given the complexity betai (i.e., given the compression power) and quality constraint, in order to reduce the transmission power, one should choose Rs,i and gammai to minimize their product. When only the total transmission power is concerned, the optimal operating points can be determined at individual users separately: each user should run the encoder to minimize the product of Rs,i and gammai. When the objective is to minimize the sum of compression and transmission powers of all users, the optimal solution can be found in two steps. The first step searches the optimal Rs,i and gammai that minimize Rs,itimesgammai for each video category and each possible betai while satisfying the quality constraint at user i. The second step searches the optimal {betai}i=1,...,N for all users jointly, that minimizes the sum of transmission and compression powers of all users. The first step can be completed offline in advance, only the second step needs to be computed in real time based on channel conditions of the users. Our results indicate that for the same class of video users, the one who is closer to the base station compresses at a lower complexity. Simulation results show that significant power savings are obtained by our adaptive algorithms over nonadaptive approaches, where {Rs,i ,betai,gammai} are fixed regardless the channel conditions
---

Title: A Survey of Energy-Efficient Compression and Communication Techniques for Multimedia in Resource Constrained Systems

Section 1: Introduction
Description 1: This section introduces the topic and outlines the key challenges and goals for energy-efficient multimedia communication in resource-constrained systems.

Section 2: Energy-Efficient Image Compression
Description 2: This section explores various image compression algorithms, compares their energy and compression efficiency, and discusses improvements aimed at energy efficiency in wireless communication systems.

Section 3: Energy-Efficient Video Compression
Description 3: This section examines video compression techniques, analyzing their energy efficiency and application in different scenarios. It discusses notable algorithms like H.264, Distributed Video Coding (DVC), and the emerging HEVC standard.

Section 4: Cross-Layer Techniques for Multimedia Communication
Description 4: This section delves into cross-layer communication strategies, particularly Unequal Error Protection (UEP) and Joint Compression and Communication Optimization, providing insights into their problem statements, solutions, and channel codes involved.

Section 5: Future Work and Open Issues
Description 5: This section highlights ongoing challenges and potential research directions in the field of energy-efficient multimedia communication in resource-constrained systems.

Section 6: Conclusion
Description 6: This section summarizes the survey's key findings and provides final remarks on the state of research in energy-efficient techniques for multimedia communication.