{"title":"Data compression using encrypted text","authors":"R. Franceschini, A. Mukherjee","doi":"10.1109/DCC.1996.488369","DOIUrl":"https://doi.org/10.1109/DCC.1996.488369","url":null,"abstract":"Abstract only given. Presents an algorithm for text compression that exploits the properties of the words in a dictionary to produce an encryption of given text. The basic idea is to define a unique encryption or signature of each word in the dictionary by replacing certain characters in the words by a special character \"*\" and retain a few characters so that the word is still retrievable. The question is whether we can develop a better signature of the text before compression so that the compressed signature uses less storage than the original compressed text. This indeed is possible as our experimental results confirm. For any cryptic text the most frequently used character is \"*\" and the standard compression algorithms can effectively exploit this redundancy in an effective way. Our algorithm produces the best lossless compression rate reported to date in the literature. One basic assumption of our algorithm is that the system has access to a dictionary of words used in all the texts along with a corresponding \"cryptic\" dictionary. The cost of this dictionary is amortized over the compression savings for all the text files handled by the organization. If two organizations wish to exchange information using our compression algorithm, they must share a common dictionary. We used ten text files from the English text domain to test our algorithm.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133458329","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}
{"title":"Optimal bit allocation under multiple rate constraints","authors":"Antonio Ortega","doi":"10.1109/DCC.1996.488340","DOIUrl":"https://doi.org/10.1109/DCC.1996.488340","url":null,"abstract":"We present a new Lagrangian-based iterative technique for rate-distortion optimization under multiple rate constraints. We show how for sets of \"linear\" constraints this technique can be proven to be optimal up to a convex hull approximation. As an application we consider the problem of optimal buffer-constrained bit allocation. Our technique can be used to find an excellent approximation to the solutions achieved using dynamic programming. In cases where the buffer size is relatively large our approach shows a significant reduction in complexity as compared to dynamic programming.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123262027","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}
{"title":"Lapped orthogonal vector quantization","authors":"Henrique S. Malvar, G. Sullivan, G. Wornell","doi":"10.1109/DCC.1996.488337","DOIUrl":"https://doi.org/10.1109/DCC.1996.488337","url":null,"abstract":"The blocking artifacts that arise in the use of traditional vector quantization (VQ) schemes can, in general, be virtually eliminated via an efficient lapped VQ strategy. With lapped VQ, blocks are obtained from the source in an overlapped manner, and reconstructed via superposition of overlapped codevectors. The new scheme, which we term lapped orthogonal vector quantization (LOVQ), requires no increase in bit rate and, in contrast to other proposed approaches, no significant increase in computational complexity or memory requirements. Attractively, the use of LOVQ also leads to a modest increase in coding gain over traditional VQ schemes of comparable complexity.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117079171","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}
{"title":"Combination coding: a new entropy coding technique","authors":"Roger Fawcett","doi":"10.1109/DCC.1996.488366","DOIUrl":"https://doi.org/10.1109/DCC.1996.488366","url":null,"abstract":"Summary form only given. Entropy coding is defined to be the compression of a stream of symbols taken from a known symbol set where the probability of occurrence of any symbol from the set at any given point in the stream is constant and independent of any known occurrences of any other symbols. Shannon and Fano showed that the information of such a sequence could be calculated. When measured in bits the information represents the optimum compressed length of the original sequence. If information about sequential redundancy is known better compression may be possible by one of the substitution coding techniques of Ziv and Lempel. In the absence of any such information, entropy coding provides an optimum coding strategy. Huffman posed an optimal variable word length coding technique. Many years later the arithmetic coding technique was formulated by IBM which provided compression close to the optimum. Combination coding is as efficient as arithmetic coding and is very fast as it only requires basic integer operations for both the compression and decompression stages. The technique is in fact for the entropy coding of a binary sequence but by the use of a binary tree, the entropy coding of a sequence of any number of symbols can be reduced to the entropy coding of a number of binary sequences.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129823563","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}
{"title":"Compression of aerial ortho images based on image denoising","authors":"A. Langi, W. Kinsner","doi":"10.1109/DCC.1996.488378","DOIUrl":"https://doi.org/10.1109/DCC.1996.488378","url":null,"abstract":"Abstract only given. Discusses the compression of an important class of computer images, called aerial ortho images, that result from geodetic transformation computations [Kinsner, 1994]. The computations introduce numerical noise, making the images nearly incompressible losslessly because of their high entropy. The use of classical lossy compression schemes is also not desirable because their effects on the original image are unknown. We then propose the use of image denoising coupled with lossless image compression, that preserves selected image characteristics. Two denoising schemes for a compression ratio of 2:1 are compared. The first scheme is based on a Donoho's (1992) wavelet shrinking scheme which preserves image smoothness. We study the effect of various shrinking parameter values on the compression ratio and image quality, where 35.5 dB peak signal-to-noise ratio (PSNR) is obtained for a compression ratio of 2.03:1. This approach preserves high-frequency information, so that sharp edges do not become blurred as in classical filtering methods. This is critically important, because the main feature of ortho images is in its flatness and its precision of edge position. The second scheme is based on preserving pixel predictability [Kostelich and Schreiber, 1993), leading to a variant of planar predictive coding. This approach adds, to the edge preserving capability, the limitation in pixel deviation between the original and denoised images to be within one grayscale level. As a result, two different predictive coding schemes achieve a compression ratio of 2:1 at 49.9 dB and 51.2 dB PSNR.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128330521","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}
{"title":"The application of wavelets to lossless compression and progressive transmission of floating point data in 3-D curvilinear grids","authors":"A. Trott, R. Moorhead, J. McGinley","doi":"10.1109/DCC.1996.488390","DOIUrl":"https://doi.org/10.1109/DCC.1996.488390","url":null,"abstract":"Many times in computational fluid dynamics (CFD) work very large datasets are produced on remote machines. This vast amount of data must often be moved to a local machine for post processing and visualization. However, this can be time consuming because of the large quantity of data that must be transmitted. Compressing the data can speed up the transmission and save several hours of the researchers' time. Progressive transmission can further increase efficiency of the visualization process by giving researchers an approximation of the data very quickly. They can then make a decision based on this approximation about whether to continue the transmission or, if the data is determined to be undesirable, to abort it. A method of lossless compression using wavelets is presented that enables progressive transmission of CFD data in Plot-3D format, a standard format for CFD data. Given a CFD data set, the floating point data is first converted to double-precision floating point format. Although the conversion to double-precision floating point numbers doubles the size of the data set, most of the extra precision retains the value of zero. It can therefore be compressed very well using Huffman codes.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127889762","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}
{"title":"Distortion-limited vector quantization","authors":"Peter J. Hahn, V., J. Mathews","doi":"10.1109/DCC.1996.488339","DOIUrl":"https://doi.org/10.1109/DCC.1996.488339","url":null,"abstract":"This paper presents a vector quantization system that limits the maximum distortion introduced to a pre-selected threshold value. This system uses a recently introduced variation of the L/sub /spl infin// distortion measure that attempts to minimize the occurrences of quantization errors above a preselected threshold. The vectors are first coded using the new distortion measure. The quantization error vectors in which at least one entry is above the threshold are again coded using a residual vector quantizer. The pixels of the input image where the quantisation errors are still above the threshold are scalar quantized to force all the errors under the specified threshold. An experimental result is included in which all the error magnitudes are constrained to be below fifteen. This image was coded using 0.85 bits per pixel with a relatively simple multiplier-free vector quantizer and without entropy coding.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133206403","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}
{"title":"A high speed motion estimator using 2-D log search algorithm","authors":"N. Ling, R. Advani","doi":"10.1109/DCC.1996.488380","DOIUrl":"https://doi.org/10.1109/DCC.1996.488380","url":null,"abstract":"Summary form only given. This paper describes the design of a high speed motion estimator using the 2-D log search algorithm. The architecture consists of 5 simple processing elements (PE) where each PE is capable of computing the sum-of-absolute-difference (SAD) to exploit the parallelism. For each step in the 2-D log search procedure, the 5 SADs of the 5 search points are computed in parallel. The design is implemented using Verilog and synthesized using Synopsys. Simulations show that the architecture is able to generate the motion vector for each 16/spl times/16 macroblock in 14.58 /spl mu/s for 3-step log search, and 24.30 /spl mu/s for 5-step log search. The architecture is thus well suited for encoding MPEG2 video up to MP@ML.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115223649","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}
{"title":"Parallel compression with cooperative dictionary construction","authors":"P. Franaszek, J. T. Robinson, Joy A. Thomas","doi":"10.1109/DCC.1996.488325","DOIUrl":"https://doi.org/10.1109/DCC.1996.488325","url":null,"abstract":"It is often desirable to compress or decompress relatively small blocks of data at high bandwidth and low latency (for example, for data fetches across a high speed network). Sequential compression may not satisfy the speed requirement, while simply splitting the block into smaller subblocks for parallel compression yields poor compression performance due to small dictionary sizes. We consider an intermediate approach, where multiple compressors jointly construct a dictionary. The result is parallel speedup, with compression performance similar to the sequential case.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124460726","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}
M. Gormish, A. Zandi, E. L. Schwartz, A. Keith, M. Boliek
{"title":"Device selective quantization for reversible wavelets","authors":"M. Gormish, A. Zandi, E. L. Schwartz, A. Keith, M. Boliek","doi":"10.1109/DCC.1996.488372","DOIUrl":"https://doi.org/10.1109/DCC.1996.488372","url":null,"abstract":"Compression with reversible embedded wavelets (CREW) consists of three major parts: a wavelet transform, an embedded context model, and a binary entropy coder. The wavelet transform is a special implementation of high quality wavelet which provides perfect reconstruction with finite precision coefficients. The context model describes the wavelet coefficients in a particular order with conditional probability estimates. Finally the FSM-coder, a binary entropy coder with functionality similar to the QM-coder, is used to generate the final code stream.","PeriodicalId":337265,"journal":{"name":"Proceedings of Data Compression Conference - DCC '96","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127491596","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}