Results 1  10
of
85
Distributed video coding
 PROC. OF THE IEEE 93 (2005) 71–83
, 2005
"... Distributed coding is a new paradigm for video compression, ..."
Abstract

Cited by 285 (12 self)
 Add to MetaCart
(Show Context)
Distributed coding is a new paradigm for video compression,
Distributed source coding for sensor networks
 In IEEE Signal Processing Magazine
, 2004
"... n recent years, sensor research has been undergoing a quiet revolution, promising to have a significant impact throughout society that could quite possibly dwarf previous milestones in the information revolution. MIT Technology Review ranked wireless sensor networks that consist of many tiny, low ..."
Abstract

Cited by 184 (2 self)
 Add to MetaCart
(Show Context)
n recent years, sensor research has been undergoing a quiet revolution, promising to have a significant impact throughout society that could quite possibly dwarf previous milestones in the information revolution. MIT Technology Review ranked wireless sensor networks that consist of many tiny, lowpower and cheap wireless sensors as the number one emerging technology. Unlike PCs or the Internet, which are designed to support all types of applications, sensor networks are usually mission driven and application specific (be it detection of biological agents and toxic chemicals; environmental measurement of temperature, pressure and vibration; or realtime area video surveillance). Thus they must operate under a set of unique constraints and requirements. For example, in contrast to many other wireless devices (e.g., cellular phones, PDAs, and laptops), in which energy can be recharged from time to time, the energy provisioned for a wireless sensor node is not expected to be renewed throughout its mission. The limited amount of energy available to wireless sensors has a significant impact on all aspects of a wireless sensor network, from the amount of information that the node can process, to the volume of wireless communication it can carry across large distances. Realizing the great promise of sensor networks requires more than a mere advance in individual technologies; it relies on many components working together in an efficient, unattended, comprehensible, and trustworthy manner. One of the enabling technologies for sensor networks is distributed source coding (DSC), which refers to the compression of multiple correlated sensor outputs [1]–[4] that do not communicate with each other (hence distributed coding). These sensors send their compressed outputs to a central point [e.g., the base station (BS)] for joint decoding. I
On the duality of Gaussian multipleaccess and broadcast channels
 IEEE Trans. Inf. Theory
, 2004
"... Abstract—We define a duality between Gaussian multipleaccess channels (MACs) and Gaussian broadcast channels (BCs). The dual channels we consider have the same channel gains and the same noise power at all receivers. We show that the capacity region of the BC (both constant and fading) can be writt ..."
Abstract

Cited by 99 (14 self)
 Add to MetaCart
(Show Context)
Abstract—We define a duality between Gaussian multipleaccess channels (MACs) and Gaussian broadcast channels (BCs). The dual channels we consider have the same channel gains and the same noise power at all receivers. We show that the capacity region of the BC (both constant and fading) can be written in terms of the capacity region of the dual MAC, and vice versa. We can use this result to find the capacity region of the MAC if the capacity region of only the BC is known, and vice versa. For fading channels we show duality under ergodic capacity, but duality also holds for different capacity definitions for fading channels such as outage capacity and minimumrate capacity. Using duality, many results known for only one of the two channels can be extended to the dual channel as well. Index Terms—Broadcast channel (BC), channel capacity, duality, fading channels, multipleinput multipleoutput (MIMO) systems, multipleaccess channel (MAC). I.
DataHiding Codes
 Proc. IEEE
, 2005
"... This tutorial paper reviews the theory and design of codes for hiding or embedding information in signals such as images, video, audio, graphics, and text. Such codes have also been called watermarking codes; they can be used in a variety of applications, including copyright protection for digital m ..."
Abstract

Cited by 47 (4 self)
 Add to MetaCart
