Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

[1991] Proceedings. Data Compression Conference

8-11 April 1991

Filter Results

Displaying Results 1 - 25 of 91
  • Image compression

    Publication Year: 1991, Page(s):474 - 475
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (55 KB)

    Summary form only given. The author surveys the menagerie of quantization and compression algorithms in the specific context of image compression and provides some general comparisons based on performance, complexity, and side benefits of particular coding techniques.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data compression in end-to-end information systems for NASA space science missions

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

    Summary form only given. The unique characteristics of compressed data have important implications to the design of space science data systems, science applications, and data compression techniques. The sequential nature of data dependence between each of the sample values within a block of compressed data introduces an error multiplication/propagation factor which compounds the effects of communi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overview of the EOS Data and Information System

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

    Summary form only given. A distributed, evolutionary system, EOSDIS will be implemented in six elements, developed in parallel: (1) an early 'Version 0' built on existing Distributed Active Archive Centers (DAACs), including interoperability among DAACs and improved access by scientists; (2) an EOSDIS Core System (ECS) under one contract; (3) unique capabilities provided by each DAAC; (4) Science ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Moderate Resolution Imaging Spectrometer. An EOS facility instrument candidate for application of data compression methods

    Publication Year: 1991, Page(s):468 - 471
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (114 KB)

    Summary form only given. MODIS is a multispectral imaging system to be flown on the Earth Observing System (EOS) in the late 1990's. The system will be composed of two cross-track scanning instruments. One instrument is called MODIS-N (nadir), indicating a multispectral scanner that will not be tilted and provide a continuous cross-track scan. The other instrument is called MODIS-T (tilt), indicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Waveform data compression with exact recovery

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

    Summary form only given. A data compression technique has been developed for efficient communication and storage of seismic waveform data. The technique is also useful with similar kinds of continuous waveform data. It uses a special version of the linear predictive coding method, along with secondary bi-level sequence coding. The principal feature of this two-stage technique is that it provides e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VLSI implementation of a vector quantization processor

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

    Summary form only given. This presentation contains a discussion of the needs for a hardware Vector Quantization processor and the trade-offs involved in its design and implementation. The Codebook Processor Chip (CPC16) is a VQ processor capable of finding a full-search best match on sixteen codevectors in parallel. Maximum vector size is 625 samples. Full search of larger codebooks is possible b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A very high speed noiseless data compression chip for space imaging applications

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

    Summary form only given. The same logic design was implemented with a CMOS process in two ASIC technologies, gate array and standard cell. The noiseless compression algorithm and chip implementations were specific to the requirements of the Earth Observing System High-Resolution Imaging Spectrometer (HIRIS) instrument.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A very high speed lossless compression/decompression chip set

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

    Summary form only given. The chip set is designed to be able to compress and decompress different types of data. It will handle quantization from 4 through 14 bits per pixel and supports nearest neighbor prediction or using an externally supplied predictor. The DPCM part of the compressor and decompressor can be totally bypassed. The algorithm put into silicon is the Rice Algorithm. The chip set p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • V.42bis and other Ziv-Lempel variants

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

    Summary form only given, substantially as follows. The V.42bis standard for data compressing modems is discussed from algorithmic, experimental, practical, theoretical, and marketing standpoints. On a test set of five 100-Kbyte text and executable files, the compression ratios are found to be markedly inferior to those of several other algorithms, notably the Cleary-Witten adaptive Markov code and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using fractal geometry for image compression

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

    Summary form only given. The authors present methods of fractal geometry powerful and general enough to encode a wide variety of images. They consider probabilistic finite generators, the basic idea being the interpretation of strings over some alphabet as rational coordinates and languages and relations as sets of points (images). Encoding is conceptually simple, and allows for an efficient imple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal data compression algorithms by using full tree models

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

    Summary form only given. A brief description and results of analysis of splitting and merging for constructing and updating full trees is provided. Since all the leaves are assumed to have equal probability, using these two tree-updating procedures the variable-to-fixed length codes are realized. Two algorithms are suggested. One is devised by modifying the Ziv-Lempel algorithm. The number of leav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2-D discrete cosine transform array processor using non-planar connections

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

    Summary form only given. The authors present a noble implementation of a two-level pipelined array processor that can perform 2-dimensional discrete cosine transform using nonplanar connections among processing elements which are internally bit-serial pipelined. The designs are derived by systematic mapping based on representing an algorithm and its implementation in an n-dimensional grid and rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trends in audio and speech compression for storage and real-time communication

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

    Summary form only given. Advances in speech compression are generally driven by the need to conserve transmission rate or bandwidth, while maintaining an ability to reconstruct the speech at the receiver with good fidelity. For real-time communication a constant transmission rate and low signal delay for processing are additional requirements. For speech storage applications, variable rate compres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transform coding of monochrome and color images using trellis coded quantization

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

    Summary form only given. Trellis coded quantization (TCQ) is incorporated into a transform coding structure for an average encoding rate of 1 bit/pixel. Both fixed-rate and entropy-constrained TCQ-based systems are investigated. 256*256 pixel, 8-bit gray level images and 24-bit color images are encoded using both TCQ- and scalar quantizer-based schemes to provide comparisons on the basis of peak-s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3-D image compression for X-ray CT images using displacement estimation

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

    Summary form only given. The images used in this test are 87 slices of a head from a GE 9800 X-ray CT scanner. A slice is taken every 3 mm. Each slice is 512*512 pixels with 12 bits per pixel data. Objective measures show that the DEI coding scheme yields better compression performance than the 2-D DCT, since it takes advantage of correlation between adjacent slices along the body.<> View full abstract»

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

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

    Summary form only given. Noticing that a Huffman code is independent of the order in which the characters appear in the text, the author views the source-text as columns of characters where words appear as rows. The character frequency tables are compiled with respect to character positions within the column of words, ie., a frequency table is constructed for the first character of all the words, ... View full abstract»

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

    Publication Year: 1991
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (25 KB)

    Summary form only given. This paper considers the size of indexes, provides a formal definition of an index, describes three possible representations of indexes (list, array and tree) and identifies various techniques currently used for index compression.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A systolic architecture for LZ based decompression

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

    Summary form only given. A parallel architecture is proposed for decompression of data compressed using the Lempel-Ziv technique. This paper reports ongoing work towards realizing high speed VLSI hardware for the decompression process. The semi-systolic architecture aims at reducing the interconnect area and global communication, thereby increasing the clock speed. The algorithm has been mapped on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal processing and compression for image capturing systems using a single-chip sensor

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

    Summary form only given. Two images are used to demonstrate a step-by-step procedure from raw captured camera data to color hardcopies. The corresponding statistics of both images reveals the efficiency of compression and processing. Prints of intermediate results demonstrate the observed effects of the processing at various steps of the procedure.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Satellite data archives algorithm

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

    Summary form only given. SOH telemetry data with intelligent compression will achieve ratios from 100:1 to 5000:1 with the data becoming more lossy as the compression ratio increases. An archival system using an intelligent compressor will permit putting large amounts of data on a media such as a laser compact disc and eliminate most of the physical storage problems. On-line retrieval will be avai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduction in power system load data training sets size using fractal approximation theory

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

    Summary form only given. Fractal dimension is further used in reconstruction of forecasting data by iterated function system. Due to the generalisation property of artificial neural networks, the proposed method results in significant savings in computational time. The original fractal structure of data is preserved in forecasting.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate distortion performance of VQ and PVQ compression algorithms

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

    Summary form only given. This paper investigates the performance for memoryless sources and sources with memory by using vector quantization to encode and decode the source data. By modeling an image to be a Markov source, the authors suggest a lower bound estimate of the rate-distortion function for the image with memory which can be used to evaluate the performance of VQ (Vector Quantization) an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pictorial data compression using array grammars

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

    Summary form only given. The relationships between array grammars and pictures are illustrated. More specifically, given a simple picture, the author explains how to find an array grammar which has the capability of generating this picture. The problem of array production minimization, time and space complexity analyses, pictorial knowledge, the entity-relationship model, the size and shape of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a vector quantization algorithm of image data

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

    Summary form only given. This paper describes VQ techniques that use simple and fixed codebooks. The computation of the codebook is based on the statistical distribution of the intensity mean and standard deviation of vectors in the image. A formula is given for the expected signal to noise ratio versus image compression ratio. Non-adaptive codebook vectors have uniform entries based on the averag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimization approach for removing blocking effects in transform coding

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

    Summary form only given. This paper proposes a new approach which can be applied to conventional transform coding without introducing additional information or significant blurring. It exploits the correlation between intensity values of boundary pixels of two neighboring blocks. Specifically, it is based on the theoretical and empirical observation that under mild assumptions, quantization of tra... View full abstract»

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