Sciweavers

336 search results - page 55 / 68
» Compression of Samplable Sources
Sort
View
VTC
2010
IEEE
153views Communications» more  VTC 2010»
13 years 5 months ago
H.264 Wireless Video Telephony Using Iteratively-Detected Binary Self-Concatenated Coding
— In this contribution we propose a robust H.264 coded wireless video transmission scheme using iteratively decoded self-concatenated convolutional coding (SECCC). The proposed S...
Nasruminallah, Muhammad Fasih Uddin Butt, Soon Xin...
ICDCS
2007
IEEE
14 years 1 months ago
Automated Storage Reclamation Using Temporal Importance Annotations
This work focuses on scenarios that require the storage of large amounts of data. Such systems require the ability to either continuously increase the storage space or reclaim spa...
Surendar Chandra, Ashish Gehani, Xuwen Yu
GLOBECOM
2006
IEEE
14 years 1 months ago
Linear Coherent Decentralized Estimation
Abstract—We consider the distributed estimation of an unknown vector signal in a resource constrained sensor network with a fusion center. Due to power and bandwidth limitations,...
Jinjun Xiao, Shuguang Cui, Zhi-Quan Luo, Andrea J....
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 7 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
TIT
2010
153views Education» more  TIT 2010»
13 years 2 months ago
On the information rates of the plenoptic function
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
Arthur L. da Cunha, Minh N. Do, Martin Vetterli