A survey on wireless multimedia sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An energy-efficient adaptive DSC scheme for wireless sensor networks
Signal Processing
Evaluating a feedback channel based transform domain Wyner-Ziv video codec
Image Communication
Wyner-Ziv coding of video with unsupervised motion vector learning
Image Communication
Symmetric distributed coding of stereo omnidirectional images
Image Communication
Side information estimation and new symmetric schemes for multi-view distributed video coding
Journal of Visual Communication and Image Representation
Advanced side information creation techniques and framework for Wyner-Ziv video coding
Journal of Visual Communication and Image Representation
Introducing skip mode in distributed video coding
Image Communication
Error-resilient scalable compression based on distributed video coding
Image Communication
Wyner-Ziv-based bidirectionally decodable video coding
Journal of Visual Communication and Image Representation
Successive refinement based Wyner-Ziv video compression
Image Communication
Information Sciences: an International Journal
Adaptive coset partition for distributed video coding
Signal Processing
Brief paper: Min-max optimal data encoding and fusion in sensor networks
Automatica (Journal of IFAC)
Low delay distributed video coding with refined side information
Image Communication
Side information generation with auto regressive model for low-delay distributed video coding
Journal of Visual Communication and Image Representation
Journal of Visual Communication and Image Representation
Practical data compression in wireless sensor networks: A survey
Journal of Network and Computer Applications
Cross-band noise model refinement for transform domain Wyner-Ziv video coding
Image Communication
Perceptual-based distributed video coding
Journal of Visual Communication and Image Representation
Distributed Video Coding: an overview of basics, research issues and solutions
International Journal of Ad Hoc and Ubiquitous Computing
Sprite-based generation of side information for multi-view Distributed Video Coding
Multimedia Tools and Applications
A hierarchical control scheme for energy quota distribution in hybrid distributed video coding
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Proceedings of the 20th ACM international conference on Multimedia
Energy- and Thermal-Aware Video Coding via Encoder/Decoder Workload Balancing
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
Multi-view codec with low-complexity encoding for Distributed Video Coding
Multimedia Tools and Applications
Wireless Personal Communications: An International Journal
Cross-layer coding improves quality and security in wireless video sensor networks
Proceedings of the First International Conference on Security of Internet of Things
Probabilistic motion-compensated prediction in distributed video coding
Multimedia Tools and Applications
Progressively refined wyner-ziv video coding for visual sensors
ACM Transactions on Sensor Networks (TOSN)
Low-cost prioritization of image blocks in wireless sensor networks for border surveillance
Journal of Network and Computer Applications
Low complexity distributed video coding
Journal of Visual Communication and Image Representation
Toward fast Wyner-Ziv video decoding on multicore processors
Multimedia Tools and Applications
Maximum likelihood motion compensation for distributed video coding
Integrated Computer-Aided Engineering
Hi-index | 754.84 |
Let{(X_{k}, Y_{k}) }^{ infty}_{k=1}be a sequence of independent drawings of a pair of dependent random variablesX, Y. Let us say thatXtakes values in the finite setcal X. It is desired to encode the sequence{X_{k}}in blocks of length n into a binary stream of rateR, which can in turn be decoded as a sequence{ hat{X}_{k} }, wherehat{X}_{k} in hat{ cal X}, the reproduction alphabet. The average distortion level is(1/n) sum^{n}_{k=1} E[D(X_{k},hat{X}_{k})], whereD(x,hat{x}) geq 0, x in {cal X}, hat{x} in hat{ cal X}, is a preassigned distortion measure. The special assumption made here is that the decoder has access to the side information{Y_{k}}. In this paper we determine the quantityR ast (d), defined as the infimum ofratesRsuch that (withvarepsilon > 0arbitrarily small and with suitably largen)communication is possible in the above setting at an average distortion level (as defined above) not exceedingd + varepsilon. The main result is thatR ast (d) = inf [I(X;Z) - I(Y;Z)], where the infimum is with respect to all auxiliary random variablesZ(which take values in a finite setcal Z) that satisfy: i)Y,Zconditionally independent givenX; ii) there exists a functionf: {cal Y} times {cal Z} rightarrow hat{ cal X}, such thatE[D(X,f(Y,Z))] leq d. LetR_{X | Y}(d)be the rate-distortion function which results when the encoder as well as the decoder has access to the side information{ Y_{k} }. In nearly all cases it is shown that whend > 0thenR ast(d) > R_{X|Y} (d), so that knowledge of the side information at the encoder permits transmission of the{X_{k}}at a given distortion level using a smaller transmission rate. This is in contrast to the situation treated by Slepian and Wolf [5] where, for arbitrarily accurate reproduction of{X_{k}}, i.e.,d = varepsilonfor anyvarepsilon >0, knowledge of the side information at the- encoder does not allow a reduction of the transmission rate.