By Topic

Data Compression Conference, 2001. Proceedings. DCC 2001.

Date 27-29 March 2001

Filter Results

Displaying Results 1 - 25 of 50
  • Proceedings DCC 2001. Data Compression Conference

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (431 KB)
    Freely Available from IEEE
  • Universal lossless compression of piecewise stationary slowly varying sources

    Publication Year: 2001, Page(s):371 - 380
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB) | HTML iconHTML

    Universal lossless compression of parametric piecewise stationary sources with slow changes in the statistics between stationary segments that take place in unknown time intervals is investigated. The minimum description length (MDL) principle is derived for two different settings of this problem under the assumption that the parameter changes are linear over the change interval. In the first sett... View full abstract»

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

    Publication Year: 2001, Page(s):531 - 533
    Request permission for commercial reuse | PDF file iconPDF (118 KB)
    Freely Available from IEEE
  • Optimal code design for lossless and near lossless source coding in multiple access networks

    Publication Year: 2001, Page(s):263 - 272
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}i=1 and {Yi }i=1 is drawn i.i.d. according to the joint probability mass function (p.m.f.) p(x,y); the encoder for each source operates without knowledge of the other so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint source channel coding using arithmetic codes and trellis coded modulation

    Publication Year: 2001, Page(s):302 - 311
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    Previous work has indicated that using an arithmetic encoder with reserved probability space can provide powerful error detection and error correction when used with a sequential decoding algorithm. However, performance improvements were limited at high error rates, principally because of the lack of an explicit decoding tree. In this work a trellis coded modulation scheme is used to provide a con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multihypothesis motion estimation for video coding

    Publication Year: 2001, Page(s):341 - 350
    Cited by:  Papers (7)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Multihypothesis motion-compensating predictors combine several motion-compensated signals to predict the current frame of a video signal. This paper applies the wide-sense stationary theory of multihypothesis motion compensation for hybrid video codecs to multihypothesis motion estimation. This allows us to study the influence of the displacement error correlation on the efficiency of multihypothe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On variable length codes for iterative source/channel decoding

    Publication Year: 2001, Page(s):273 - 282
    Cited by:  Papers (72)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    We focus on a trellis-based decoding technique for variable length codes (VLCs) which does not require any additional side information besides the number of bits in the coded sequence. A bit-level soft-in/soft-out decoder based on this trellis is used as an outer component decoder in an iterative decoding scheme for a serially concatenated source/channel coding system. In contrast to previous appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semidefinite programs for the design of codes for delay-constrained communication in networks

    Publication Year: 2001, Page(s):183 - 192
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB) | HTML iconHTML

    We consider the problem of designing codes for the problem of delay-constrained communication in packet networks. We show how good codes for this problem can be characterized as the solution of a pair of semidefinite programs plus a rank constraint. Using this characterization, we formulate the design problem as one of finding suitable graph embeddings into Euclidean space, for a certain family of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressing XML with multiplexed hierarchical PPM models

    Publication Year: 2001, Page(s):163 - 172
    Cited by:  Papers (33)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB) | HTML iconHTML

    We established a working Extensible Markup Language (XML) compression benchmark based on text compression, and found that bzip2 compresses XML best, albeit more slowly than gzip. Our experiments verified that TXMILL speeds up and improves compression using gzip and bounded-context PPM by up to 15%, but found that it worsens the compression for bzip2 and PPM. We describe alternative appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing drift in DCT-based scalable video coding

    Publication Year: 2001, Page(s):351 - 360
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    When compressed video is transmitted over erasure-prone channels, errors will propagate whenever temporal or spatial prediction is used. Typical tools to combat this error propagation are packetization, re-synchronizing codewords, intra-coding, and scalability. In recent years, the concern over so-called “drift” has sent researchers toward structures for scalability that do not use enh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust predictive vector quantizer design

    Publication Year: 2001, Page(s):33 - 42
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB) | HTML iconHTML

    The design of predictive quantizers generally suffers from difficulties due to the prediction loop, which have an impact on the convergence and the stability of the design procedure. We previously proposed an asymptotically closed-loop approach to quantizer design for predictive coding applications, which benefits from the stability of open-loop design while asymptotically optimizing the actual cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal prefix-free codes that end in a specified pattern and similar problems: the uniform probability case

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

    In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobable words under the assumption that all codewords are restricted to belonging to an arbitrary language L. We examine how, given certain types of L, the structure of the minimum-cost code changes as n, the number of codewords, grows View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-time tradeoffs in the inverse B-W transform

    Publication Year: 2001, Page(s):439 - 448
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB) | HTML iconHTML

    Lossless text compression based on the Burrows-Wheeler transform (BWT) has become popular. Compression-time issues-MTF coding or the avoidance thereof (Wirth 2000), encoding the MTF values, sorting fast (Seward 2000)-have seen considerable investigation. Decompression-time issues remain underinvestigated. For some applications, decompression-time behaviour is a critical issue. For example, boot-ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parsing strategies for BWT compression

    Publication Year: 2001, Page(s):429 - 438
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    Block-sorting is an innovative compression mechanism introduced by Burrows and Wheeler (1994), and has been the subject of considerable scrutiny in the years since it first became public. Block-sorting compression is usually described as involving three steps: permuting the input one block at a time through the use of the Burrows-Wheeler transform (BWT); applying a move-to-front (MTF) transform to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A wavelet coder for masked images

    Publication Year: 2001, Page(s):93 - 102
    Cited by:  Papers (4)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB) | HTML iconHTML

    This paper presents an algorithm for the compression of images that have “don't care” regions within them. Such regions are specified by an additional binary image, the mask, which we assume is available at both the coder and the encoder (it is transmitted separately and without loss). Unlike previous approaches, which typically fill in the masked pixels with values geared toward good ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the hardness of finding optimal multiple preset dictionaries

    Publication Year: 2001, Page(s):411 - 418
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    Preset dictionaries for Huffman codes are used effectively in fax transmission and JPEG encoding. A natural extension is to allow multiple preset dictionaries instead of just one. We show, however, that finding optimal multiple preset dictionaries for Huffman and LZ77-based compression schemes is NP-hard View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptable binary entropy coder

    Publication Year: 2001, Page(s):391 - 400
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB) | HTML iconHTML

    We present a novel entropy coding technique which is based on recursive interleaving of variable-to-variable length binary source codes. The encoding is adaptable in that each bit to be encoded may have an associated probability estimate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small redundancy, and ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining PPM models using a text mining approach

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

    This paper introduces a novel switching method which can be used to combine two or more PPM models. The work derives from our earlier work on modelling English and text mining, and the approach takes advantage of both to help improve the compression performance significantly. The performance of the combination of models is at least as good as (and in many cases significantly better than) the best ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Successive refinement on trees: a special case of a new MD coding region

    Publication Year: 2001, Page(s):293 - 301
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    New achievability results for the L-stage successive refinement problem with L>2 are presented. These are derived from a recent achievability result for the more general problem of multiple description (MD) coding with L>2 channels. It is shown that successive refinability on chains implies successive refinability on trees and that memoryless Gaussian sources are successively refinable on ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressing the graph structure of the Web

    Publication Year: 2001, Page(s):213 - 222
    Cited by:  Papers (10)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB) | HTML iconHTML

    A large amount of research has recently focused on the graph structure (or link structure) of the World Wide Web. This structure has proven to be extremely useful for improving the performance of search engines and other tools for navigating the Web. However, since the graphs in these scenarios involve hundreds of millions of nodes and even more edges, highly space-efficient data structures are ne... View full abstract»

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

    Publication Year: 2001, Page(s):243 - 252
    Cited by:  Patents (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB) | HTML iconHTML

    This paper is about inferring markup information, a generalization of part-of-speech tagging. We use compression models based on a marked-up training corpus and apply them to fresh, unmarked, text. In effect, this technique builds filters that extract information from text in a way that is generalized because it depends on training text rather than preprogrammed heuristics. As illustrated, we use ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Can we do without ranks in Burrows Wheeler transform compression?

    Publication Year: 2001, Page(s):419 - 428
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB) | HTML iconHTML

    Compressors based on the Burrows Wheeler transform (1994) convert the transformed text into a string of (move-to-front) ranks. These ranks are then encoded with an Order-0 model, or a hierarchy of such models. Although these rank-based methods perform very well, we believe the transformation to MTF numbers blurs the distinction between individual symbols and is a possible cause of inefficiency. In... View full abstract»

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

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

    A network source code is an optimal source code for a network. To design network source codes, we require each node to have a single encoder, which jointly encodes all messages transmitted by that node, and a single decoder, which jointly decodes all messages arriving at that node. Given a distribution over the sources, the design of the network source code jointly optimizes all encoders and decod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint source-channel decoding of correlated sources over noisy channels

    Publication Year: 2001, Page(s):283 - 292
    Cited by:  Papers (43)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB) | HTML iconHTML

    We consider the case of two correlated binary information sequences. Instead of compressing the information using source coding, both sequences are independently channel encoded, and transmitted over an AWGN channel. The correlation between both sequences is exploited at the receiver, allowing reliable communications at signal to noise ratios very close to the theoretical limits established by the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Video residual coding using SPIHT and dependent optimization

    Publication Year: 2001, Page(s):113 - 122
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    We introduce a video residual coding technique based on wavelet transforms and set partitioning in hierarchical trees (SPIHT). In this scheme, wavelet coefficients that correspond to the same spatial location in the image domain are grouped together to form wavelet blocks. Each wavelet block is then converted to a SPIHT-compatible bit stream by an optimized SPIHT encoder minimizing the Lagrangian ... View full abstract»

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