By Topic

Data Compression Conference, 2007. DCC '07

Date 27-29 March 2007

Filter Results

Displaying Results 1 - 25 of 80
  • Data Compression Conference - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • Data Compression Conference - Title

    Publication Year: 2007, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (45 KB)
    Freely Available from IEEE
  • Data Compression Conference - Copyright

    Publication Year: 2007, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • Data Compression Conference - Table of contents

    Publication Year: 2007, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2007, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • The Capocelli Prize

    Publication Year: 2007, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • A Stochastic Model for Video and its Information Rates

    Publication Year: 2007, Page(s):3 - 12
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    We propose a stochastic model for video and compute its information rates. The model has two sources of information representing ensembles of camera motion and visual scene data (i.e. "realities"). The sources of information are combined generating a vector process that we study in detail. Both lossless and lossy information rates are derived. The model is further extended to account for realities... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms

    Publication Year: 2007, Page(s):13 - 22
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (139 KB) | HTML iconHTML

    Motion-compensated lifted wavelets have received much interest for video compression. While they are biorthogonal, they may substantially deviate from orthonormality due to motion compensation, even if based on an orthogonal or near-orthogonal wavelet. A temporal transform for video sequences that maintains orthonormality while permitting flexible motion compensation would be very desirable. We ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial Sparsity Induced Temporal Prediction for Hybrid Video Compression

    Publication Year: 2007, Page(s):23 - 32
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1463 KB) | HTML iconHTML

    In this paper we propose a new motion compensated prediction technique that enables successful predictive encoding during fades, blended scenes, temporally decorrelated noise, and many other temporal evolutions which force predictors used in traditional hybrid video coders to fail. We model reference frame blocks to be used in motion compensated prediction as consisting of two superimposed parts: ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Normalized maximum likelihood model of order-1 for the compression of DNA sequences

    Publication Year: 2007, Page(s):33 - 42
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    We present the NML model for classes of models with memory described by first order dependencies. The model is used for efficiently locating and encoding the best regressor present in a dictionary. By combining the order-1 NML with the order-0 NML model the resulting algorithm achieves a consistent improvement over the earlier order-0 NML algorithm, and it is demonstrated to have superior performa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Statistical Algorithm for Biological Sequence Compression

    Publication Year: 2007, Page(s):43 - 52
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (211 KB) | HTML iconHTML

    This paper introduces a novel algorithm for biological sequence compression that makes use of both statistical properties and repetition within sequences. A panel of experts is maintained to estimate the probability distribution of the next symbol in the sequence to be encoded. Expert probabilities are combined to obtain the final distribution. The resulting information sequence provides insight f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure induction by lossless graph compression

    Publication Year: 2007, Page(s):53 - 62
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    This work is motivated by the necessity to automate the discovery of structure in vast and ever-growing collection of relational data commonly represented as graphs, for example genomic networks. A novel algorithm, dubbed Graphitour, for structure induction by lossless graph compression is presented and illustrated by a clear and broadly known case of nested structure in a DNA molecule. This work ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-Description Coding by Dithered Delta-Sigma Quantization

    Publication Year: 2007, Page(s):63 - 72
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    In this paper we address the connection between the multiple-description (MD) problem and delta-sigma quantization. Specifically, we exploit the inherent redundancy due to oversampling in delta-sigma quantization, and the simple linear-additive noise model resulting from dithered lattice quantization, in order to construct a symmetric MD coding scheme. We show that the use of feedback by means of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Description Coding for Stationary and Ergodic Sources

    Publication Year: 2007, Page(s):73 - 82
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    We consider the problem of multiple description (MD) coding for stationary sources with the squared error distortion measure. The MD rate region is derived for the stationary and ergodic Gaussian sources, and is shown to be achievable with a practical transform lattice quantization scheme. Moreover, the proposed scheme is asymptotically optimal at high resolution for all stationary sources with fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless Transmission of Correlated Sources over a Multiple Access Channel with Side Information

    Publication Year: 2007, Page(s):83 - 92
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    In this paper, we consider lossless transmission of arbitrarily correlated sources over a multiple access channel. Characterization of the achievable rates in the most general setting is one of the long-standing open problems of information theory. We consider a special case of this problem where the receiver has access to correlated side information given which the sources are independent. We pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Functional Compression through Graph Coloring

    Publication Year: 2007, Page(s):93 - 102
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (206 KB) | HTML iconHTML

    We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y, a receiver wishes to compute f(X, Y) based on (encoded) information sent from X and Y in a distributed manner. A special case, f(X, Y) = (X, Y), is the classical question of distributed source coding considered by Slepian and Wolf (1973).... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential Compression of Executable Code

    Publication Year: 2007, Page(s):103 - 112
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (153 KB) | HTML iconHTML

    A platform-independent algorithm to compress file differences is presented here. Since most file updates consist of software updates and security patches, particular attention is dedicated to making this algorithm suitable to efficient compression of differences between executable files. This algorithm is designed so that its low-complexity decoder can be used in mobile and embedded devices. Compr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressed Delta Encoding for LZSS Encoded Files

    Publication Year: 2007, Page(s):113 - 122
    Cited by:  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (183 KB) | HTML iconHTML

    We explore the full compressed delta encoding problem in compressed texts, defined as the problem of constructing a delta file directly from the two given compressed files, without decompressing. We concentrate on the case where the given files are compressed using LZSS and propose solutions for the special cases involving substitutions only View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple Linear-Time Off-Line Text Compression by Longest-First Substitution

    Publication Year: 2007, Page(s):123 - 132
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5721 KB) | HTML iconHTML

    We consider grammar based text compression with longest-first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a new non-terminal symbol. We present a new text compression algorithm by simplifying the algorithm presented in S. Inenaga et al., (2003). We give a new formulation of the correctness proof introducing the sparse lazy suff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on Redundancy in Constrained Delay Arithmetic Coding

    Publication Year: 2007, Page(s):133 - 142
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large encoding or decoding delays exist. Therefore, to meet a finite delay constraint, it is necessary to intervene with the normal flow of the coding process, e.g., to insert fictitious symbols. This results in an inevitable c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Grayscale Stereo Image Coding with Unsupervised Learning of Disparity

    Publication Year: 2007, Page(s):143 - 152
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    Distributed compression is particularly attractive for stereo images since it avoids communication between cameras. Since compression performance depends on exploiting the redundancy between images, knowing the disparity is important at the decoder. Unfortunately, distributed encoders cannot calculate this disparity and communicate it. We consider the compression of grayscale stereo images, and de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge-Based Prediction for Lossless Compression of Hyperspectral Images

    Publication Year: 2007, Page(s):153 - 162
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (273 KB) | HTML iconHTML

    We present two algorithms for error prediction in lossless compression of hyperspectral images. The algorithms are context-based and non-linear, and use a one-band look-ahead, thus requiring a minimal storage buffer. The first algorithm (NPHI) predicts the pixel in the current band based on the information from its context. Prediction contexts are defined based on the neighboring causal pixels in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral Predictors

    Publication Year: 2007, Page(s):163 - 172
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1954 KB) | HTML iconHTML

    Many scientific, imaging, and geospatial applications produce large high-precision scalar fields sampled on a regular grid. Lossless compression of such data is commonly done using predictive coding, in which weighted combinations of previously coded samples known to both encoder and decoder are used to predict subsequent nearby samples. In hierarchical, incremental, or selective transmission, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Compression of Encrypted Video

    Publication Year: 2007, Page(s):173 - 182
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB) | HTML iconHTML

    We consider video sequences that have been encrypted uncompressed. Since encryption masks the source, traditional data compression algorithms are rendered ineffective. However, it has been shown that through the use of distributed source-coding techniques, the compression of encrypted data is in fact possible. This means that it is possible to reduce data size without requiring that the data be co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Decoder for Lossless Image Compression by Block Matching

    Publication Year: 2007, Page(s):183 - 192
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (181 KB) | HTML iconHTML

    A work-optimal O(lognlogM) time PRAM-EREW algorithm for lossless image compression by block matching was shown in L. Cinque et al., (2003), where n is the size of the image and M is the maximum size of the match. The design of a parallel decoder was left as an open problem. By slightly modifying the parallel encoder, in this paper we show how to implement the decoder in O(lognlogM) time with O(n/l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.