Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)最新文献

Real-time VBR rate control of MPEG video based upon lexicographic bit allocation 基于字典位分配的MPEG视频实时VBR速率控制

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-10-01 DOI: 10.1109/DCC.1999.755687

Dzung T. Hoang

引用次数: 6

An asymptotically optimal data compression algorithm based on an inverted index 基于倒排索引的渐近最优数据压缩算法

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.785708

P. Subrahmanya

{"title":"An asymptotically optimal data compression algorithm based on an inverted index","authors":"P. Subrahmanya","doi":"10.1109/DCC.1999.785708","DOIUrl":"https://doi.org/10.1109/DCC.1999.785708","url":null,"abstract":"Summary form only given. An alternate approach to representing a data sequence is to associate with each source letter, the list of locations at which it appears in the data sequence. We present a data compression algorithm based on a generalization of this idea. The algorithm parses the data with respect to a static dictionary of phrases and associates with each phrase in the dictionary a list of locations at which the phrase appears in the parsed data. Each list of locations is then run-length encoded. This collection of run-length encoded lists constitutes the compressed representation of the data. We refer to the collection of lists as an inverted index. While in information retrieval systems, the inverted index is an adjunct to the main database used to speed up searching, we regard it here as a self-contained representation of the database itself. Further, our inverted index does not necessarily list every occurrence of a phrase in the data, only every occurrence in the parsing. This allows us to be asymptotically optimal in terms of compression, though at the cost of a loss in searching efficiency. We discuss this trade-off between compression and searching efficiency. We prove that in terms of compression, this algorithm is asymptotically optimal universally over the class of discrete memoryless sources. We also show that pattern matching can be performed efficiently in the compressed domain. Compressing and storing data in this manner may be useful in applications which require frequent searching of a large but mostly static database.","PeriodicalId":103598,"journal":{"name":"Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121992144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Joint image compression and classification with vector quantization and a two dimensional hidden Markov model 基于矢量量化和二维隐马尔可夫模型的联合图像压缩与分类

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.755650

Jia Li, R. Gray, R. Olshen

引用次数: 16

Modified Viterbi algorithm for predictive TCQ 预测TCQ的改进Viterbi算法

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.785689

T. Ji, W. Stark

{"title":"Modified Viterbi algorithm for predictive TCQ","authors":"T. Ji, W. Stark","doi":"10.1109/DCC.1999.785689","DOIUrl":"https://doi.org/10.1109/DCC.1999.785689","url":null,"abstract":"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 1024 samples. The optimal codebooks for a memoryless Laplacian source are used. Predictor coefficients for the 1st-order and 2nd-order predictors are {0.8456} and {1.3435, -0.5888}, respectively. Simulation results indicate that both PTCQ and H-PTCQ have about 3 dB gain over DPCM. H-PTCQ with 8-state convolutional code has about 0.2 to 0.3 db gain over PTCQ for the same trellis size; H-PTCQ with 256-state convolutional code has 0.05 to 0.1 dB gain over the PTCQ counterpart. Compared with a 2M-state PTCQ, the M-state H-PTCQ has the same computational complexity and uses half of the path memory. Since the performance improvement of an an 8-state PTCQ over a 4-state PTCQ is about 0.4 dB for a similar set of data, the 0.2 to 0.3 dB gain obtained by using H-PTCQ is quite remarkable. Notice that H-PTQ enables a transmitter to adapt performance according to the resource constraints without changing PTCQ receivers. It is also interesting to observe that the 0.1 dB gain of an 8-state TCQ against a 4-state TCQ plus the 0.3 dB gain of H-PTCQ is about the gain of an 8-state PTCQ over a 4-state PTCQ. The results for 256-state quantization also agree with this observation. Therefore, we conclude that most of the gain of a 2M- over M-state PTCQ comes from the better internal TCQ quantizer, and mostly from the better prediction by keeping more paths.","PeriodicalId":103598,"journal":{"name":"Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122226668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Zerotree coding of wavelet coefficients for image data on arbitrarily shaped support 任意形状支撑上图像数据小波系数的零树编码

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.785691

A. Kawanaka, V. Algazi

引用次数: 8

Quantized frame expansions as source-channel codes for erasure channels 作为擦除信道的源信道码的量化帧展开

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.755682

Vivek K Goyal, J. Kovacevic, M. Vetterli

引用次数: 113

On entropy-constrained residual vector quantization design 熵约束残差矢量量化设计

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.785683

Y. Gong, M. Fan, Chien-Min Huang

{"title":"On entropy-constrained residual vector quantization design","authors":"Y. Gong, M. Fan, Chien-Min Huang","doi":"10.1109/DCC.1999.785683","DOIUrl":"https://doi.org/10.1109/DCC.1999.785683","url":null,"abstract":"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 step, we propose a variation of the exhaustive search encoder that significantly speeds up encoding at no expense in terms of the rate-distortion performance; (ii) in the decoder update step, we propose a new method that simultaneously updates the codebooks of all stages; the method is to form and solve a certain least square problem and we show that both tasks can be done very efficiently; (iii) the Lagrangian of rate-distortion decreases at every step and thus this guarantees the convergence of the algorithm. We have performed some preliminary numerical experiments to test the proposed algorithm. Both random sources and still images are considered. For random sources, the size of training sequence is 2500 and the vector size is 4. For still images, the training set consists of monochrome images from the USC database and the vector size is 4/spl times/4.","PeriodicalId":103598,"journal":{"name":"Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126664659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Codes for data synchronization with timing 用于定时数据同步的代码

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.755694

N. Kashyap, D. Neuhoff

引用次数: 5

Complexity-distortion tradeoffs in vector matching based on probabilistic partial distance techniques 基于概率部分距离技术的向量匹配中的复杂性-失真权衡

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.755689

Krisda Lengwehasatit, Antonio Ortega

引用次数: 13

Graceful degradation over packet erasure channels through forward error correction 通过前向纠错，在包擦除通道上进行优雅的降级

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096) Pub Date : 1999-03-29 DOI: 10.1109/DCC.1999.755658

A. Mohr, E. Riskin, R. Ladner

引用次数: 105