Abstract

In this paper, a fast and memory efficient version of set partitioned embedded block (SPECK) image coder is proposed. The original SPECK algorithm generally requires large run-time memory due to use of linked lists, making it unsuitable for memory constrained portable devices. Most of the existing works on low-memory implementations of 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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call