Efficient implementation of 3D listless SPECK

Ngadiran, Ruzelita, Boussakta, Said, Sharif, Bayan and Bouridane, Ahmed (2010) Efficient implementation of 3D listless SPECK. In: 2010 International Conference on Computer and Communication Engineering (ICCCE), 11-12 May 2010, Kuala Lumpur, Malaysia.

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	G400 Computer Science H600 Electronic and Electrical Engineering
Department:	Faculties > Engineering and Environment > Computer and Information Sciences
Depositing User:	Ellen Cole
Date Deposited:	17 Dec 2012 16:50
Last Modified:	13 Oct 2019 00:30
URI:	http://nrl.northumbria.ac.uk/id/eprint/10494

Downloads