Earticle

초록

영어

In this paper, a fast and memory efficient version of set partitioned embedded block (SPECK) image coder is proposed. Due to use of linked lists, SPECK algorithm, requires large run-time memory, making it unsuitable for memory constrained portable multimedia devices and WMSN’s. The proposed coder replace linked list with fixed size static memory, to keep track of set partitions and coding information and use few markers to facilitate coding. Elimination of linked lists also reduces the memory access time and time involved in addition /deletion in memory, thereby making it faster than the original SPECK. Simulation results show that the proposed algorithm outperforms SPECK image coder in terms of memory requirement while retaining the coding efficiency and scalability property of the original SPECK. Proposed coder requires 0.75 bit per pixel state memory which is 9.38 % of the memory required to store the image. Therefore proposed NLSK coder is suitable for resource constrained portable hand held devices and WMSN’s.

목차

Abstract
 1. Introduction
 2. Overview of SPECK and LSK Algorithm
 3. Proposed NLSK Algorithm
  3.1. Linear Indexing
  3.2. NLSK Algorithm
  3.3 State Memory Requirement
  3.4 Computational Complexity
 4. Simulation Results
  4.1 Coding Efficiency
  4.2 State Memory Requirement
 5. Conclusions
 References

키워드

저자

• Naimur Rahman Kidwai [ Department of ECE, Integral University ]
• M. Alam [ Department of ECE, Integral University ]
• Ekram Khan [ Department of Electronics Engg ]
• Rizwan Beg [ Department of CSE, Integral University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Signal Processing, Image Processing and Pattern Recognition

• 간기

  격월간

• pISSN

  2005-4254

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605