By Topic

Data Compression Conference, 1999. Proceedings. DCC '99

29-31 March 1999

Filter Results

Displaying Results 1 - 25 of 105
  • Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (390 KB)
    Freely Available from IEEE
  • Single-resolution compression of arbitrary triangular meshes with properties

    Publication Year: 1999, Page(s):247 - 256
    Cited by:  Papers (22)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB)

    We propose a new layering structure to partition an arbitrary triangular mesh (no-manifold and arbitrary-genus) into generalized triangle strips. An efficient and flexible encoding of the connectivity, vertex coordinates and attribute data yields excellent single-resolution compression. This scheme gracefully solves the "crack" problem and also prevents error propagation while providing efficient ... View full abstract»

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

    Publication Year: 1999, Page(s):564 - 566
    Request permission for commercial reuse | PDF file iconPDF (380 KB)
    Freely Available from IEEE
  • On taking advantage of similarities between parameters in lossless sequential coding

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

    Summary form only given. In sequential lossless data compression algorithms the data stream is often transformed into short subsequences that are modeled as memoryless. Then it is desirable to use any information that each sequence might provide about the behaviour of other sequences that can be expected to have similar properties. Here we examine one such situation, as follows. We want to encode,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint design of progressive fixed-rate source-channel codes

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

    Summary form only given. The combination of jointly optimized rate compatible punctured convolutional (RCPC) codes and channel-matched tree-structured vector quantizers (CM-TSVQ) is shown to provide improved performance, in some cases, compared to the use of CM-TSVQ. The embedded nature of the RCPC codes and CM-TSVQ is inherited by the jointly optimized combination so that the resulting coder is i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general-purpose compression scheme for databases

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

    Summary form only given. Current adaptive compression schemes such as GZIP and COMPRESS are impractical for database compression as they do not allow random access to individual records. A compression algorithm for general-purpose database systems must address the problem of randomly accessing and individually decompressing records, while maintaining compact storage of data. The SEQUITUR algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design consideration for multi-lingual cascading text compressors

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

    Summary form only given. We study the cascading of LZ variants to Huffman coding for multilingual documents. Two models are proposed: the static model and the adaptive (dynamic) model. The static model makes use of the dictionary generated by the LZW algorithm in Chinese dictionary-based Huffman compression to achieve better performance. The dynamic model is an extension of the static cascading mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A perceptual-based video coder for error resilience

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

    Summary form only given. Error resilience is an important requirement when errors occur during video transmission. The video transmitted over the Internet is usually a packetized stream and thus the common errors for the Internet video are due to packet loss, caused by buffer overflows in routers, late arrival of packets, and bit errors in the network. This loss results in single or multiple macro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An open interface for probabilistic models of text

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

    Summary form only given. An application program interface (API) for meddling sequential text is described. The API is intended to shield the user from details of the modelling and probability estimation process. This should enable different implementations of models to be replaced transparently in application programs. The motivation for this API is work on the use of textual models for applicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Word-based compression methods for large text documents

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

    Summary form only given. We present a new compression method, called WLZW, which is a word-based modification of classic LZW. The algorithm is two-phase, it uses only one table for words and non-words (so called tokens), and a single data structure for the lexicon is usable as a text index. The length of words and non-words is restricted. This feature improves the compress ratio achieved. Tokens o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image coding using Markov models with hidden states

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

    Summary form only given. Lossless image coding may be performed by applying arithmetic coding sequentially to probabilities conditioned on the past data. Therefore the model is very important. A new image model is applied to image coding. The model is based on a Markov process involving hidden states. An underlying Markov process called the slice process specifies D rows with the width of the imag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-distortion optimized spatial scalability for DCT-based video coding

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

    Summary form only given. We present our work on rate-distortion (RD) optimized spatial scalability for MC-DCT based video coding. Extending our work on RD optimized coding from the single layered to the multi-layered framework, we incorporate the additional inter-layer coding dependencies present in a multilayered framework into the set of permissible coding parameters. We employ the Lagrangian ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On entropy-constrained residual vector quantization design

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

    Summary form only given. Entropy-constrained residual vector quantization (EC-RVQ) has been shown to be a competitive compression technique. Its design procedure is an iterative process which typically consists of three steps: encoder update, decoder update, and entropy coder update. We propose a new algorithm for the EC-RVQ design. The main features of our algorithm are: (i) in the encoder update... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorted sliding window compression

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

    Summary form only given. Sorted sliding window compression (SSWC) uses a new model (sorted sliding window model, SSWM) to encode strings efficiently, which appear again while encoding a symbol sequence. The SSWM holds statistics of all strings up to a certain length k in a sliding window of size n. The compression program can use the SSWM to determine if the string of the next symbols are already ... View full abstract»

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

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

    Summary form only given. We present an efficient algorithm for compressing the data necessary to represent an arbitrary cutting plane extracted from a three-dimensional curvilinear data set. The cutting plane technique is an important visualization method for time-varying 3D simulation results since the data sets are often so large. An efficient compression algorithm for these cutting planes is es... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resynchronizing variable-length codes for robust image transmission

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

    Summary form only given. This paper considers instantaneous prefix codes with possibly unequal codeword lengths but specific codewords, such as a Huffman code. Resynchronizing VLC (RVLC) contain one or more synchronizing codewords that resynchronize the decoder regardless of any previous data. Previous applications of optimal resynchronizing VLC have been limited to sources with alphabets of sizes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite automata and regularized edge-preserving wavelet transform scheme

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

    Summary form only given. We present an edge-preserving image compression technique based on the wavelet transform and iterative constrained least square regularization. This approach treats image reconstruction from lossy image compression as the process of image restoration. It utilizes the edge information detected from the source image as a priori knowledge for the subsequent reconstruction. Im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Motion estimation using long-term motion vector prediction

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

    Summary form only given. This paper presents a motion estimation technique for the coding of video sequences that is based on long-term temporal prediction. The motion vector of a moving object is tracked from one frame to another using a projection method. The traced motion vector is used as a starting point for the motion estimation search algorithm. The motion estimation algorithm used is based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified Viterbi algorithm for predictive TCQ

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

    Summary form only given. A hybrid trellis-tree search algorithm, the H-PTCQ, which has the same storage requirement as PTCQ and, is presented. We assume 2 survivor paths are kept at each state. It is straightforward to extend the algorithm to the cases where n/spl ges/2. Simulation is conducted over 20-second speech samples using DPCM, PTCQ and H-PTCQ. The data sequence is truncated into blocks of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resynchronization properties of arithmetic coding

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

    Summary form only given. Arithmetic coding is a popular and efficient lossless compression technique that maps a sequence of source symbols to an interval of numbers between zero and one. We consider the important problem of decoding an arithmetic code stream when an initial segment of that code stream is unknown. We call decoding under these conditions resynchronizing an arithmetic code. This pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint optical flow motion compensation and video compression using hybrid vector quantization

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

    Summary form only given. We propose a video coding and delivery scheme which is geared towards low bit-rate and real-time performance requirements. We use a hybrid vector quantization scheme, with finite state wavelet-based hierarchical lookup vector quantization (FSWHVQ) for coding motion vectors, which embeds the Horn and Schunck optical flow algorithm in table-lookups, and uses lattice vector q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data compression for the next-generation space telescope

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

    Summary form only given. The next-generation space telescope (NGST) will produce about 600 GB/day, assuming we use the NASA yardstick 8k/spl times/8k NIR camera (16 bits/pixel), save and transmit 64 non-destructive read-outs per image, and the camera is in continuous use (about 80 observations/day, 10/sup 3/ s each). However, with an L2 halo orbit, the NASA NGST study estimates a downlink rate of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressing ATM streams on-line

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

    Summary form only given. Asynchronous transfer mode (ATM) is one of the state-of-the art network protocols nowadays. A main characteristic of an ATM network is that its switches should be fairly simple and inexpensive. As a result, a significant part of the network cost is in the cost of the links. So by increasing the network traffic we can send over a given link, we will certainly increase the e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved joint source-channel decoding for variable-length encoded data using soft decisions and MMSE estimation

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

    Summary form only given. We develop improved joint source-channel (JSC) methods for decoding variable length encoded data based on residual source redundancy. Until very recently, all JSC methods based on residual redundancy assumed fixed length codewords. Recently, a practically realizable system which performed best over a significant range of channel conditions consisting of inner binary convol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast multi-match Lempel-Ziv

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

    Summary form only given. One of the most popular encoders in the literature is the LZ78, which was proposed by Ziv and Lempel (1978). We establish a recursive way to find the longest m-tuple match. We prove the following theorem that shows how to obtain a longest (m+1)-tuple match from the longest m-tuple match. It shows that a (m+1)-tuple match is the concatenation of the first (m-1) words of the... View full abstract»

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