Conferences related to Source Coding

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 IEEE International Conference on Image Processing (ICIP)

The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.


2020 IEEE International Conference on Plasma Science (ICOPS)

IEEE International Conference on Plasma Science (ICOPS) is an annual conference coordinated by the Plasma Science and Application Committee (PSAC) of the IEEE Nuclear & Plasma Sciences Society.


2020 IEEE/ACM 42nd International Conference on Software Engineering (ICSE)

ICSE is the premier forum for researchers to present and discuss the most recent innovations,trends, outcomes, experiences, and challenges in the field of software engineering. The scopeis broad and includes all original and unpublished results of empirical, conceptual, experimental,and theoretical software engineering research.


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


More Conferences

Periodicals related to Source Coding

Back to Top

Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


Circuits and Systems for Video Technology, IEEE Transactions on

Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, high-speed real-time circuits, VLSI architecture and implementation for video technology, multiprocessor systems--hardware and software-- ...


Circuits and Systems Magazine, IEEE


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications Magazine, IEEE

IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...


More Periodicals

Most published Xplore authors for Source Coding

Back to Top

Xplore Articles related to Source Coding

Back to Top

Cascade and triangular source coding with side information at the first two nodes

2010 IEEE International Symposium on Information Theory, 2010

We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for these problems. For the quadratic Gaussian case, we show that it suffices to consider jointly Gaussian distributions, a fact that leads to an explicit solution.


Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region

IEEE Transactions on Information Theory, 2011

A distributed source coding problem with a joint distortion criterion that depends on the sources and the reconstruction is considered in this work. While the prevalent trend in information theory has been to prove achievability results using Shannon's random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, a new ...


Multiterminal Source Coding Under Logarithmic Loss

IEEE Transactions on Information Theory, 2014

We consider the classical two-encoder multiterminal source coding problem where distortion is measured under logarithmic loss. We provide a single- letter description of the achievable rate distortion region for all discrete memoryless sources with finite alphabets. By doing so, we also give the rate distortion region for the m-encoder CEO problem (also under logarithmic loss). Several applications and examples are ...


Linear Code Duality Between Write-Efficient Memories and Lossy Source Coding

IEEE Communications Letters, 2018

We study the duality between write-efficient memory (WEM) and lossy source coding in the linear coding framework. We show how a code (both its encoder and reproducer) for a symmetric lossy source coding problem can be used to design a code for a general WEM problem. Conversely, we show how a code for a general WEM problem can be used ...


Indirect and Direct Gaussian Distributed Source Coding Problems

IEEE Transactions on Information Theory, 2014

We consider the distributed source coding system of L correlated Gaussian sources Yl, l = 1, 2, ... , L, which are noisy observations of correlated Gaussian remote sources Xk, k = 1,2, ..., K. We assume that YL= t(Y1, Y2,...,YL) is an observation of the source vector XK= t(X1, X2, . . . , XK), having the form YL= ...


More Xplore Articles

Educational Resources on Source Coding

Back to Top

