Sciweavers

111 search results - page 13 / 23
» From irreducible representations to locally decodable codes
Sort
View
TIP
2008
108views more  TIP 2008»
13 years 7 months ago
Geometry-Based Distributed Scene Representation With Omnidirectional Vision Sensors
Abstract--This paper addresses the problem of efficient representation of scenes captured by distributed omnidirectional vision sensors. We propose a novel geometric model to descr...
Ivana Tosic, Pascal Frossard
TMI
2010
251views more  TMI 2010»
13 years 2 months ago
3-D Scalable Medical Image Compression With Optimized Volume of Interest Coding
We present a novel 3-D scalable compression method for medical images with optimized volume of interest (VOI) coding. The method is presented within the framework of interactive te...
Victor Sanchez, Rafeef Abugharbieh, Panos Nasiopou...
DCC
2008
IEEE
14 years 7 months ago
Noise-Shaped Predictive Coding for Multiple Descriptions of a Colored Gaussian Source
It was recently shown that the symmetric multiple-description (MD) quadratic rate-distortion function for memoryless Gaussian sources and two descriptions can be achieved by dithe...
Jan Østergaard, Ram Zamir, Yuval Kochman
ICIP
2010
IEEE
13 years 5 months ago
Deterministic structured network coding for WWAN video broadcast with cooperative peer-to-peer repair
Recent research has exploited the multi-homing property (one terminal with multiple network interfaces) of modern devices to improve communication performance in wireless networks...
Xin Liu, Gene Cheung, Chen-Nee Chuah
CORR
2007
Springer
60views Education» more  CORR 2007»
13 years 7 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap