Quadtree based JBIG compression

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by B. Fowler Articles by R. Arps Articles by A. El Gamal Articles by D. Yang

Data Compression Conference (DCC '95)

Snowbird, Utah

March 28-March 30

ISBN: 0-8186-7012-6

	ASCII Text	x
	B. Fowler, R. Arps, A. El Gamal, D. Yang, "Quadtree based JBIG compression," Data Compression Conference, pp. 102, Data Compression Conference (DCC '95), 1995.

	BibTex	x
	@article{ 10.1109/DCC.1995.515500, author = {B. Fowler and R. Arps and A. El Gamal and D. Yang}, title = {Quadtree based JBIG compression}, journal ={Data Compression Conference}, volume = {0}, year = {1995}, isbn = {0-8186-7012-6}, pages = {102}, doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.1995.515500}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Compression Conference TI - Quadtree based JBIG compression SN - 0-8186-7012-6 SP EP A1 - B. Fowler, A1 - R. Arps, A1 - A. El Gamal, A1 - D. Yang, PY - 1995 KW - image coding; data compression; arithmetic codes; quadtrees; lossless image compression algorithm; quadtree; CCITT bi-level test images; arithmetic coding; image coding; JBIG algorithm VL - 0 JA - Data Compression Conference ER -

B. Fowler, Inf. Syst. Lab., Stanford Univ., CA, USA

R. Arps, Inf. Syst. Lab., Stanford Univ., CA, USA

A. El Gamal, Inf. Syst. Lab., Stanford Univ., CA, USA

D. Yang, Inf. Syst. Lab., Stanford Univ., CA, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.1995.515500

A JBIG compliant, quadtree based, lossless image compression algorithm is described. In terms of the number of arithmetic coding operations required to code an image, this algorithm is significantly faster than previous JBIG algorithm variations. Based on this criterion, our algorithm achieves an average speed increase of more than 9 times with only a 5% decrease in compression when tested on the eight CCITT bi-level test images and compared against the basic non-progressive JBIG algorithm. The fastest JBIG variation that we know of, using "PRES" resolution reduction and progressive buildup, achieved an average speed increase of less than 6 times with a 7% decrease in compression, under the same conditions.

Index Terms:

image coding; data compression; arithmetic codes; quadtrees; lossless image compression algorithm; quadtree; CCITT bi-level test images; arithmetic coding; image coding; JBIG algorithm

Citation:

B. Fowler, R. Arps, A. El Gamal, D. Yang, "Quadtree based JBIG compression," dcc, pp.102, Data Compression Conference (DCC '95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.