SPIHT-NC: Network-Conscious Zerotree Encoding

نویسندگان

  • Sami Iren
  • Paul D. Amer
چکیده

Wavelet zerotree encoding has been proven to be an efficient way of compressing still images. Two well-known zerotree encoding algorithms, Embedded Zerotree Encoding (EZW) and Set Partitioning in Hierarchical Trees (SPIHT), provide excellent progressive display when images are transmitted over reliable networks. However, both algorithms are state-dependent and can perform poorly over unreliable networks. In this paper, we apply the concept of network-conscious image compression to the SPIHT wavelet zerotree encoding algorithm, to improve its performance over unreliable networks. Experimental results confirm the utility of network-conscious image compression concept.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application level framing applied to image compression

Two well-known wavelet zerotree encoding algorithms, Embedded Zerotree Encoding (EZW) and Set Partitioning in Hierarchical Trees (SPIHT), provide excellent progressive display when images are transmitted over reliable networks. However, both algorithms are state-dependent and can perform poorly over unreliable networks. In this paper, we apply the concept of network-conscious image compression ...

متن کامل

Quantifying the Coding Performance of Zerotrees of Wavelet Coef cients: Degree-k Zerotree

— Locating zerotrees in a wavelet transform allows encoding of sets of coef cients with a single symbol. It is an ef cient means of coding if the overhead to identify the locations is small compared to the size of the zerotree sets on the average. It is advantageous in this regard to de ne classes of zerotrees according to the levels from the root until the remainder of the tree contains all ze...

متن کامل

Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree

Locating zerotrees in a wavelet transform allows encoding of sets of coefficients with a single symbol. It is an efficient means of coding if the overhead to identify the locations is small compared to the size of the zerotree sets on the average. It is advantageous in this regard to define classes of zerotrees according to the levels from the root until the remainder of the tree contains all z...

متن کامل

Non-Memory-Based and Real-Time Zerotree Building for Wavelet Zerotree Coding Systems

The wavelet zerotree coding systems, including Embedded Zerotree Wavelet (EZW)[1] and its variants Set Partitioning In Hierarchical Trees (SPIHT)[2] and Space Frequency Quantization (SFQ)[3][4], have three common procedures: 1) 2-D Discrete Wavelet Transform (DWT)[5], 2) zerotree building and symbol generation from the wavelet coeÆcients (illustrated in Figure 1), and 3) quantization of the mag...

متن کامل

Efficient Coding of Image Subbands using Blockbased Modified SPIHT

Real time transmission of images through handheld mobile/portable devices require an image coding algorithm that performs best at very low bit rate. A number of very successful wavelet-based image coding algorithms have been proposed in the literature. These algorithms are mainly categorized into zerotree and zeroblock approaches. Zerotree algorithms make use of the inter-subband correlations e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000