Results 161 to 170 of about 1,285 (216)
Lossless Image Compression Using Context-Dependent Linear Prediction Based on Mean Absolute Error Minimization. [PDF]
Ulacha G, Ćazoryszczak M.
europepmc +1 more source
Three-Dimensional Point Cloud Applications, Datasets, and Compression Methodologies for Remote Sensing: A Meta-Survey. [PDF]
Dumic E, da Silva Cruz LA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SPIHT image compression on FPGAs
IEEE Transactions on Circuits and Systems for Video Technology, 2005In this paper, we present an implementation of the image compression routine set partitioning in hierarchical trees (SPIHT) in reconfigurable logic. A discussion on why adaptive logic is required, as opposed to an application specific integrated circuit (ASIC), is provided along with background material on the image compression algorithm.
Thomas W. Fry, Scott Hauck
exaly +2 more sources
Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an, 2008
Based on the SPIHT algorithms, we define two modifications to develop a simpler image coding method. The first concept is obtained from the relationship between the bit-planes and the target bit-rate. The second concept is obtained from the relationship between the initial threshold and the target bit-rate.
Jar-Ferr Yang
exaly +2 more sources
Based on the SPIHT algorithms, we define two modifications to develop a simpler image coding method. The first concept is obtained from the relationship between the bit-planes and the target bit-rate. The second concept is obtained from the relationship between the initial threshold and the target bit-rate.
Jar-Ferr Yang
exaly +2 more sources
Performance improvement of the SPIHT coder
Signal Processing: Image Communication, 2004Abstract The set partitioning in hierarchical trees (SPIHT) coder is one of the state-of-the-art coders among the wavelet-based image compression coders. For improving the performance of the SPIHT coder, in this paper, we propose a pre-processing method that applies the discrete sine transform or the discrete cosine transform to the wavelet ...
Ki-Lyug Kim, Sung-Woong Ra
exaly +2 more sources
We propose a new video coding scheme based on discrete wavelet transform (DWT), as it provides a better way to address scalability functionalities, than MPEG-2. To code wavelet coefficients efficiently, we use set partitioning in hierarchical trees (SPIHT) and adaptive arithmetic coding algorithms.
KARLEKAR, JAYASHREE, DESAI, UB
openaire +3 more sources
A Block-Based Pass-Parallel SPIHT Algorithm
IEEE Transactions on Circuits and Systems for Video Technology, 2012Set-partitioning in hierarchical trees (SPIHT) is a widely used compression algorithm for wavelet-transformed images. One of its main drawbacks is a slow processing speed due to its dynamic processing order that depends on the image contents. To overcome this drawback, this paper presents a modified SPIHT algorithm called block-based pass-parallel ...
Yongseok Jin, Hyuk-Jae Lee
exaly +2 more sources
An improved SPIHT algorithm for lossless image coding
Digital Signal Processing, 2009In this paper, we propose a new wavelet-based lossless image coder that is based on a state-of-the-art algorithm, namely SPIHT (set partitioning in hierarchical trees). An algorithmic modification is introduced in order to increase its efficiency. This consists of adding a new test on direct descendants in the sets of type A to process the parent ...
Tahar Brahimi, Fouad Khelifi
exaly +2 more sources
Resolution scalable SPIHT (RS-SPIHT)
SPIE Proceedings, 2006A new embedded rate scalable and resolution scalable, lossless image compression technique based on Highly Scalable - Set Partitioning in Hierarchical Trees (HS-SPIHT) is developed. The new method, called Resolution Scalable-SPIHT (RS-SPIHT), encodes the regions in the next higher resolution that are most likely to be significant along with the current
Dayanand Choundappan +3 more
openaire +1 more source

