By Topic

Proceedings DCC 2000. Data Compression Conference

28-30 March 2000

Filter Results

Displaying Results 1 - 25 of 92
  • Proceedings DCC 2000. Data Compression Conference

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (348 KB)
    Freely Available from IEEE
  • Trees, windows and tiles for wavelet image compression

    Publication Year: 2000, Page(s):283 - 292
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (134 KB)

    We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of probability models for images, the k-rectangular tiling of an image, which is formed by partitioning the image into k rectangular regions and generating the coefficients within each region by using a probability model se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of YK algorithm to the Internet transmission of Web-data: implementation issues and modifications

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

    Summary form only given. Recently, Yang and Kieffer (2000) proposed a novel lossless grammar-based data compression algorithm, called the YK algorithm, in which a greedy sequential grammar transform is applied to the original data to construct an irreducible context free grammar, which is encoded indirectly by using an arithmetic coder. The basic implementation of the YK encoding algorithm consist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Product code and recurrent alternative decoding for wireless image transmission

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

    Summary form only given. We have developed a novel channel coding scheme for image transmission over wireless channels. A key component of this scheme is the construction of the product code using a convolutional code and a recursive systematic code (RSC) in the horizontal and vertical directions, respectively. High performance transmission has been achieved through an innovative recurrent alterna... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree-based search for ECVQ

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

    Summary form only given. We propose two new tree-based search algorithms for vector quantizers using an additive weighted distance measure, such as ECVQ (entropy constrained vector quantization) (Chou et al., 1989). Both algorithms are based on a recursive space division technique, and use a bounding object at each node of the tree, in order to quickly eliminate subsets of the codebook during the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive post-processing for region-based fractal image compression

    Publication Year: 2000
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (246 KB)

    Summary form only given. Region-based fractal image compression (Chang et al., 1997) is an attractive variation of fractal image compression algorithm. By segmenting an image into variable sizes of quadtree blocks and then merging these blocks into regions, this algorithm has the potential to encode a still image with a very low bit rate. However, highly visible artifacts become annoying when the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical models for term compression

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

    Summary form only given. Computing systems frequently deal with symbolic tree data structures, which are also known as terms in universal algebra and logic. Our goal is to develop universal, effective and efficient term compression techniques superior to specialized or universal compression techniques currently available. Our approach is to use knowledge of term structure to build accurate univers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelet coding of 3-D shape data using space-frequency quantization

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

    Summary form only given. Efficient representations of three dimensional object shape have attracted wide attention for transmission of computer graphics data and for interactive design in manufacturing. Polygonal meshes which consist of connectivity data of the vertices and their geometry data are often used for representing an object shape. The connectivity of the vertices is efficiently coded wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Seismic data compression using GenLOT: towards "optimality"?

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

    Summary form only given. Seismic data compression is desirable in geophysics for both storage and transmission stages. Wavelet coding methods have generated interesting developments, including a real-time field test trial in the North Sea in 1995. Previous work showed that GenLOT with basic optimization also outperforms state-of-the-art biorthogonal wavelet coders for seismic data. In this paper, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QccPack: an open-source software library for quantization, compression, and coding

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

    Summary form only given. We describe the QccPack software package, an open-source collection of library routines and utility programs for quantization, compression, and coding of data. QccPack is written to expedite data compression research and development by providing general and reliable implementations of common compression techniques. Functionality of the current release includes entropy codi... View full abstract»

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

    Publication Year: 2000
    Cited by:  Papers (15)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (46 KB)

    Summary form only given. Test categorization is the assignment of natural language texts to predefined categories based on their concept. The use of predefined categories implies a "supervised learning" approach to categorization, where already-classified articles which effectively define the categories are used as "training data" to build a model that can be used for classifying new articles that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PPM*-style context sorting compression method using a prefix list

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

    Summary form only given. We present a new implementation of the context sorting data compression method (Yokoo, 1997), which is an on-line adaptive algorithm for text compression. Our key idea is to utilize a new data structure called a prefix list (Yokoo, 1999). The original context sorting compression method, which uses neither explicit modeling nor arithmetic coding can be viewed as a symbol ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modification to the Huffman coding of JPEG's baseline compression algorithm

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

    Summary form only given. In a DCT block of a compressed image, the density of non-zero AC coefficients and their size decrease as the block is scanned in the zigzag order. This paper presents a minor modification to the Huffman coding phase of the JPEG baseline algorithm to exploit this redundancy for further compression. Our encoder divides each block into two roughly equal halves (bands) and cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient successive elimination algorithm for block-matching motion estimation

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

    Summary form only given. Low power VLSI video compression processors are in high demand for the emerging wireless video applications. Video compression processors include VLSI implementation of a motion estimation algorithm. Many motion estimation algorithms are found in the literature. Some of them are fast but cannot guarantee an optimal solution; they can be stuck in local optima. Such algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient low-bit rate motion compensation technique based on quadtree

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

    Summary form only given. A quadtree structured motion compensation technique effectively utilizes the motion content of a frame as oppose to a fixed size block motion compensation technique. In this paper, we propose a novel quadtree-structured region-wise motion compensation technique that divides a frame into equilateral triangle blocks using the quadtree structure. Arbitrary partition shapes ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic progressive transmission for deep space communications

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

    Summary form only given. We present an integrated system for the intelligent progressive transmission of data for deep space communications. This work is motivated by the realization that much more information can be collected by imaging and remote sensing equipment than can be transmitted through downlink channels. The goal of this work was to extend the idea of progressive transmission by incorp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protection of regions of interest against data loss in a generalized multiple description framework

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

    Summary form only given. We present a simple and efficient scheme for protecting a region of interest (ROI) in an image sent across generalized multiple description networks. To increase the probability that the ROI is received with high quality, we extend the unequal loss protection framework of MD-SPIHT by adding more redundancy to the ROI than to other parts of the image. The SPIHT algorithm or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Internet-adaptive image compression

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

    Summary form only given. The contribution of this paper is an extension of the pruned tree-structured hierarchical vector quantization (PTSHVQ) algorithm, with a focus on designing and benchmarking a complete Internet-aware system for the real-time delivery of compressed images. We extend the PTSHVQ algorithm to enable the encoder to use a combination of "coarse" and "fine" rate control mechanisms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spatially coherent discrete wavelet transform - accessing the localization property for data compression

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

    Summary form only given. Wavelets intrinsically give us the capability of localized signal decomposition and analysis in space and frequency. We present the recursive merge filter (RMF) discrete wavelet transform (DWT) algorithm, that organizes intermediate coefficients with respect to both space and frequency. This allows close coupling and pipelining with the encoder, fine grained coding, and "c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data compression with truncated suffix trees

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

    Summary form only given. The suffix tree is an efficient data structure used for Ziv-Lempel coding schemes. We propose a new data structure called the k-truncated suffix tree (k-TST), which is a truncated version of the suffix tree. While the suffix tree maintains all substrings of a given string, the k-TST stores the substrings of length at most k, where k is a constant. Hence the truncated suffi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding of canonical Huffman codes with look-up tables

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

    Summary form only given. This paper presents an efficient algorithm for decoding canonical Huffman codes with lookup tables. Canonical codes are a subclass of Huffman codes, that have a numerical sequence property, i.e., codewords with the same length are binary representations of consecutive integers. In the case of decoding with look-up tables we read a number of bits at each step of the decodin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High performance Lempel-Ziv compression using optimized longest string parsing and adaptive Huffman window size

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

    Summary form only given. We present optimizations that improve the compression and computational efficiency of Lempel-Ziv (LZ77) and Huffman algorithms. The compression performance of the LZ77 algorithm can be improved by using an optimized longest match parsing strategy. Another factor that can be considered is the size of the reference to the matching string, which can vary due to the secondary ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wireless image transmission using multiple-description based concatenated codes

    Publication Year: 2000
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (31 KB)

    Summary form only given. This work introduces a multiple-description product code which aims at optimally generating multiple, equally-important wavelet image descriptions from an image encoded by the popular SPIHT image coder. Because the SPIHT image coder is highly sensitive to errors, forward error correction is used to protect the image against bit errors occurring in the channel. The error-co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of image activity on lossy and lossless coding performance

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

    Summary form only given. When we compress a variety of multimedia images using a fixed wavelet filter, the PSNR values vary widely. Similarly in lossless image compression using a fixed integer wavelet transform, the bit rates can vary sharply. These large variations can be attributed to the image activity measure (IAM). We define and use a number of IAM from image variance, edges, wavelet coeffic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On zonal morphological approach to natural language texts processing

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

    Summary form only given. We discuss some actual problems of natural language processing. We consider the flexile language case. We propose a zonal morphologically based model instead of the traditional word based one. If we deal with flexile language there should be an interim layer of language units. We assume that the morphs layer should be considered. It seems to be natural and non-restrictive.... View full abstract»

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