By Topic

Proceedings of the IEEE

Issue 11 • Date Nov. 2000

Filter Results

Displaying Results 1 - 14 of 14
  • Special issue on lossless data compression

    Publication Year: 2000, Page(s):1685 - 1688
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • Renewal theory and source coding

    Publication Year: 2000, Page(s):1692 - 1702
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB)

    Renewal theory provides a wavy to derive fundamental results about source coding and is useful in the analysis and design of many lossless data compression algorithms. We consider two very different applications of renewal theory to source coding. The first one results in a variable-length counterpart to the asymptotic equipartition property for unifilar Markov sources. The second application lead... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PPM performance with BWT complexity: a fast and effective data compression algorithm

    Publication Year: 2000, Page(s):1703 - 1712
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (169 KB)

    This paper introduces a new data compression algorithm. The goal underlying this new code design is to achieve a single lossless compression algorithm with the excellent compression ratios of the prediction by partial mapping (PPM) algorithms and the low complexity of codes based on the Burrows Wheeler Transform (BWT). Like the BWT-based codes, the proposed algorithm requires worst case O(n) compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The prevention of error propagation in dictionary compression with update and deletion

    Publication Year: 2000, Page(s):1713 - 1721
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    In earlier work, we presented the k-error protocol, a technique for protecting a dynamic dictionary lossless data compression method from error propagation as a result of errors in the communication channel or compressed file. In the worst case, the protocol only protects against k errors in total; however, it gives a very high probability protection against a sustained error rate. Here, we furthe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Off-line dictionary-based compression

    Publication Year: 2000, Page(s):1722 - 1732
    Cited by:  Papers (31)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    Dictionary-based modeling is a mechanism used in many practical compression schemes. In most implementations of dictionary-based compression the encoder operates on-line, incrementally inferring its dictionary of available phrases from previous parts of the message. An alternative approach is to use the full message to infer a complete dictionary in advance, and include an explicit representation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Off-line compression by greedy textual substitution

    Publication Year: 2000, Page(s):1733 - 1744
    Cited by:  Papers (19)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (287 KB)

    Greedy off-line textual substitution refers to the following approach to compression or structural inference. Given a long text string x, a substring W is identified such that replacing all instances of W in X except one by a suitable pair of pointers yields the highest possible contraction of X; the process is then repeated on the contracted text string until substrings capable of producing contr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line and off-line heuristics for inferring hierarchies of repetitions in sequences

    Publication Year: 2000, Page(s):1745 - 1755
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (142 KB)

    Hierarchical dictionary-based compression schemes form a grammar for a text by replacing each repeated string with a production rule. While such schemes usually operate on-line, making a replacement as soon as repetition is detected, off-line operation permits greater freedom in choosing the order of replacement. In this paper, we compare the on-line method with three off-line heuristics for selec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data compression using antidictionaries

    Publication Year: 2000, Page(s):1756 - 1768
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB)

    We give a new text-compression scheme based on forbidden words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressed and fully compressed pattern matching in one and two dimensions

    Publication Year: 2000, Page(s):1769 - 1778
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    We survey the complexity issues related to several algorithmic problems for compressed and fully compressed pattern matching in one- and two-dimensional texts without explicit decompression. Several related problems for compressed strings and arrays are considered: equality testing, computation of regularities, subsegment extraction, language membership, and solvability of word equations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The piecewise-constant image model

    Publication Year: 2000, Page(s):1779 - 1789
    Cited by:  Papers (31)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The piecewise-constant image model (PWC) is a new technique for lossless compression of palette images. PWC is a blend of traditional scanline-oriented and newer object-based methods. Remarkably, PWC delivers the best known compression across a wide variety palette of image types while delivering translation speeds comparable to highly tuned one-dimensional methods. This paper introduces the topic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless image coding via adaptive linear prediction and classification

    Publication Year: 2000, Page(s):1790 - 1796
    Cited by:  Papers (28)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (494 KB)

    In past years, there have been several improvements in lossless image compression. All the recently proposed state-of-the-art lossless image compressors can be roughly divided into two categories: single and double-pass compressors. Linear prediction is rarely used in the first category, while TMW, a state-of-the-art double-pass image compressor, relies on linear prediction for its performance. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless compression of continuous-tone images

    Publication Year: 2000, Page(s):1797 - 1809
    Cited by:  Papers (41)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (185 KB)

    In this paper, we survey some of the recent advances in lossless compression of continuous-tone images. The modeling paradigms underlying the state-of-the-art algorithms, and the principles guiding their design, are discussed in a unified manner. The algorithms are described and experimentally compared. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dr. C.J. de Groot and long-distance radio telegraphy between Indonesia and Holland

    Publication Year: 2000, Page(s):1810 - 1813
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (102 KB)

    Reviews efforts to establish independent long-wavelength wireless links between Europe and the East Indies that would ultimately result in a new understanding of the long-distance potential of wireless communications. Radiotelegraphy appeared to be the only viable alternative to this crucial but undependable physical link. The ultimate goal, however, was a direct radiotelegraph link between The Ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "discriminant-function-based minimum recognition error rate pattern-recognition approach to speech recognition"

    Publication Year: 2000, Page(s): 1814
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4 KB)

    First Page of the Article
    View full abstract»

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

Aims & Scope

The most highly-cited general interest journal in electrical engineering and computer science, the Proceedings is the best way to stay informed on an exemplary range of topics.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
H. Joel Trussell
North Carolina State University