DCC
2008
IEEE
14 years 6 months ago
2008
IEEE
In this paper we introduce an adaptive technique for compressing small quantities of text which are organized as a rooted directed graph. We impose a constraint on the technique s...
DCC
2008
IEEE
14 years 6 months ago
2008
IEEE
DCC
2008
IEEE
14 years 6 months ago
2008
IEEE
DCC
2008
IEEE
14 years 6 months ago
2008
IEEE
Motivated by sensor networks, we consider the fusion storage of correlated sources in a database, such that any subset of them may be efficiently retrieved in the future. Only st...
DCC
2008
IEEE
14 years 6 months ago
2008
IEEE
We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the m...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
We investigate the usage of edge-based inpainting as an intra prediction method in block-based image compression. The joint utilization of edge information and the well-known Lapl...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
DCC
2008
IEEE
14 years 11 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....