An efficient wavelet image encoder for FPGA-based designs

Lanuzza, Marco; Perri, Stefania; Corsonello, Pasquale; Cocorullo, G.

doi:10.1109/sips.2005.1579946

Cited by 6 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Works of class (b) require a subset of the original image, and are reviewed in the following. In [23,24] coding systems for FPGA platforms are given, which require 15 kB of RAM for a picture dimension of 128 Â 128 and 0.5 MB of RAM for a picture dimension of 512 Â 512. The coder in [25] usesat minimum -memory for eight picture lines with the use of a novel tree structure, and requires 256 Â 8 Â 2 bytes RAM for a picture dimension of 256 Â 256 using 16 bits per coefficient.…”

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

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

“…The coders in [6,5] both are designed for FPGA platforms and require 15 kByte of RAM for a picture dimension of 128x128, and 0.5 MByte of RAM for a picture dimension of 512x512, respectively. The work in [2] reports that there are at minimum eight memory lines needed by proposing a novel tree structure, which would require 256x8x2 bytes RAM for a picture dimension of 256x256 using 16 Bits per coefficient.…”

Section: 1: Related Workmentioning

confidence: 99%

Wavelet Image Two-Line Coder for Wireless Sensor Node with Extremely Little RAM

Rein

Lehmann

Gühmann

2009

2009 Data Compression Conference

View full text Add to dashboard Cite

This paper gives a novel wavelet image two-line (Wi2l) coder that is designed to fulfill the memory constraints of a typical wireless sensor node. The algorithm operates line-wisely on picture data stored on the sensor's flash memory card while it requires approximatively 1.5 kByte RAM to compress a monochrome picture with the size of 256x256 Bytes. The achieved data compression rates are the same as with the set partitioning in hierarchical trees (Spiht) algorithm. The coder works recursively on two lines of a wavelet subband while intermediate data of these lines is stored to backward encode the wavelet trees. Thus it does not need any list but three small buffers with a fixed dimension. The compression performance is evaluated by a PCimplementation in C, while time measurements are conducted on a typical wireless sensor node using a modified version of the PC-code.

show abstract

“…At higher rates, the algorithm shows poor performance for most of the images. Lanuzza et al 11 proposed two modifications to NLS. In first case, refinement pass is executed at the first step instead of the last step in NLS and in second case, less number of markers are used.…”

Section: Introductionmentioning

confidence: 99%

Low Bit Rate Image Compression Using Hierarchical Listless Block-Tree DTT Algorithm

Senapati

Pati

Mahapatra

2013

Int. J. Image Grap.

View full text Add to dashboard Cite

This paper presents a listless variant of modified wavelet block tree coding (MLBTC) algorithm. Wavelet block-tree coding (WBTC) improves the image compression performance of set partitioning in hierarchical trees (SPIHT) at lower rates by efficiently encoding both inter-and intra-scale correlations. The use of auxiliary lists makes WBTC undesirable for hardware implementation as it needs a lot of memory management due to exponential increase of nodes on each pass. The proposed coder named as hierarchical listless block-tree DTT (HLBT DTT) that combines discrete Tchebichef transform (DTT) with MLBTC exhibits compression performance significantly higher than most of the DCT-based embedded coders and comparable with JPEG 2000, especially at lower bit rates. Further, HLBT DTT requires only 10% of memory than that of DCT-based SPIHT/WBTC coders.

show abstract

An efficient wavelet image encoder for FPGA-based designs

Cited by 6 publications

References 11 publications

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

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

Wavelet Image Two-Line Coder for Wireless Sensor Node with Extremely Little RAM

Low Bit Rate Image Compression Using Hierarchical Listless Block-Tree DTT Algorithm

Contact Info

Product

Resources

About