SPIHT image compression without lists

Wheeler, Floyd J.; Pearlman, William A.

doi:10.1109/icassp.2000.859236

Cited by 115 publications

(54 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The bits are immediately outputted in the sorting pass, thus, LIP and LSP can be thrown away. No List SPIHT [12] adopts a state table and performs the explicit breath-first search. Since the lists are removed, the order of pixels is missing and the image quality is decreasing.…”

Section: Related Workmentioning

confidence: 99%

A Fast and Memory Efficient SPIHT Image Encoder

Chen

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYSet-partitioning in hierarchical trees (SPIHT) is one of the well-known image compression schemes. SPIHT offers an agreeable compression ratio and produces an embedded bit-stream for progressive transmission. However, the major disadvantage of SPIHT is its large memory requirement. In this paper, we propose a memory efficient SPIHT image coder and its parallel implantation. The memory requirement is reduced without sacrificing image quality. All bit-planes are concurrently encoded in order to speed up the entire coding flow. The result shows that the proposed algorithm is roughly 6 times faster than the original SPIHT. For a 512 × 512 image, the memory requirement is reduced from 5.83 Mb to 491 Kb. The proposed algorithm is also realized on FPGA. With pipeline design, the circuit can run at 110 MHz, which can encode a 512×512 image in 1.438 ms. Thus, the circuit achieves very high throughput, 182 MPixels/sec, and can be applied to high performance image compression applications. key words: image coding, wavelet, set-partition in hierarchical trees (SPIHT), FPGA

show abstract

Section: Related Workmentioning

confidence: 99%

A Fast and Memory Efficient SPIHT Image Encoder

Chen

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…After that, bit streams are obtained. Wavelet transform image coding using traditional SPIHT has the advantages of embedded code stream structure, high compression rate, low complexity and easy to implement [13]. However, for it, there still exist several defects.…”

Section: Improved Set Portioning In Hierarchical Trees (Ispiht)mentioning

confidence: 99%

Highly Scalable Compression Method for Super Resolution Multi Spectral Images

Raju¹,

Shankar²,

Naidu³

2014

IOSRJVSP

View full text Add to dashboard Cite

show abstract

“…The SPIHT coding, proposed by Said and Pearlman in 1996 [27], does not required arithmetic coding and provides a cheaper and faster hardware solution. It was modified by Wheeler and Pearlman [28] by making a no list SPIHT (NLS) to reduce memory usage. Later, Corsonello et al [29] proposed a low-cost implementation of NLS in order to improve the coding speed.…”

Section: Introductionmentioning

confidence: 99%

Power-optimized log-based image processing system

Vaithiyanathan

Ramachandran

2014

J Image Video Proc

View full text Add to dashboard Cite

The continuous development of devices such as mobile phones and digital cameras has led to a higher amount of research being dedicated to the image processing field. Today's image-acquiring tools require battery-operated power, and hence, power optimization becomes a major factor to be considered in the hardware implementation of image systems. This paper proposes an image processing system which utilizes set partitioning in hierarchical trees (SPIHT)-integrated discrete wavelet transform (DWT) structure for image processing. The overall advantage of this proposal is achieved by modifying the arithmetic units in the DWT structure. Utilizing a logarithm-based floating point unit (FPU) in the DWT computation structures, the logarithmic number system (LNS) adaptation in the arithmetic unit results in overall accuracy enhancement with reduced area and power consumption. To ensure the versatility of the proposal and for further evaluating the performance and correctness of the structure, the model is implemented using Xilinx and Altera field-programmable gate array (FPGA) devices. The analyses obtained from the implementation show that the structure incorporated with the log-based FPU is 25% more accurate with 47% reduced power consumption than the integer-styled FPU incorporated DWTs, along with enhanced speed and optimal area utilization.

show abstract

SPIHT image compression without lists

Cited by 115 publications

References 5 publications

A Fast and Memory Efficient SPIHT Image Encoder

A Fast and Memory Efficient SPIHT Image Encoder

Highly Scalable Compression Method for Super Resolution Multi Spectral Images

Power-optimized log-based image processing system

Contact Info

Product

Resources

About