Browse Proceedings

We consider a setting relevant to the design of storage systems in which a list of defective storage blocks, as determined at manufacture time, is stored in a high-speed system controller memory to enable the efficient bypassing of defective blocks in a ...

Saturated patterns with don’t care like those emerged in biosequence motif discovery haveproven a valuable notion also in the design of lossless and lossy compression of sequence data. In independent endeavors, the peculiarities inherent to the ...

The past few years have witnessed several exciting results on compressed representation of a string T that supports efficient pattern matching, and the space complexity has been reduced to |T|H_k(T) + o(|T| log s) bits, where H_k(T) denotes the kth-...

We introduce an EDIF netlist graph-based compression algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains. The algorithm builds on the graph mining tool SUBDUE. Our algorithm, ...

Researchers have proposed using hardware data compression units within the memory hierarchies of microprocessors in order to improve performance, energy efficiency, and functionality. However, most past work, and in particular work on cache compression, ...

The Shannon rate-distortion function R(D) of a random process provides a lower bound to the minimal average distortion given a constraint on the average rate. When a positive source coding theorem with a fidelity criterion applies,the lower bound is ...

This paper presents a proof of the rate distortion function of a Poisson process with a queuing distortion measure that is in complete analogy with the proofs associated with the rate distortion functions of a Bernoulli source with Hamming distortion ...

We characterize the rate-distortion function for zero-mean stationary Gaussian sources under the MSE fidelity criterion and subject to the additional constraint that the distortion is uncorrelated to the input. The solution is given by two equations ...

A method is proposed for the compression of hyperspectral signature vectors on severely resource-constrained encoding platforms. The proposed technique, compressive-projection principal component analysis, recovers from random projections not only ...

We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered,for example, when dealing with hyperspectral imagery. An extension of the SPECK ...

In this paper a modification on the file syntax of the CCSDS Recommendation for Image Data Coding (CCSDS-122-B-1) is presented. With respect to the Recommendation, the proposed modification provides, among others, scalability by quality, spatial ...

Suppose a function of N real source variables X_1^N = (X_1, X_2, ..., X_N)is desired at a destination constrained to receive a limited number of bits.If the result of evaluating the function, Y = G(X_1^N), can be itselfencoded, this is the optimal ...

This paper proposes a new image compression scheme by introducing visual patterns to nonlinear interpolative vector quantization (IVQ). Input images are first distorted by a generic down-sampling so that some details are removed before compression. Then,...

A fully automated architecture for object-based region of interest (ROI) detection is proposed. ROI's are defined as regions containing user defined objects of interest, and an efficient algorithm is developed for the detection of such regions. The ...

This paper presents a scheme to design directional lapped transforms. Lapped transforms can be factorized into lifting steps. By introducing directional operator into each lifting step, the directional lapped transform is constructed. The directional ...

We propose a system for audio coding using the modulated complex lapped transform (MCLT). In general, it is difficult to encode signals using overcomplete representations without avoiding a penalty in rate-distortion performance. We show that the ...

Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow direct pattern searching on the compressed text up to 8 times faster than on ...

The sequential context modeling framework is generalized to a non-sequential one by context relaxation from consecutive suffix of the subsequences of symbols to the permutation of the preceding symbols as result of considering complex context structures ...

This paper proposes IPzip, a comprehensive suite of algorithms for compressing IP network packet headers and payloads. We propose an online algorithm for compressing packets in real-time for efficient transfer and an offline algorithm for efficient ...

Many science and engineering applications use high-resolution unstructured hexahedral meshes to model solid 3D shapes for finite element simulations. These simulations frequently dump the mesh and associated fields to disk for subsequent analysis, which ...

We identify an analytical expression for the distortion of a scalable video bitstream. Relying on the distortion expression, we propose a low complexity distortion-optimal Unequal Error Protection (UEP) method for the transmission of such video ...

The combination of intra prediction, transform, and quantization in the H.264/AVC video coding standard offers high compression performance in picture areas where inter prediction is unavailable or fails. Motivated from coding experiments with the ...

Rate distortion optimization with Lagrangian formulation is widely used in video encoder control and has proved effective in achieving a good trade-off between coding efficiency and computational complexity. It is generally interpreted as a source ...

This paper proposes a partial prediction approach for fast mode decision in H.264/AVC 4x4 intra-prediction, exploiting the inherent symmetry existing in the spatial prediction modes. The high compression efficiency of H.264 comes with a price of high ...

In this paper we propose a chunkless structure for multimedia distribution over peer-to-peer networks. With the proposed approach, the original multimedia packets are partitioned into several reduced packets whose transmission requires a fraction 1/R of ...