In Image Compression, the researchers' aim is to reduce the number of bits required to
represent an image by removing the spatial and spectral redundancies. Recently discrete …

In this paper, a new image compression algorithm is proposed based on the efficient
construction of wavelet coefficient lower trees. The main contribution of the proposed lower …

Set partitioning in heirarichal trees (SPIHT) is a widely used compression algorithm for
wavelet transformed images. Of most algorithms developed, SPIHT algorithm ever since its …

A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the
common" forward" coding of wavelet trees from the highest level (lowest resolution), the new …

When comparing the performance of different video coding approaches, improvements or
new codec designs, one of the most important performance metrics is the rate/distortion …

An image coding algorithm, progressive resolution coding (PROGRES), for a high-speed
resolution scalable decoding is proposed. The algorithm is designed based on a prediction …

As the geometries of the transistors reach the physical limits of operation, one of the main
design challenges of systems-on-chips (SoCs) will be to provide dynamic (run-time) support …

We perform an in-depth analysis of current state-of-the-art waveletbased 3D model coding
techniques and then present a new one that outperforms them in terms of compression …

The constraints of traditional wavelet filters and wavelet coefficients such as it can not be
based on the input signal changes, combined with underwater acoustic channel …

A very fast, low complexity algorithm for resolution scalable and random access decoding is
presented. The algorithm avoids the multiple passes of bit-plane coding for speed …