(Show Context)
This tutorial paper reviews the theory and design of codes for hiding or embedding information in signals such as images, video, audio, graphics, and text. Such codes have also been called watermarking codes; they can be used in a variety of applications, including copyright protection for digital media, content authentication, media forensics, data binding, and covert communications. Some of these applications imply the presence of an adversary attempting to disrupt the transmission of information to the receiver; other applications involve a noisy, generally unknown, communication channel. Our focus is on the mathematical models, fundamental principles, and code design techniques that are applicable to data hiding. The approach draws from basic concepts in information theory, coding theory, game theory, and signal processing, and is illustrated with applications to the problem of hiding data in images. Keywords—Coding theory, data hiding, game theory, image processing, information theory, security, signal processing, watermarking. I.
Side information aware coding strategies for sensor networks
 IEEE J. Selected Areas Commun
"... Abstract—We develop coding strategies for estimation under communication constraints in treestructured sensor networks. The strategies have a modular and decentralized architecture. This promotes the flexibility, robustness, and scalability that wireless sensor networks need to operate in uncertain ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
(Show Context)
Abstract—We develop coding strategies for estimation under communication constraints in treestructured sensor networks. The strategies have a modular and decentralized architecture. This promotes the flexibility, robustness, and scalability that wireless sensor networks need to operate in uncertain, changing, and resourceconstrained environments. The strategies are based on a generalization of Wyner–Ziv source coding with decoder side information. We develop solutions for general trees, and illustrate our results in serial (pipeline) and parallel (hubandspoke) networks. Additionally, the strategies can be applied to other network information theory problems. They have a successive coding structure that gives an inherently less complex way to attain a number of prior results, as well as some novel results, for the Chief Executive Officer problem, multiterminal source coding, and certain classes of relay channels. Index Terms—Chief Executive Officer (CEO) problems, data fusion, distributed detection, distributed estimation, multiterminal source coding, rate distortion theory, relay channels, sensor networks, side information, Wyner–Ziv coding. I.
Distributed Bayesian hypothesis testing in sensor networks
 in Proc. Amer. Control Conf
, 2004
"... Abstract — We consider the scenario of N distributed noisy sensors observing a single event. The sensors are distributed and can only exchange messages through a network. The sensor network is modelled by means of a graph, which captures the connectivity of different sensor nodes in the network. The ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
Abstract — We consider the scenario of N distributed noisy sensors observing a single event. The sensors are distributed and can only exchange messages through a network. The sensor network is modelled by means of a graph, which captures the connectivity of different sensor nodes in the network. The task is to arrive at a consensus about the event after exchanging such messages. The focus of this paper is twofold: a) characterize conditions for reaching a consensus; b) derive conditions for when the consensus converges to the centralized MAP estimate. The novelty of the paper lies in applying belief propagation as a message passing strategy to solve a distributed hypothesis testing problem for a prespecified network connectivity. We show that the message evolution can be reformulated as the evolution of a linear dynamical system, which is primarily characterized by network connectivity. This leads to a fundamental understanding of as to which network topologies naturally lend themselves to consensus building and conflict avoidance. I.
On Joint SourceChannel Coding for the WynerZiv Source and the Gel'fandPinsker Channel
 IEEE Trans. Inform. Theory
, 2002
"... We consider the problem of lossy joint sourcechannel coding in a communication system where the encoder has access to channel state information (CSI) and the decoder has access to side information that is correlated to the source. This configuration combines the WynerZiv model of pure lossy source ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
We consider the problem of lossy joint sourcechannel coding in a communication system where the encoder has access to channel state information (CSI) and the decoder has access to side information that is correlated to the source. This configuration combines the WynerZiv model of pure lossy source coding with side information at the decoder and the Shannon/Gel'fandPinsker model of pure channel coding with CSI at the encoder. We prove a separation theorem for this communication system, which asserts that there is no loss in asymptotic optimality in applying first, an optimal WynerZiv source code and then, an optimal Gel'fandPinsker channel code. We then derive conditions for the optimality of a symbolbysymbol (scalar) sourcechannel code, and demonstrate situations where these conditions are met. Finally, we discuss a few practical applications, including of overlaid communication where the model under discussion is useful.
Successive refinement for the WynerZiv problem and layered code design
 IEEE Transactions on Signal Processing
