{"title":"Object-Based Regions of Interest for Image Compression","authors":"Sunhyoung Han, N. Vasconcelos","doi":"10.1109/DCC.2008.94","DOIUrl":"https://doi.org/10.1109/DCC.2008.94","url":null,"abstract":"A fully automated architecture for object-based region of interest (ROI) detection is proposed. ROI's are defined as regions containing user defined objects of interest, and an efficient algorithm is developed for the detection of such regions. The algorithm is based on the principle of discriminant saliency, which defines as salient the image regions of strongest response to a set of features that optimally discriminate the object class of interest from all the others. It consists of two stages, saliency detection and saliency validation. The first detects salient points, the second verifies the consistency of their geometric configuration with that of training examples. Both the saliency detector and the configuration model can be learned from cluttered images downloaded from the web. Learning and ROI detection are optimal in the minimum probability of error (MPE) sense, and computationally efficient. This enables interactive user training of ROI-based image coders, with minimal amounts of manual supervision. Experimental results are presented for images of complex scenes, containing both objects and background clutter, and demonstrate good object-based ROI image compression performance.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115690448","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":"Table Compression by Record Intersections","authors":"A. Apostolico, F. Cunial, V. Kaul","doi":"10.1109/DCC.2008.105","DOIUrl":"https://doi.org/10.1109/DCC.2008.105","url":null,"abstract":"Saturated patterns with don't care like those emerged in biosequence motif discovery have proven a valuable notion also in the design of lossless and lossy compression of sequence data. In independent endeavors, the peculiarities inherent to the compression of tables have been examined, leading to compression schemata advantageously hinged on a prudent rearrangement of columns. The present paper introduces off-line table compression by textual substitution in which the patterns used in compression are chosen among models or templates that capture recurrent record subfields. A model record is to be interpreted here as a sequence of intermixed solid and don't care characters that obeys, in addition, some conditions of saturation: most notably, it must be not possible to replace a don't care in the model by a solid character without having to forfeit some of its occurrences in the table. Saturation is expected to save on the size of the codebook at the outset, and hence to improve compression. It also induces some clustering of the records in the table, which may present independent interest. Results from preliminary experiments show the savings and potential for classification brought about by this method in connection with a table of specimens collected in a context of biodiversity studies.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124827257","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":"Simultaneous Encryption/Compression of Images Using Alpha Rooting","authors":"Eric J. Wharton, K. Panetta, S. Agaian","doi":"10.1109/DCC.2008.87","DOIUrl":"https://doi.org/10.1109/DCC.2008.87","url":null,"abstract":"Summary form only given. Significant work has been performed on encrypting images and compressing images as two separate problems, but traditional encryption techniques generally degrade the compression ratio. To circumvent these issues, two methods have been used. The first employs known encryption algorithms on compressed image data. The second develops compression algorithms which work well for encrypted data. The contribution of this paper is using alpha rooting to perform simultaneous compression and encryption. This achieves improved compression performance in terms of computational complexity and compression ratio. Results are shown for 2 of the well known benchmark images, using the well known JPEG image compression standard to demonstrate the effectiveness of alpha rooting for simultaneous encryption and compression.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126602553","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 Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding","authors":"E. Meron, O. Shayevitz, M. Feder, R. Zamir","doi":"10.1109/DCC.2008.84","DOIUrl":"https://doi.org/10.1109/DCC.2008.84","url":null,"abstract":"In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite end- to-end strict delay constraint. It was shown that the redundancy decays exponentially with the delay constraint and that the redundancy-delay exponent is lower bounded by log(1/alpha) where alpha is the probability of the most likely source symbol. In this work, we prove a corresponding upper bound for the redundancy-delay exponent, C - log 1/beta where beta is the probability of the least likely source symbol. This bound is valid for almost all memoryless sources and for all arithmetic-type (possibly time-varying, memory dependent) lossless delay-constrained encoders. We also shed some light on the difference between our exponential bounds and the polynomial O(d-5'3) upper bound on the redundancy with an average delay constraint d, derived in an elegant paper by Bugeaud, Drmota and Szpankowski for another class of variable-to-variable encoders, and show that the difference is due to the precision needed to memorize the encoder's state.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115054922","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":"List Update Algorithms for Data Compression","authors":"Reza Dorrigiv, A. López-Ortiz, J. Munro","doi":"10.1109/DCC.2008.25","DOIUrl":"https://doi.org/10.1109/DCC.2008.25","url":null,"abstract":"List update algorithms have been widely used as subroutines in compression schemas, most notably as part of Burrows-Wheeler compression. We performed an experimental comparison of various list update algorithms both as stand alone compression mechanisms and as a second stage of the BWT-based compression. We considered the following list update algorithms: move-to-front (MTF), sort-by-rank (SBR), frequency-count (FC), timestamp (TS), and transpose (TR) on text files of the Calgary Corpus. Our results showed that TR and FC usually outperform MTF and TS if we do not use BWT. This is in contrast with competitive analysis in which MTF and TS are superior to TS and FC. After BWT, MTF and TS have comparable performance and always outperform FC and TR. Our experiments are consistent with the intuition that BWT increases locality of reference and the predicted result from the locality of reference model of the work of Angelopoulos et al. (2008).","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122833956","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":"All-Match LZ77 Bit Recycling","authors":"Danny Dubé, V. Beaudoin","doi":"10.1109/DCC.2008.101","DOIUrl":"https://doi.org/10.1109/DCC.2008.101","url":null,"abstract":"Summary form only given. Recently, a technique called bit recycling (BR) was introduced to help reduce the redundancy caused by the multiplicity of encodings. It has been used to improve LZ77 compression, which is especially prone to allow for the existence of numerous different compressed files for some given original file F. The multiplicity of encodings causes redundancy. Instead of trying to eliminate or reduce the multiplicity itself, BR exploits it and extracts a compensation from it. It uses implicit communication that happens when, at some point in the compression process, we have that: 1. the compressor C has more than one option; and 2. the decompressor D is able to recognize that situation. The mere fact that C has the liberty to select one among many options allows it to implicitly send bits to D. The particularity of BR is that it avoids storing as many bits as possible in the compressed file by implicitly sending them instead. Previous work presented a technique that recycles bits based on the existence of multiple longest matches, called longest-match BR (LMBR). This work presents a more general, and more powerful, technique, called all-match BR (AMBR) that exploits shorter matches.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"22 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129195725","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":"Improved Wavelet-Based Embedded Image Coding Using a Dynamic Index Reordering Vector Quantizer","authors":"Jungwon Lee, Teahyung Lee, David V. Anderson","doi":"10.1109/DCC.2008.97","DOIUrl":"https://doi.org/10.1109/DCC.2008.97","url":null,"abstract":"In this paper, we propose a temporal dynamic index reordering vector quantization for wavelet-based embedded coding. Da Silva et al. introduced a vector quantization concept that is similar to EZW called a successive approximation vector quantizer (SAVQ). The successive refinement process is defined as a temporal process in our proposed algorithm. The temporal updates are performed in every refinement pass, and the updates of codevectors reflect the updates of angles for vector approximation. Because the approximation trajectory of SAVQ is similar to that of the least-mean- square algorithm, temporal redundancy does not seem to be obvious. However, the redundancy becomes more clear in the improved SAVQ. By carefully analyzing the angle transitions, we are successfully able to apply dynamic index reordering vector quantization (DIRVQ) in the temporal domain and improve the coding performance. Efficient encoding and decoding algorithms for D4 lattice vector quantization are also proposed, and the algorithms can be applicable to DIRVQ to reduce the computational complexity of the reordering process. Experiments are performed with the 2x2 vector size. For almost all tested bpp's the PSNR performance of our proposed algorithm for a lena image outperforms that of SAVQ up to 0.18 dB. Improvement is measured for the highly detailed baboon image as well.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129284703","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":"An Estimation-Theoretic Interpretation of Video Rate Distortion Optimization with Lagrangian Formulation","authors":"Z. Li, A. Tourapis","doi":"10.1109/DCC.2008.50","DOIUrl":"https://doi.org/10.1109/DCC.2008.50","url":null,"abstract":"Rate distortion optimization with Lagrangian formulation is widely used in video encoder control and has proved effective in achieving a good trade-off between coding efficiency and computational complexity. It is generally interpreted as a source coding problem with a fidelity criterion. However, this interpretation cannot fully explain the Lagrangian formulation for motion estimation and how to select the corresponding Lagrangian multipliers. In this paper, we provide a new perspective based on an estimation-theoretic interpretation that formulates motion estimation and mode decision as a maximum a posteriori (MAP) estimation problem. Several interesting conclusions can be drawn from this interpretation. We show that the Lagrangian formulation in video encoder control is a straightforward result under this interpretation. With this interpretation, we can further analyze the Lagrangian multiplier's dependence on the quantization parameter and motion intensity of the content.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121663406","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}
J. Kammerl, P. Hinterseer, S. Chaudhuri, E. Steinbach
{"title":"A Theoretical Analysis of Data Reduction Using the Weber Quantizer","authors":"J. Kammerl, P. Hinterseer, S. Chaudhuri, E. Steinbach","doi":"10.1109/DCC.2008.71","DOIUrl":"https://doi.org/10.1109/DCC.2008.71","url":null,"abstract":"We present a theoretical analysis of a perceptual coding approach, the so called Weber quantizer. Extensive studies performed by experimental psychologists and physiologists have unveiled one major conclusion: human perception often follows Weber's law. Ernst Weber was an experimental physiologist who in 1834 first discovered the following implication DeltaI = kl, where DeltaI is the so called difference threshold or the just noticeable difference (JND). It describes the smallest amount of change of an (arbitrary) stimulus I which can be detected just as often as it cannot be detected and defines the Weber bound at [(1 - k)I, (1 + k)I].","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130262278","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":"Macroblock-Level Rate-Distortion Optimization with Perceptual Adjustment for Video Coding","authors":"Chang Sun, Hongjun Wang, Hua Li","doi":"10.1109/DCC.2008.75","DOIUrl":"https://doi.org/10.1109/DCC.2008.75","url":null,"abstract":"Experiments have been conducted based on the reference coder JM12.2 of H.264/AVC. Simulation results show that the subjective qualities of the decoded frames are improved without compromising PSNR. Fig.1. blow shows the subjective performance of the proposed scheme for 'Foreman' sequence. We can easily find that the perceptual quality of the detailed region (such as the wrinkles on the facial area) is significantly improved by comparing the two encoded frames. However, the distortion increased in the background is much less visually noticeable. And we have also performed subjective evaluation by inviting 20 people to be human observers for our experiment. 17 of them said there is an obvious improvement in video quality.","PeriodicalId":328537,"journal":{"name":"Data Compression Conference (dcc 2008)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131830828","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}