Image compression for memory constrained printers

Cosman, Pamela C.; Frajka, T.; Zeger, K.

doi:10.1109/icip.1998.999002

Search citation statements

Order By: Relevance

Paper Sections

Select...

Results and Conclusion1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 6 publications

(6 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…THE ACTUAL MEMORY REQUIREMENTS WILL BE HIGHER, DEPENDING ON WHETHER LOW BAND COEFFICIENTS ARE GROUPED TO FORM A SEVENTH LEVEL OF DECOMPOSITION, AND ALSO BECAUSE THE DECODER NEEDS TO STORE LISTS OF COEFFICIENT SETS incrementally at the encoder as well, employing each new line as it becomes available. We have recently extended the work in this paper by using quadtree-guided wavelet compression [6] for reduced memory coding, since only one or two levels of decomposition are required, and the extra storage (for prediction) is small [7].…”

Section: Results and Conclusionmentioning

confidence: 99%

Memory constrained wavelet based image coding

Cosman

Zeger²

1998

IEEE Signal Process. Lett.

Self Cite

View full text Add to dashboard Cite

We present a method for ordering the wavelet coefficient information in a compressed bitstream that allows an image to be sequentially decoded, with lower memory requirements than conventional wavelet decompression schemes. We also introduce a hybrid filtering scheme that uses different horizontal and vertical filters, each with different depths of wavelet decomposition. This reduces decoder memory requirements by reducing the instantaneous number of wavelet coefficients needed for inverse filtering.

show abstract

Section: Results and Conclusionmentioning

confidence: 99%