, 2004
"... Driven by a host of applications, distributed source coding (DSC) has assumed renewed interest in recent years. WynerZiv coding (WZC), which deals with the ratedistortion problem with side information available only at the decoder, is one case of DSC. In this paper, we focus on successive refineme ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
(Show Context)
Driven by a host of applications, distributed source coding (DSC) has assumed renewed interest in recent years. WynerZiv coding (WZC), which deals with the ratedistortion problem with side information available only at the decoder, is one case of DSC. In this paper, we focus on successive refinement of the WynerZiv problem described in [1]. Similar to the problem in classic source coding, a successive refinement coding scheme for the WynerZiv problem consists of multistage encoders and decoders where each decoder uses all the information generated from previous encoding stages and the side information, which could be different from stage to stage. We call such a scheme successively refinable if the ratedistortion pair associated with any stage falls on the same WynerZiv ratedistortion curve given the corresponding side information. It was shown in [1] that if the side information for all stages are identical, the jointly Gaussian source with squared error distortion measure is successively refinable. We extend successive refinability from jointly Gaussian source to the more general type of sources that the difference between the source and the side information is Gaussian and independent of the side information. As a byproduct, we give an alternative proof that the WynerZiv problem for these sources has no rate loss, where this statement was recently shown in [2]. We then propose a layered (successive) coding scheme using nested scalar quantization and SlepianWolf coding of bit planes based on LDPC codes for the type of sources described above. Moreover, when ideal SlepianWolf coding is assumed, we show that our scheme is practically successively refinable, i.e., there is no performance loss due to layering. For the jointly Gaussian source, our layered coder performs 1.33 to 2.83 dB from the WynerZiv bound for rates ranging from 0.47 to 5.65 bits per sample. The full paper is available at
Superposition coding for sideinformation channels
"... Abstract—We present simple, practical codes designed for the binary and Gaussian dirtypaper channels. We show that the dirtypaper decoding problem can be transformed into an equivalent multipleaccess decoding problem, for which we apply superposition coding. Our concept is a generalization of the ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
(Show Context)
Abstract—We present simple, practical codes designed for the binary and Gaussian dirtypaper channels. We show that the dirtypaper decoding problem can be transformed into an equivalent multipleaccess decoding problem, for which we apply superposition coding. Our concept is a generalization of the nested lattices approach of Zamir, Shamai, and Erez. In a theoretical setting, our constructions are capable of achieving capacity using random component codes and maximumlikelihood decoding. We also present practical implementations of the constructions, and simulation results for both dirtypaper channels. Our results for the Gaussian dirtypaper channel are on par with the best known results for nested lattices. We discuss the binary dirtytape channel, for which we present a simple, effective coding technique. Finally, we propose a framework for extending our approach to general Gel’fand–Pinsker channels. Index Terms—Dirty paper, dirty tape, multipleaccess channel (MAC), side information, superposition coding. I.
Dynamic information and constraints in source and channel coding
, 2004
"... explore dynamics in source coding and channel coding. We begin by introducing the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. Such distortion side information is not only useful at the encoder but under certain conditi ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
explore dynamics in source coding and channel coding. We begin by introducing the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. Such distortion side information is not only useful at the encoder but under certain conditions knowing it at the encoder is optimal and knowing it at the decoder is useless. Thus distortion side information is a natural complement to WynerZiv side information and may be useful in exploiting properties of the human perceptual system as well as in sensor or control applications. In addition to developing the theoretical limits of source coding with distortion side information, we also construct practical quantizers based on lattices and codes on graphs. Our use of codes on graphs is also of independent interest since it highlights some issues in translating the success of turbo and LDPC codes into the realm of source coding. Finally, to explore the dynamics of side information correlated with the source, we consider fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding with feedforward (the dual