By Topic

Data Compression Conference, 1996. DCC '96. Proceedings

March 31 1996-April 3 1996

Filter Results

Displaying Results 1 - 25 of 85
  • Author index

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (87 KB)
    Freely Available from IEEE
  • An algorithmic study on lossless image compression

    Publication Year: 1996, Page(s):150 - 159
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    The author discusses how to reduce model complexity for improving both coding and computational efficiency. Some of the topics discussed are: prediction via context error modeling, context selection for entropy coding, context hierarchy and selection and performance evaluation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LOCO-I: a low complexity, context-based, lossless image compression algorithm

    Publication Year: 1996, Page(s):140 - 149
    Cited by:  Papers (228)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    LOCO-I (low complexity lossless compression for images) is a novel lossless compression algorithm for continuous-tone images which combines the simplicity of Huffman coding with the compression potential of context models, thus “enjoying the best of both worlds.” The algorithm is based on a simple fixed context model, which approaches the capability of the more complex universal contex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless compression of grayscale images via context tree weighting

    Publication Year: 1996, Page(s):132 - 139
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    In this article we report on a study of how to use the context tree weighting (CTW) algorithm for lossless image compression. This algorithm has been shown to perform optimally, in terms of redundancy, for a wide class of data sources. Our study shows that this algorithm can successfully be applied to image compression even in its basic form. We also report on possible modifications of the basic C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-distortion based temporal filtering for video compression

    Publication Year: 1996, Page(s):122 - 131
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    We consider the temporal DPCM loop at the heart of most modern high performance video coders. Targeting low bitrate-low complexity video applications, it is shown that DPCM is inefficient in this region. The DPCM codec is analyzed in the low bitrate region and rate-distortion optimal modifications are proposed that do not violate the low complexity requirement. The proposed modifications involve n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Morphological motion field representation for region-based image sequence coding

    Publication Year: 1996, Page(s):112 - 121
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    We introduce a novel region-based video compression framework that uses a morphological operation to efficiently capture motion correspondences between consecutive frames in an image sequence. Our coder is built on the observation that the motion field associated with typical image sequences can be segmented into component motion subfield “clusters” associated with distinct objects or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient cost measures for motion compensation at low bit rates

    Publication Year: 1996, Page(s):102 - 111
    Cited by:  Papers (8)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    We make a case that, even with severe efficiency constraints, taking the number of bits to code each motion vector into account when estimating motion for video compression results in significantly better performance at low bit rates, using simulation studies on established benchmark image sequences. In particular, we examine an algorithm that differs from a “vanilla” implementation of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image compression with iterated function systems, finite automata and zerotrees: grand unification

    Publication Year: 1996
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    The paper deals with analysis, generalizations and unifications of the latest group of powerful image compression techniques: fractal image compression with iterated function systems (IFS), Culik's compression with finite automata and Shapiro's embedded coding of wavelet coefficients using zerotrees. All three techniques achieve premium results by exploiting properties of self-similarity of typica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Average redundancy rate of the Lempel-Ziv code

    Publication Year: 1996, Page(s):92 - 101
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    It was conjectured that the average redundancy rate, rn, for the Lempel-Ziv code (1978) is Θ(loglog n/log n) where n is the length of the database sequence. However, it was also known that for infinitely many n the redundancy rn is bounded from the below by 2/log n. We settle the above conjecture in the negative by proving that for a memoryless source the average redund... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bi-level document image compression using layout information

    Publication Year: 1996
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    Most bi-level images stored on computers today comprise scanned text, and are stored using generic bi-level image technology based either on classical run-length coding, such as the CCITT Group 4 method, or on modern schemes such as JBIG that predict pixels from their local image context. However, image compression methods that are tailored specifically for images known to contain printed text can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting clustering in inverted file compression

    Publication Year: 1996, Page(s):82 - 91
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    Document databases contain large volumes of text, and currently have typical sizes into the gigabyte range. In order to efficiently query these text collections some form of index is required, since without an index even the fastest of pattern matching techniques results in unacceptable response times. One pervasive indexing method is the use of inverted files, also sometimes known as concordances... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global and local distortion inference during embedded zerotree wavelet decompression

    Publication Year: 1996
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    Summary form only given. Local distortion inference is proposed as an alternative to assuming a spatially uniform error for image compression applications requiring careful error analysis. This paper presents an algorithm for inferring estimates of the L2-norm distortion (root-mean-square or RMS error) for the embedded zerotree wavelet (EZW) algorithm while maintaining its good rate-dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal bit allocation for biorthogonal wavelet coding

    Publication Year: 1996, Page(s):387 - 395
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    This paper shows how to derive bit allocations for biorthogonal wavelet coders which result in minimum reconstruction error. It is shown that the effect of using biorthogonal filters is to weight the amount of quantization error which appears in the reconstructed output. The amount of weighting can be determined from the biorthogonal filters used and is a measure of the closeness of the biorthogon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image operations using a semi-compressed contour tree image definition

    Publication Year: 1996
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (36 KB)

    The contour tree file format has been used as a suitable storage format for most image types. The technique stores unique regions into a hierarchical data structure which defines the complete raster image. This data structure is called a contour tree. It compares very favourable with other lossless coding schemes on all image format types including, bi-level and reduced colour images as well as tr... View full abstract»

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

    Publication Year: 1996, Page(s):73 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    We introduce a new approach to the problem of optimal compression when a source code produces multiple codewords for a given symbol. It may seem that the most sensible codeword to use in this case is the shortest one. However, in the proposed free energy approach, random codeword selection yields an effective codeword length that can be less than the shortest codeword length. If the random choices... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel input/output impact on sparse matrix compression

    Publication Year: 1996
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    Sparse matrices efficiently store structured information, particularly when represented in compressed formats. The advantages of using compressed formats rather than expanded representations are reduced storage space and faster computation achieved by avoiding processing the zero elements. We address the I/O bottleneck associated with the compression operation. We show that such a bottleneck can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid block-based/segment-based video compression at very low bit rate

    Publication Year: 1996
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    An algorithmic architecture of video compression at very low bit rate is presented. This architecture incorporates block-based as well as segment-based coding algorithms and manages them in a cooperative way in which different approaches are applied to different image frames iteratively: I and P frames are coded by block-based algorithm and O frames are coded by segment-based algorithm. An extra d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel compression with cooperative dictionary construction

    Publication Year: 1996, Page(s):200 - 209
    Cited by:  Papers (25)  |  Patents (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    It is often desirable to compress or decompress relatively small blocks of data at high bandwidth and low latency (for example, for data fetches across a high speed network). Sequential compression may not satisfy the speed requirement, while simply splitting the block into smaller subblocks for parallel compression yields poor compression performance due to small dictionary sizes. We consider an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern matching image compression

    Publication Year: 1996
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    We propose a non-transform image compression scheme based on approximate pattern matching, that we name pattern matching linage compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image. We consider both the Hamming distance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Device selective quantization for reversible wavelets

    Publication Year: 1996
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB)

    Compression with reversible embedded wavelets (CREW) consists of three major parts: a wavelet transform, an embedded context model, and a binary entropy coder. The wavelet transform is a special implementation of high quality wavelet which provides perfect reconstruction with finite precision coefficients. The context model describes the wavelet coefficients in a particular order with conditional ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-based motion compensated compression for synthetic animations

    Publication Year: 1996
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Advances in rendering hardware and software over the last decade have led to a steady increase in the popularity of computer-generated animations. This is especially apparent in the entertainment industry as synthetic animations are being used in films, CD-ROMs and video games. The scientific community also makes heavy use of synthetic animations in visualizing data sets. A problem with synthetic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending RD-OPT with global thresholding for JPEG optimization

    Publication Year: 1996, Page(s):379 - 386
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    In this paper, the RD-OPT algorithm for optimizing discrete cosine transform quantization tables [Ratnakar and Livny, 1995] is extended to incorporate global thresholding. Performance gains are possible by zeroing off some DCT coefficients in DCT-based image compression. We describe a global thresholding scheme, in which the zeroing thresholds for coefficients can be arbitrarily different from tho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The application of wavelets to lossless compression and progressive transmission of floating point data in 3-D curvilinear grids

    Publication Year: 1996
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    Many times in computational fluid dynamics (CFD) work very large datasets are produced on remote machines. This vast amount of data must often be moved to a local machine for post processing and visualization. However, this can be time consuming because of the large quantity of data that must be transmitted. Compressing the data can speed up the transmission and save several hours of the researche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refining image compression with weighted finite automata

    Publication Year: 1996, Page(s):359 - 368
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    Weighted finite automata (WFA) generalize finite automata by attaching real numbers as weights to states and transitions. As shown by Culik and Kari (1994, 1995) WFA provide a powerful tool for image generation and compression. The inference algorithm for WFA subdivides an image into a set of nonoverlapping range images and then separately approximates each one with a linear combination of the dom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressing semi-structured text using hierarchical phrase identifications

    Publication Year: 1996, Page(s):63 - 72
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    This paper takes a compression scheme that infers a hierarchical grammar from its input, and investigates its application to semi-structured text. Although there is a huge range and variety of data that comes within the ambit of “semi-structured”, we focus attention on a particular, and very large, example of such text. Consequently the work is a case study of the application of gramma... View full abstract»

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