Memory-Efficient Image Codec Using Line-based Backward Coding of Wavelet Trees

Ye, Linning; Guo, Junjie; Nutter, Brian; Mitra, Sunanda

doi:10.1109/dcc.2007.55

Cited by 14 publications

(8 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the beginning, L max +1 lines are needed to fill in each level wavelet transform buffer in order to generate the first line of each of the four subbands. This initial delay problem was illustrated in detail in [4], [25], [26] and named "startup phase"…”

Section: Jpeg2000 With Line-based Dwtmentioning

confidence: 99%

Memory Efficient Multilevel Discrete Wavelet Transform Schemes for JPEG2000

Hou

2015

IEEE Trans. Circuits Syst. Video Technol.

Self Cite

View full text Add to dashboard Cite

When working with the line-based wavelet transform, JPEG2000 needs to buffer many subband lines for future block coding. This coding buffer occupies the majority of the memory usage in a JPEG2000 system. In this paper, we first use the multi-level block-based wavelet transform and then utilize the multi-level stripe-based wavelet transform to realize JPEG2000 coding. The system schemes of the multi-level block-based wavelet transform and the multi-level stripe-based wavelet transform for JPEG2000 are presented. The proposed schemes can effectively control the wavelet coefficient output pattern and thus reduce the memory usage of JPEG2000 coding buffer.Compared with the line-based wavelet transform, the proposed schemes reduce more than 50% memory usage of the JPEG2000 system and slightly decrease the memory bandwidth. By holding the blocks/stripes in on-chip memory, which do not depend on the image size, the memory bandwidth of the JPEG2000 system can be further significantly reduced. The advantage of the stripe-based wavelet transform over the block-based wavelet transform lies in that it occupies much less internal memory.Index Terms-Discrete wavelet transform; lifting scheme; line-based method; JPEG2000; code block. 1051-8215 (c)

show abstract

Section: Jpeg2000 With Line-based Dwtmentioning

confidence: 99%

Memory Efficient Multilevel Discrete Wavelet Transform Schemes for JPEG2000

Hou

2015

IEEE Trans. Circuits Syst. Video Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…SHPS can be parameterized to obtain different trade-offs between the image quality and the energy expended for compression and transmission of the image. A principle that is more in line with our low memory requirements in the range of a few kilobytes is the backward coding wavelet tree (BCWT) [29][30][31]. It belongs to the classes (b) and ( c), as it reduces the need for memory by traversing the image using a small set of lines and thereby saves operational cost as each line is only accessed once.…”

Section: Related Workmentioning

confidence: 99%

Evaluation of the wavelet image two-line coder: A low complexity scheme for image compression

Rein

Fitzek

Gühmann

et al. 2015

Signal Processing: Image Communication

View full text Add to dashboard Cite

“…A lowmemory version of BCWT, named as line-based BCWT has been proposed in [47], [48]. Line-based BCWT requires less memory than BCWT, while it has the same coding efficiency as BCWT.…”

Section: B Related Work 1) Low-memory Dwtmentioning

confidence: 99%

FrWF-Based LMBTC: Memory-Efficient Image Coding for Visual Sensors

et al. 2015

View full text Add to dashboard Cite

After the successful development of JPEG2000, many state-of-art wavelet-based image coding algorithms have been developed. However, the traditional discrete wavelet transform (DWT) is implemented with memory intensive and time consuming algorithms and therefore has very high system resource requirements. In particular, the very large required memory poses a serious limitation for multimedia applications on memory-constrained portable devices, such as digital cameras and sensor nodes. In this paper, we propose a novel wavelet-based image coder with low memory requirements and low complexity that preserves the compression efficiency. Our encoder employs the Fractional Wavelet Filter (FrWF) to calculate the DWT coefficients, which are quantized and encoded with a novel Low Memory Block Tree Coding (LMBTC) algorithm. LMBTC is a listless form of the Wavelet Block Tree Coding (WBTC) algorithm. Simulation results demonstrate that the proposed coder significantly reduces memory requirements and computational complexity and has competitive coding efficiency in comparison with other state-of-art coders. FrWF combined with LMBTC is thus a viable option for image communication over wireless sensor networks.Index Terms-Fractional wavelet filter, Low memory image codec, Visual sensors, Wireless sensor networks.

show abstract

Memory-Efficient Image Codec Using Line-based Backward Coding of Wavelet Trees

Cited by 14 publications

References 6 publications

Memory Efficient Multilevel Discrete Wavelet Transform Schemes for JPEG2000

Memory Efficient Multilevel Discrete Wavelet Transform Schemes for JPEG2000

Evaluation of the wavelet image two-line coder: A low complexity scheme for image compression

FrWF-Based LMBTC: Memory-Efficient Image Coding for Visual Sensors

Contact Info

Product

Resources

About