Data Compression Conference, 1998. DCC '98. Proceedings

March 30 1998-April 1 1998

Filter Results

Displaying Results 1 - 25 of 118
  • Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (440 KB)
    Freely Available from IEEE
  • Joint source channel matching for a wireless communications link

    Publication Year: 1998
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (55 KB)

    Summary form only given. With the rapid growth of wireless communications systems there is an increasing demand for efficient image and video transmission. Significant performance gains can be obtained from joint source channel matching where system resources are assigned based on the tradeoff between data and redundancy. We develop a more general approach for joint source channel matching based o... View full abstract»

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

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

    Summary form only given. The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler (1994) has received considerable attention. BSLDCA achieves compression ratio closer to PPM, but with a faster execution speed than PPM. Arnavut and Magliveras (1997) described the theoretical basis for block sorting schemes in the case of permutations and introduced the Lexical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PRECIS: A method for fast compression of periodic halftones

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

    Summary form only given. The Periodic Run Edge Compression for Image Systems (PRECIS) is a simple, fast algorithm to compress bitonal images containing periodic halftones. Its compression of periodic halftones doubles and often quadruples the compression obtained using the commonly used MMR algorithm. Its software execution time in compressing periodic halftones has been measured to be as short as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid image compression scheme based on wavelet transform and adaptive context modeling

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

    Summary form only given. We propose a hybrid image compression scheme based on wavelet transform, HVS thresholding and L/sub /spl infin//-constrained adaptive context modelling. This hybrid system combines the strengths of the wavelet transform, the HVS thresholding and the adaptive context modelling to result in a near optimal compression scheme. The wavelet transform is very powerful in localizi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reversing the error-correction scheme for a fault-tolerant indexing

    Publication Year: 1998
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4 KB)

    Summary form only given. The article presents an innovative approach to approximate matching of multi-attribute objects based on reversing the conventional scheme of error-correction coding. The approximate matching problem primarily arises in information retrieval systems, which can store fuzzily described items and operate with nebulous searching criteria. To establish an approximate equivalence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossy compression of partially masked still images

    Publication Year: 1998
    Cited by:  Papers (11)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    Summary form only given. This article describes a component of the DejaVu color document image compression. The DejaVu scheme consists in separating the image into (a) a foreground layer containing text and drawings, and (b) a background layer containing background color and the pictures. These two components are then compressed using the most appropriate techniques. This article outlines a wavele... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature preserving lossy image compression using nonlinear PDEs

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

    Summary form only given. We consider the possibility of high loss compression of very noisy images such as images from ATR, ATM and surveillance imaging, in which images are taken in a high noise environment. Our goal is that after the high loss compression, the salient features (edges) of the images will be still preserved so that the shape and location of the objects can be well recognized. For ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A joint source-channel coding scheme for robust image transmission

    Publication Year: 1998
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (69 KB)

    Summary form only given. We propose a joint source-channel coding scheme for the transmission of images over noisy channels. In this scheme, the interaction between source coding and channel coding is through a small number of parameters. A robust source coder based on the classification of the discrete wavelet transform (DWT) coefficients of the image is coupled with a flexible error control sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical channel matched quantizer design and UEP for robust image transmission

    Publication Year: 1998
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (50 KB)

    Summary form only given. Channel matched quantization for image transmission over time varying channels reduces the effects of channel errors. The presence of variable length codes in compression standards like the JPEG cause error propagation due to bit errors. Unequal error protection (UEP) schemes have emerged as an effective method to combat catastrophic loss in the received signal due to burs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Higher compression from the Burrows-Wheeler transform by modified sorting

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

    Summary form only given. The Burrows-Wheeler transform (BWT) compression technique is based on sorting substrings of the input, and has a performance rivalling the best previously known techniques. We show that the ordering used in the sorting stage of the BWT, an aspect hitherto ignored, can have a significant impact on the size of the compressed data. We modify the sorting order in two separate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study on mult-lingual LZ77 and LZ78 text compression

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

    Summary form only given. We studied the effectiveness of this multi-lingual character sampling on Lempel-Ziv (LZ) compression algorithms. LZSS and LZW algorithms were chosen to represent LZ77 and LZ78 compression respectively in the study. They were modified to adapt the characteristics of non-English information such as Chinese. It is interesting to see that the Chinese LZW compression outperform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A perceptual preprocessor to segment video for motion estimation

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

    Summary form only given. The objective of motion estimation and motion compensation is to reduce the temporal redundancy between adjacent pictures in a video sequence. Motion estimation is usually performed by calculating an error metric, such as mean absolute error (MAE), for each block in the current frame over a displaced region in the previously reconstructed frame. The motion vector is attain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On accelerating fractal compression

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

    Summary form only given. Image data compression by fractal techniques has been widely investigated. Although its high compression ratio and resolution-free decoding properties are attractive, the encoding process is computationally demanding in order to achieve an optimal compression. This article proposes a fast fractal-based encoding algorithm (ACC) by using the intensity changes of neighboring ... 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 space-filling curves for bandwidth compression

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

    Summary form only given. By jointly optimizing source and channel codes, we can generally get less overall average distortion and more robustness to channel impairments than with separately designed source and channel codes. In many cases, however, it is difficult or sometimes impossible for a single coding scheme to achieve the least possible distortion for a large range of channel variations exc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive wavelet transforms for image coding using lifting

    Publication Year: 1998
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (77 KB)

    Summary form only given. Image compression relies on efficient representations of images, and within smooth image regions, the wavelet transform provides such a representation. However, near edges, wavelet coefficients decay slowly and are expensive to code. We focus on improving the transform by incorporating adaptivity. Construction of nonlinear filter banks has been discussed, but the question ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple pre-processors significantly improve LZ 1 compression

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

    Summary form only given. The effectiveness of the LZ 1 class of lossless adaptive data compression algorithms can, for many different types of data, be significantly improved by employing a dual stage compression/decompression process. A pre-processing stage first re-codes the input data stream in such a way as to make it more amenable to subsequent LZ 1 compression. To decode the data, the invers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Successive coefficient refinement for embedded lossless image compression

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

    Summary form only given. We consider here a new approach to successive coefficient refinement which speeds up embedded image compression and decompression. Rather than sending the binary refinement symbol typical of existing embedded coders, our algorithm uses a ternary refinement symbol, allowing the encoder to tell the decoder when its current approximation of a given wavelet coefficient is exac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fractal color compression in the L*a*b* uniform color space

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

    Summary form only given. We present comparative results obtained in the context of 24-bit true color image encoding by using searchless vs. search-based fractal compression techniques in a perceptually uniform color space. A pixel in the color space is represented as a vector with each component corresponding to a color channel. The least squares approximation of an image block by an iterated func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new compression scheme for syntactically structured messages (programs) and its application to Java and the Internet

    Publication Year: 1998
    Cited by:  Papers (4)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (89 KB)

    Summary form only given. The immense demand of required network bandwidth to load computer programs like Java applets or applications within an acceptable time makes efficient compression schemes highly desirable. Syntax-oriented coding (SOC) is a new compression scheme that is able to eliminate redundancy caused by syntactical restrictions. Current compression schemes with a lexical view of the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weighting of double exponential distributed data in lossless image compression

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

    Summary form only given. State-of-the-art lossless image compression schemes use a prediction scheme, a context model and an arithmetic encoder. The discrepancy between the predicted value and the actual value is regarded to be double exponentially distributed. The BT/CARPscheme was considered in Weinberger et al. (1996) as a means to find limits in lossless image compression. The scheme uses the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compression via guided parsing

    Publication Year: 1998
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (26 KB)

    Summary form only given. The reduction in storage size achieved by compressing a file translates directly into a reduction in transmission time when communicating the file. An increasingly common form of transmitted data is a computer program description. This paper examines the compression of source code, the high-level language representation of a program, using the language's context free gramm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Post-processing for low bit-rate wavelet-based image coding using multiscale edge characterization

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

    Summary form only given. At low bit rates, wavelet-based image coding is superior to most traditional block-based coding methods in that it does not introduce perceptually annoying blocking artifacts. However, the reconstructed images still suffer various coding artifacts at edges and continuous regions which are perceptually objectionable. Post-processing is an effective technique for improving i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line sprite encoding with large global motion estimation

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

    Summary form only given. A sprite which is an image composed of pixels belonging to a video object visible throughout a video segment is a very important concept proposed by MPEG4. Because of the search region limitation in the global motion estimation, the performance of traditional sprite coding technology is not satisfactory in the case of fast camera motion. Only enlarging the search region is... View full abstract»

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

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

    Summary form only given. The increasing importance of unicode for text files, for example with Java and in some modern operating systems, implies a possible increase of data storage space and data transmission time, with a corresponding need for data compression. However data compressors designed for traditional 8-bit byte data are not necessarily well matched to the peculiarities of unicode data.... View full abstract»

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