Toggle Main Menu Toggle Search

Open Access padlockePrints

Efficient implementation of 3D listless SPECK

Lookup NU author(s): Ruzelita Ngadiran, Professor Said Boussakta, Professor Bayan Sharif


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


This paper proposes an efficient algorithm for 3D image compression based on Set Partitioned Embedded Block Coding (SPECK). The new algorithm operates without a linked list and is suitable for implementation via hardware applications. 3D listless SPECK has a fixed, predetermined memory requirement that is larger than that required for the image alone. In the new developed algorithm, instead of a list, a state table with four bits per coefficient keeps track of the set partitions and the information that has been encoded. Sparse marking is applied to the selected block nodes of insignificant blocks in the state table. In this way, a large group of predictable insignificant coefficients can be identified and skipped during the coding process. The performance of the proposed listless algorithm is compared with 3D SPECK and the results obtained suggest that the proposed algorithm performs better for several images at various bit rates. © 2010 IEEE.

Publication metadata

Author(s): Ngadiran R, Boussakta S, Sharif B, Bouridane A

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: International Conference on Computer and Communication Engineering (ICCCE)

Year of Conference: 2010

Pages: 4pp

Publisher: IEEE


DOI: 10.1109/ICCCE.2010.5556843

Library holdings: Search Newcastle University Library for this item

ISBN: 9781424462346