Image Compression By Speck With Reduced Memory

Abstract

Reduced memory set partitioned embedded block (SPECK) image coder is proposed in this paper large runtime memory is required by the original SPECK algorithm due to use of linked lists, so it is unsuitable for memory constrained portable devices. In the proposed algorithm SPECK coder successfully replace the linked lists by fixed length state tables or markers, to keep track of set partitions and encoded information. The proposed algorithm neither uses any linked list nor any state table, therefore completely eliminating the use of any dynamic memory at the time of its execution. This also reduces the memory access time, thereby making it faster than the original SPECK, while retaining the embedded property and having coding efficiency close to original SPECK.