Results 221 to 230 of about 52,311 (259)

Memory Efficient Set Partitionning in Hierarchical Tree (MESH) for Wavelet Image Compression

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005., 2006
This paper presents a memory efficient version of set partitioning in hierarchical tree (SPIHT). The proposed coder termed as memory efficient SPIHT (MESH), uses a single re-usable list instead of three continuously growing linked lists as in conventional SPIHT.
Harish Arora, Pramit Singh, Ekram Khan, Farid Ghani   +3 more
openaire   +1 more source

Compressing discrete cosine transform coefficients by modified set partitioning in hierarchical trees

Journal of Electronic Imaging, 2005
The discrete cosine transform (DCT) is widely used in many practical image/video compression systems because of its compression performance and computational efficiency. We adopt the DCT and the modified set partitioning in hierachical trees (SPIHT) algorithm that was designed initially for encoding the dis- crete wavelet transform (DWT) coefficients ...
Wen-Chien Yen, Yen-Yu Chen, Shen-Chuan Tai   +2 more
openaire   +1 more source

Wavelet packet transform basis selection method for set partitioning in hierarchical trees

Journal of Electronic Imaging, 2008
The dyadic wavelet-based set partitioning in hierarchical trees (SPIHT) is highly efficient in coding nontextured images while the wavelet packet transform (WPT) is able to provide an optimal representation for textured images. However, incorporating the WPT with SPIHT to improve the performance of SPIHT is not as straightforward as it would seem ...
Ashraf A. Kassim, Yan Niu, Dornoosh Zonoobi   +2 more
openaire   +1 more source

IMAGE EMBEDDED ENCONDING USING SET PARTITIONING IN HIERARCHICAL TREE - SPIHT

2018 29th Irish Signals and Systems Conference (ISSC), 2018
This paper discusses an embedded image compressing technique using the simplified Set Partitioning Hierarchical Tree algorithm implemented in the digital signal processing board Blackfin ADSP BF561 from Analog Devices, reaching a compression of 0.5 bits per pixel an acceptable quality of the recovered image determined using the mean opinion score over ...
Eduardo A. Gerlein, Paula A. Beltran, Nestor R. Cabrera, Juan D. Romero   +3 more
openaire   +1 more source

Memory efficient set partitionning in hierarchical tree for color image coding

Proceedings of 2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, 2004., 2005
A memory efficient version of color SPIHT with enhanced features is presented. The proposed coder, termed color memory efficient SPIHT (CMESH) extends the use of set partitioning in hierarchical trees to color images. The exciting feature of the algorithm is that it uses a single re-usable list instead of three continuously growing linked lists as in ...
F. Ghani, E. Khan, H. Arora
openaire   +1 more source

Medical image compression with set partitioning in hierarchical trees

Proceedings of 18th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2002
Wavelet-based image compression is proving to be a very effective technique for medical images, giving significantly better results than the JPEG algorithm. A novel scheme for encoding wavelet coefficients, termed set partitioning in hierarchical trees, has recently been proposed and yields significantly better compression than more standard methods ...
openaire   +1 more source

Embedded human face image coding with set partitioning in hierarchical trees

Proceedings of 2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, 2004., 2005
For human face images, the region of human face (ROHF) is considered to be the most important part, while the background is allowed to have degraded quality because it is considered to be less important. In this paper, a human face detection algorithm is combined with the set partitioning in hierarchical trees (SPIHT) algorithm for wavelet-based image ...
null Li Zhao, null Kin-Man Law, null Lansun Shen   +2 more
openaire   +1 more source

Threshold setting model for the set partitioning in hierarchical trees (SPIHT) for audio

SPIE Proceedings, 2011
This paper describes applying the Set Partitioning in Hierarchical Trees (SPIHT) algorithm using a devised model to compress audio signals. It allows choosing the amount of compression based upon bit rate requirements. A threshold setting model, based on energy and frequency patterns of the signal is used to assist the SPIHT encoder set efficient ...
openaire   +1 more source

Image compression with wavelet transforms and set partitioning in hierarchical trees method

Proceedings of the IEEE 12th Signal Processing and Communications Applications Conference, 2004., 2004
Digital images are claiming an increasingly larger portion of the information world. In this study, the wavelet transform is chosen for image compression. The image is decomposed into subbands of averages and details with the wavelet transform. The obtained detail subbands have small valued coefficients that also constitute a small percentage of image ...
G. Bilgin, U. Kucuk
openaire   +1 more source

An effective image compression technique based on burrows wheeler transform with set partitioning in hierarchical trees

Concurrency and Computation: Practice and Experience, 2021
AbstractIn this article, the efficient image compression which consists of Burrows–Wheeler transform (BWT) with set partitioning in hierarchical trees (SPIHT). The main phases of the proposed system are: partitioning, compression of non‐ROI areas, Fusion and compression of ROI areas. To enhance the propose of the proposed methodology, the morphological
Sekar Arunpandian, Subbaiah S. Dhenakaran   +1 more
openaire   +1 more source