Low complexity, efficient and embedded color image coding technique

Moinuddin, Athar Ali; Khan, E.; Ghanbari, M.

doi:10.1109/tce.2008.4560161

Cited by 6 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CSPIHT and algorithm in Ref. 12 uses the type of sub-sampling like the one in CLEBP (case 2). By simply discarding alternate rows and columns in chrominance planes, CLEBP (case 2) performs worst than CSPIHT and algorithm in Ref.…”

Section: Discussion Related To Coding Performances Between Grayscale mentioning

confidence: 99%

“…12 are directly quoted form Ref. 12. CSPIHT does not need any kind of border extension to encode images because each coefficient in the coarsest subband will constitute a quad tree.…”

Section: Discussion Related To Coding Performances Between Grayscale mentioning

confidence: 99%

“…However, it is highly complex because of multiple coding passes per bit plane, use of context adaptive arithmetic coding and post compression rate distortion optimization. Algorithm presented by Moindduin et al 12 shows a significant improvement in coding efficiency by integrating set partitioning strategies of hierarchical trees and blocks into a single algorithm. However, the encoder and decoder are more complex because of additional steps of set partitioning.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved Listless Embedded Block Partitioning Algorithms for Image Compression

Senapati

Mankar²

2014

Int. J. Image Grap.

View full text Add to dashboard Cite

In this paper, two simple yet efficient embedded block-based image compression algorithms are presented. These algorithms not only improve the rate distortion performances of set partitioning in hierarchical trees (SPIHT) and set partitioning in embedded block coder (SPECK) at lower bit rates but also reduces the dynamic memory requirement by 91.1% in comparison to SPIHT. The former objective is achieved by better exploiting the coefficient decaying spectrum of the wavelet transformd images and the later objective is realised by improved listless implementation of the algorithms. The proposed algorithms explicitly perform breadth first search like SPECK. Extensive simulation conducted on various standard grayscale and color images indicate significant peak-signal-to-noise-ratio (PSNR) improvement over most of the state-of-the-art wavelet-based embedded coders including JPEG2000 at lower rates. The reduction of encoding and decoding time as well as improvement in coding efficiency at lower bit rates facilitate these coder as better candidates for multimedia applications.

show abstract

Section: Discussion Related To Coding Performances Between Grayscale mentioning

confidence: 99%

“…12 are directly quoted form Ref. 12. CSPIHT does not need any kind of border extension to encode images because each coefficient in the coarsest subband will constitute a quad tree.…”

Section: Discussion Related To Coding Performances Between Grayscale mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved Listless Embedded Block Partitioning Algorithms for Image Compression

Senapati

Mankar²

2014

Int. J. Image Grap.

View full text Add to dashboard Cite

show abstract

“…This has been done by reducing the LSB of the image and codeword. Moreover, in [30] memory reduction has been considered. The authors have reduced the memory size of the codeword.…”

Section: Vector Quantization Compression (Vq)mentioning

confidence: 99%

Data compression techniques in Wireless Sensor Networks

Sheltami

Musaddiq

Shakshuki

2016

Future Generation Computer Systems

View full text Add to dashboard Cite

“…Let N LIP , N LSP , and N LIS be the number of entries in LIP, LSP, and LIS, respectively. The total memory required in SPIHT (M SPIHT ) is given according to [26] as: ( 1) (in bits)…”

Section: B Memory Analysismentioning

confidence: 99%

An efficient face recognition system based on embedded DCT pyramid

Atta

Ghanbari

2012

IEEE Trans. Consumer Electron.

View full text Add to dashboard Cite

In this paper, an efficient feature selection method based on a combination of DCT pyramid for image decomposition and the concept of the set partitioning in hierarchal trees (SPIHT) for structuring of information for face recognition is presented. In the proposed method, the DCT pyramid decomposes each face image into an approximation subband and a set of reversed L-shape blocks containing the high frequency coefficients. The generalized parent-child relationships of SPIHT algorithm are then established among the DCT pyramids. This leads to efficient selection of the most important coefficients among the layers of the DCT pyramid. Experimental results on the standard ORL and FERET databases show that the proposed method achieves more accurate face recognition than the waveletbased SPIHT feature selection. Moreover, it outperforms the other well-known methods such as the Eigenfaces and the block-based DCT with the zigzag scanning structure in terms of both accuracy and memory requirement 1 .

show abstract

Low complexity, efficient and embedded color image coding technique

Cited by 6 publications

References 13 publications

Improved Listless Embedded Block Partitioning Algorithms for Image Compression

Improved Listless Embedded Block Partitioning Algorithms for Image Compression

Data compression techniques in Wireless Sensor Networks

An efficient face recognition system based on embedded DCT pyramid

Contact Info

Product

Resources

About