A Block-Based Pass-Parallel SPIHT Algorithm

Jin, Yongseok; Lee, Hyuk-Jae

doi:10.1109/tcsvt.2012.2189793

Cited by 62 publications

(30 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus unnecessary updating of the insignificant sorting passes is avoided in BPS algorithm which in turn increased the speed of computations. [27], [28].…”

Section: Logarithmic Number Systemsmentioning

confidence: 99%

See 1 more Smart Citation

Implementation of DWT Integrated Log Based FPU with SPIHT Coders on FPGA

N.RamyaRani¹

2016

IJAERS

View full text Add to dashboard Cite

show abstract

“…Thus unnecessary updating of the insignificant sorting passes is avoided in BPS algorithm which in turn increased the speed of computations. [27], [28].…”

Section: Logarithmic Number Systemsmentioning

confidence: 99%

“…In recent years wavelet transforms have become one of the powerful tools in the field of image processing particularly in image compression techniques. [28]. In conventional Fourier transforms and its related transforms namely Discrete Cosine transform and Discrete Sine transform, sinusoids are used for the basic functions.…”

Section: Introductionmentioning

confidence: 99%

Implementation of DWT Integrated Log Based FPU with SPIHT Coders on FPGA

N.RamyaRani¹

2016

IJAERS

View full text Add to dashboard Cite

show abstract

“…Then, they rearrange the order of the encoded output bit stream by memory optimization at the algorithmic three continuously growing linked lists levels and a low bit rate image coder. Jin et al [18] decomposes a wavelet-transformed image into 4×4-bit blocks and simultaneously encodes all the 4×4 bits in a bitplane. Both an encoder and a decoder are implemented in the hardware.…”

Section: Introductionmentioning

confidence: 99%

A Simple and Fast Algorithm for Image Coding Based on SPIHT

Zhang

Lin

et al. 2016

Proceedings of the 2016 2nd International Conference on Artificial Intelligence and Industrial Engineering (AIIE 2016)

View full text Add to dashboard Cite

Abstract-The complicate calculation and frequent comparison based on spatial orientation tree (SOT) structure in SPIHT severely reduce the coding speed. To overcome these shortcomings, a modified image compression algorithm is proposed without SOT. The algorithm sorts the wavelet coefficients in descending order to eliminate the correlation among wavelet coefficients and obtain a one-dimensional coordinate list corresponding to the sorted wavelet coefficients. This algorithm stops the sorting pass immediately when a wavelet coefficient from the sorted coordinate list is not significant in a bit plane, which simplifies the process of scanning. Experimental results show that the proposed algorithm drastically improves the coding speed.

show abstract

“…Even when SPIHT is not a standard, it is used in many video applications that use image compression with the embedded coding property [23][24][25][26] and medical imaging applications with SPIHT as a core. 8,20,27,28 One of the main drawbacks of SPIHT is the slow coding speed owing to the dynamic processing order that depends on the image contents.…”

Section: Introductionmentioning

confidence: 99%

Modified set partitioning in hierarchical trees algorithm based on hierarchical subbands

Domínguez

Villegas

Sánchez

2015

J. Electron. Imaging

View full text Add to dashboard Cite

Abstract. This paper introduces a modified set partitioning in hierarchical trees (SPIHT) algorithm that reduces the number of comparison operations and, consequently, the execution time needed to encode an image as compared to the SPIHT algorithm. The threshold of each independent subband is calculated after applying the discrete wavelet transform to the image. Scanning of the sets inside the subbands is determined by the magnitude of the thresholds that establishes a hierarchical scanning not only for the set of coefficients with larger magnitude, but also for the subbands. The algorithm uses the set partitioning technique to sort the transform coefficients. Results show that the modified SPIHT significantly reduces the number of operations and the execution time without sacrificing visual quality and the PSNR of the recovered image. © The Authors. Published by SPIE under a Creative Commons Attribution 3.0 Unported License. Distribution or reproduction of this work in whole or in part requires full attribution of the original publication, including its DOI.

show abstract

A Block-Based Pass-Parallel SPIHT Algorithm

Cited by 62 publications

References 19 publications

Implementation of DWT Integrated Log Based FPU with SPIHT Coders on FPGA

Implementation of DWT Integrated Log Based FPU with SPIHT Coders on FPGA

A Simple and Fast Algorithm for Image Coding Based on SPIHT

Modified set partitioning in hierarchical trees algorithm based on hierarchical subbands

Contact Info

Product

Resources

About