Title :
An algorithm for the construction of a critical clustered exponential code for use in image data compression
Author_Institution :
Geac Comput. Corp. Ltd., Markham, Ont., Canada
Abstract :
The author demonstrates that the compression ratio of the adaptive block/location coding (ABLC) technique can be increased by an average of 37% if the original image is preprocessed and if rectangles, not squares, are location coded. A statistical data compression based on a modified exponential code, called the critical clustered exponential code (CCEC), is of interest for time-critical applications. An algorithm for the construction of the CCEC is presented. The author demonstrates that compression ratios within a few percent of those achievable using a Huffman code can be reached using a CCEC, and that the decoding time is on the order of 20% faster. Using the CCEC for the location coding for the modified ABLC reduced the ABLC decoding time by 16%. Exclusive OR image preprocessing and ABLC with CCEC location coded 4×2 basic picture block is implemented in Geac mainframes and terminal devices to store and retrieve lossless image data
Keywords :
codes; computerised picture processing; data compression; Geac mainframes; Huffman code; adaptive block/location coding; algorithm; critical clustered exponential code; exclusive OR image preprocessing; image data compression; Chromium; Clustering algorithms; Data communication; Data compression; Decoding; Image coding; Image retrieval; Information retrieval; Time factors; Time measurement;
Conference_Titel :
Computers and Communications, 1991. Conference Proceedings., Tenth Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ
Print_ISBN :
0-8186-2133-8
DOI :
10.1109/PCCC.1991.113889