IEEE-USA E-Books

  • Cascade and triangular source coding with side information at the first two nodes

    We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characterize the rate-distortion region for these problems. For the quadratic Gaussian case, we show that it suffices to consider jointly Gaussian distributions, a fact that leads to an explicit solution.

  • Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region

    A distributed source coding problem with a joint distortion criterion that depends on the sources and the reconstruction is considered in this work. While the prevalent trend in information theory has been to prove achievability results using Shannon's random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, a new achievable rate-distortion region (an inner bound to the performance limit) is presented for this problem for discrete memoryless sources based on “good” structured random nested codes built over abelian groups. For certain sources and distortion functions, the new rate region is shown to be strictly bigger than the Berger-Tung rate region, which has been the best known achievable rate region for this problem till now. This is done using numerical plots. Achievable rates for single-user source coding using abelian group codes are also obtained as a corollary of the main coding theorem. It is shown that nested linear codes achieve the Shannon rate-distortion function in the arbitrary discrete memoryless case.

  • Multiterminal Source Coding Under Logarithmic Loss

    We consider the classical two-encoder multiterminal source coding problem where distortion is measured under logarithmic loss. We provide a single- letter description of the achievable rate distortion region for all discrete memoryless sources with finite alphabets. By doing so, we also give the rate distortion region for the m-encoder CEO problem (also under logarithmic loss). Several applications and examples are given.

  • Linear Code Duality Between Write-Efficient Memories and Lossy Source Coding

    We study the duality between write-efficient memory (WEM) and lossy source coding in the linear coding framework. We show how a code (both its encoder and reproducer) for a symmetric lossy source coding problem can be used to design a code for a general WEM problem. Conversely, we show how a code for a general WEM problem can be used to design a code for a general lossy source coding problem. The exact relations between the rates and the rewriting cost (distortion) of the two codes are established.

  • Indirect and Direct Gaussian Distributed Source Coding Problems

    We consider the distributed source coding system of L correlated Gaussian sources Yl, l = 1, 2, ... , L, which are noisy observations of correlated Gaussian remote sources Xk, k = 1,2, ..., K. We assume that YL= t(Y1, Y2,...,YL) is an observation of the source vector XK= t(X1, X2, . . . , XK), having the form YL= AXK+NL, where A is a L×K matrix and NL= t(N1, N2, ... , NL) is a vector of L-independent Gaussian random variables also independent of XK. In this system, L correlated Gaussian observations are separately compressed by L encoders and sent to the information processing center. We study the remote source coding problem, where the decoder at the center attempts to reconstruct the remote source XK. We consider three distortion criteria based on the covariance matrix of the estimation error on XK. For each of those three criteria, we derive explicit inner and outer bounds of the rate distortion region. Next, in the case of K = L and A = IL, we study the multiterminal source coding problem, where the decoder wishes to reconstruct the observation YL= XL+ NL. To investigate this problem, we shall establish a result that provides a strong connection between the remote source coding problem and multiterminal source coding problem. Using this result, we derive several new partial solutions to the multiterminal source coding problem.

  • Multiterminal source coding: Theory, code design and applications

    Summary form only given. Distributed source coding (DSC) considers the problem of separate compression and joint decompression of multiple correlated sources. Berger and Tung first introduced the multiterminal (MT) source coding problem and studied the region of all possible encoder rate tuples such that the sources are reconstructed under distortion constraints. One can loosely view MT source coding as the lossy version of Slepian-Wolf coding. Applications of MT source coding include distributed video sensor networks and MT/multiview video coding for camera arrays. Despite recent progresses, finding the sum-rate bound of quadratic Gaussian MT source coding with more than two terminals is still an open problem. In this talk, I will present our recent theoretical results on quadratic Gaussian MT source coding, limit- approaching code designs, and MT video coding (including the case with depth camera assistance).

  • Zero-Delay and Causal Secure Source Coding

    We investigate the combination between causal/zero-delay source coding and information-theoretic secrecy. Two source coding models with secrecy constraints are considered. We start by considering zero-delay perfectly secret lossless transmission of a memoryless source. We derive bounds on the key rate and coding rate needed for perfect zero-delay secrecy. In this setting, we consider two models that differ by the ability of the eavesdropper to parse the bit-stream passing from the encoder to the legitimate decoder into separate messages. We also consider causal source coding with a fidelity criterion and side information at the decoder and the eavesdropper. Unlike the zero-delay setting where variable-length coding is traditionally used but might leak information on the source through the length of the codewords, in this setting, since delay is allowed, block coding is possible. We show that in this setting, a separation of encryption and causal source coding is optimal.

  • Zero-Delay and Causal Single-User and Multi-User Lossy Source Coding with Decoder Side Information

    We consider zero-delay, single-user, and multi-user source coding with an average distortion constraint and decoder side information. The zero-delay constraint translates into causal (sequential) encoder and decoder pairs as well as the use of instantaneous codes. For the single-user setting, we show that optimal performance is attained by time sharing at most two scalar encoder-decoder pairs, that use zero-error side information codes. Side information look-ahead is shown to be useless in this setting. Furthermore, we show that even without delay constraints, if either the encoder or decoder are restricted a priori to be scalar, the performance loss cannot be compensated by the other component, which can be scalar as well without further loss. Finally, we show that the multi-terminal source coding problem can be solved in the zero-delay regime and the rate-distortion region is provided.

  • Lossy distributed source coding using graphs

    In this letter, lossy distributed source coding using graphs is considered. This corresponds to the source coding part of the graph-based framework for transmission of analog correlated sources over the multiple-access channel (MAC). Consequently, it is shown that a pair of analog correlated sources can be reliably represented into a bipartite graph by allowing certain amount of distortion. An achievable rate-distortion region for this problem is also provided. Therefore, it can be concluded that, for transmission of any (both discrete and continuous) set of correlated sources over MACs, graphs can be used as discrete interface between source coding and channel coding modules.

  • Reduced-reference image quality assessment using distributed source coding

    This paper presents a reduced-reference image quality assessment scheme using distributed source coding for remotely monitoring image quality. In our scheme, an image server extracts a feature vector from the original image and transmits its Slepian-Wolf syndrome using an LDPC encoder. With the rate of the Slepian-Wolf bitstream chosen according to a predetermined admissible image quality, the receiver can reconstruct the feature vector using its received image, as side information, as long as the quality is higher than the admissible quality. Thus the receiver can determine the received image quality using the reconstructed feature vector. Simulation results show that distributed source coding can reduce the bit-rate of the feature vector by 50% and achieve better compression performance than conventional source coding.