TY - JOUR
T1 - Memory efficient scalable line-based image coding
AU - Ordentlich, Erik
AU - Taubman, David
AU - Weinberger, Marcelo
AU - Seroussi, Gadiel
AU - Marcellin, Michael W.
PY - 1999
Y1 - 1999
N2 - We study the problem of memory-efficient scalable image compression and investigate some tradeoffs in the complexity vs. coding efficiency space. The focus is on a low-complexity algorithm centered around the use of sub-bit-planes, scan-causal modeling, and a simplified arithmetic coder. This algorithm approaches the lowest possible memory usage for scalable wavelet-based image compression and demonstrates that the generation of a scalable bit-stream is not incompatible with a low-memory architecture.
AB - We study the problem of memory-efficient scalable image compression and investigate some tradeoffs in the complexity vs. coding efficiency space. The focus is on a low-complexity algorithm centered around the use of sub-bit-planes, scan-causal modeling, and a simplified arithmetic coder. This algorithm approaches the lowest possible memory usage for scalable wavelet-based image compression and demonstrates that the generation of a scalable bit-stream is not incompatible with a low-memory architecture.
UR - http://www.scopus.com/inward/record.url?scp=0032630517&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032630517&partnerID=8YFLogxK
U2 - 10.1109/dcc.1999.755671
DO - 10.1109/dcc.1999.755671
M3 - Conference article
AN - SCOPUS:0032630517
SP - 218
EP - 227
JO - Proceedings of the Data Compression Conference
JF - Proceedings of the Data Compression Conference
SN - 1068-0314
T2 - Proceedings of the 1999 Data Compression Conference, DCC-99
Y2 - 29 March 1999 through 31 March 1999
ER -