International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 105 | Views: 196

Research Paper | Communication or Media Studies | Iraq | Volume 6 Issue 4, April 2017 | Rating: 6.4 / 10

Multi Rates and Resolutions SPIHT with Low Memory

Yahya Ali Lafta AL Husseini

Abstract: For improvement a highly scalable image compression system in order at sizes (resolutions) and qualities (bit rate) are obtained to obtain simply decoding that is achieved by a compressed image. Since, there are many users when the Internet is used and into required that is various user's request. Thus, need how can able to induce that without complexity and much data can be has quality and preserve their size. Therefore, a novel algorithm dominated Highly Scalable-Single List-SPIHT (HS-SLS) is proposed to introduce those purpose. The adaptable bit-stream which is created from HS-SLS algorithm when that is both rate scalable and resolution are gotten as a robustly scalable bit-stream. This can readily its encoder, at any bit-rate involving, can be modified to different resolution requirements, without the required to decode the bit-stream, a very straightforward scaling process that is implemented on-the-fly. An unique feature of the novel algorithm is that due to its easy memory management it has low requirement and low memory complexity. As well as, the size can be established which avoid the dynamic memory allocation problem due to the size of the applicable memory is stationary. For hardware enforcement, the HS-SLS algorithm very convenient due to its merits. As compared to the original SPIHT algorithm that, for these worthy features is very petty shorthand in the algorithm's performance, the price is paid.

Keywords: Highly Scalable Image Compression, Low Memory Image Compression, Set Partitioning image Compression Rate scalability, Resolution scalability, Wavelet image compression SPIHT, Zero-tree coding

Edition: Volume 6 Issue 4, April 2017,

Pages: 1193 - 1202

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait