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.
|Publication status||Published - May 2010|
|Event||2010 International Conference on Computer and Communication Engineering (ICCCE) - Kuala Lumpur, Malaysia|
Duration: 1 May 2010 → …
|Conference||2010 International Conference on Computer and Communication Engineering (ICCCE)|
|Period||1/05/10 → …|