Results 191 to 200 of about 1,568 (215)
Some of the next articles are maybe not open access.
Modified SPIHT encoding for SAR image data
Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), 1999Summary form only given. We developed a wavelet-based SAR image compression algorithm which combines tree-structured texture analysis, soft-thresholding speckle reduction, quadtree homogeneous decomposition, and a modified zero-tree coding scheme. First, the tree-structured wavelet transform is applied to the SAR image.
Zhaohui Zeng, Ian G. Cumming
openaire +2 more sources
Region of interest coding using partial-SPIHT
2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004In this paper, a region of interest coding using partial-SPIHT (P-SPIHT) is proposed. P-SPIHT evaluates the probability of the significant coefficients (P/sub 1/) in each bit plane. Then it codes each bit plane independently and according to its P/sub 1/.
Ahmed Abu-Hajar, Ravi Sankar
openaire +2 more sources
SPIHT-NC: network-conscious zerotree encoding
Proceedings DCC 2000. Data Compression Conference, 2002Wavelet 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.
Sami Iren, Paul D. Amer
openaire +2 more sources
Natural image compression based on modified SPIHT
Fourth Annual ACIS International Conference on Computer and Information Science (ICIS'05), 2005Due to the bandwidth and storage limitations, image must be compressed before transmission. The set partitioning in hierarchical trees (SPIHT) algorithm is an efficient method for lossy and lossless coding of image. This paper presents some modifications on the set partitioning in hierarchical trees (SPIHT) algorithm.
Jae-Ju Song +5 more
openaire +2 more sources
VLSI Implementation of a Modified Efficient SPIHT Encoder
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006Set Partitioning in Hierarchical Trees (SPIHT) is a highly efficient technique for compressing Discrete Wavelet Transform (DWT) decomposed images. Though its compression efficiency is a little less famous than Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, SPIHT has a straight forward coding procedure and requires no ...
Win-Bin Huang +2 more
openaire +2 more sources
Iris recognition with image compression using SPIHT
Proceedings of the International Conference and Workshop on Emerging Trends in Technology, 2010Iris recognition is used to identify people. A biometric system provides automatic identification of an individual based on a unique feature or characteristic possessed by the individual. Commercial iris recognition systems are used, to allow access to secure areas, and for secure access to computer networks.
Archana J. Gawad, Shoba Krishnan
openaire +2 more sources
Analysis of SPIHT Algorithm Using Tiling Operations
2010 International Conference on Signal Acquisition and Processing, 2010The aim of this paper is to study the performance of wavelet filters, using SPIHT algorithm with tiling operations for image compression. Tiling operations will be useful when images to be compressed are larger in size. Performance of different wavelets on image compression for different level of wavelet decomposition and for different tiling size is ...
G. Sadashivappa +2 more
openaire +2 more sources
Multichannel EEG compression based on ICA and SPIHT
Biomedical Signal Processing and Control, 2015Abstract In this paper, we propose a novel approach for the compression of multichannel electroencephalograph (EEG) signals. The method assumes that EEG signals are the linear mixture of several independent components (ICs). To retain the ICs, the proposed scheme first applies an independent component analysis (ICA) with a preprocessing step of ...
Lei Lin +3 more
openaire +2 more sources
VLSI Architecture of Arithmetic Coder Used in SPIHT
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2012A high-throughput memory-efficient arithmetic coder architecture for the set partitioning in hierarchical trees (SPIHT) image compression is proposed based on a simple context model in this paper. The architecture benefits from various optimizations performed at different levels of arithmetic coding from higher algorithm abstraction to lower circuits ...
Kai Liu 0021 +2 more
openaire +1 more source
Performance of SPIHT Algorithm for Texture Coding
2003In wavelet based image compression systems a selection of wavelet filter banks is a fundamental decision. Using pre-defined wavelet filter banks and SPIHT algorithm for coding of transform coefficients we have found that 22/14 biorthogonal coiflet wavelet filter bank gives better compression results, especially for texture coding.
Šprljan, Nikola +2 more
openaire +1 more source