Title: | A Separate Least Squares Algorithm for Efficient Arithmetic Coding in Lossless Image Compression |
Authors: | Triantafyllidis, G. A. Strintzis, M. G. |
Citation: | WSCG '2001: Conference proceedings: The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001: University of West Bohemia, Plzen, Czech Republic, February 5.-9., 2001, p. 315-319. |
Issue Date: | 2001 |
Publisher: | University of West Bohemia |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://wscg.zcu.cz/wscg2001/Papers_2001/R213.ps http://hdl.handle.net/11025/11284 |
ISBN: | 80-7082-713-0 |
ISSN: | 1213-6972 |
Keywords: | nejmenší čtverce;aritmetické kódování;výběr kontextu;bezztrátové zpracování obrazu |
Keywords in different language: | least squares;arithmetic coding;context selection;lossless image processing |
Abstract: | The overall performance of discrete wavelet transforms for lossless image compression may be further improved by properly designing efficient entropy coders. In this paper a novel technique is proposed for the implementation of context-based adaptive arith-metic entropy coding. It is based on the prediction of the value of the current transform coefficient. The proposed algorithm employs a weighted least squares method applied separately for the HH, HL and LH bands of each level of the multiresolution structure, in order to achieve appropriate context selection for arithmetic coding. Experimental re-sults illustrate and evaluate the performance of the proposed technique for lossless image compression. |
Rights: | © University of West Bohemia |
Appears in Collections: | WSCG '2001: Conference proceedings |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Triantafyllidis.ps | Plný text | 224,35 kB | Postscript | View/Open |
Triantafyllidis.pdf | Plný text | 654,84 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11284
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.