NDLI: Bitgroup modeling of signal data for image compression

Content Provider	IEEE Xplore Digital Library
Author	Vaisey, J. Trumbo, M.
Copyright Year	1995
Description	Author affiliation: Sch. of Eng. Sci., Simon Fraser Univ., Burnaby, BC, Canada (Vaisey, J.; Trumbo, M.)
Abstract	Summary form only given. Binary variable order adaptive algorithms like the UMC of Rissanen (1986) and JBIG can be used to losslessly compress non-binary data by splitting the data into planes, each of 1 bit resolution, and passing each plane to a separate instance of the algorithm. The UMC algorithm operated in this way is the most powerful lossless signal data compressor the authors are aware of. We attempt to develop an understanding of why this approach is so effective. We investigate the common technique of Gray coding the data before splitting it into single-bit planes and passing to the modeler and coder, and compare it to a simple weighted binary coding. We then propose a non-binary pseudo-Gray code as a method of generating planes of resolution greater than or equal to 1 bit, and compare it with the other conventional methods. The algorithm to generate the pseudo-Gray code is much the same as that for the construction of a binary Gray code, except that instead of minimizing the Hamming distance between neighboring bit planes, we instead minimize the Euclidean distance between adjacent groups of bit planes.
File Size	70877
File Format	PDF
ISBN	0818670126
ISSN	10680314
DOI	10.1109/DCC.1995.515576
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-03-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Image coding Histograms Reflective binary codes Adaptive algorithm Signal resolution Probability distribution Random variables Hamming distance Euclidean distance Image resolution
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Adaptation for non-stationary binary sources for data compression

Optimal quantizer performance and the Wasserstein distortion

Optimal prefix codes for some families of two-dimensional geometric distributions

When Huffman Meets Hamming: A Class of Optimal Variable-Length Error Correcting Codes

Binary codes for robust image hashing

On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information

Lossless Reduced Cutset Coding of Markov Random Fields

Lossless image data sequence compression using optimal context quantization

Performance of universal codes over infinite alphabets

Bitgroup modeling of signal data for image compression

Similar Documents

Adaptation for non-stationary binary sources for data compression

Optimal quantizer performance and the Wasserstein distortion

Optimal prefix codes for some families of two-dimensional geometric distributions

When Huffman Meets Hamming: A Class of Optimal Variable-Length Error Correcting Codes

Binary codes for robust image hashing

On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information

Lossless Reduced Cutset Coding of Markov Random Fields

Lossless image data sequence compression using optimal context quantization

Performance of universal codes over infinite alphabets

Bitgroup modeling of signal data for image compression