Results 161 to 170 of about 1,568 (215)
Three-Dimensional Point Cloud Applications, Datasets, and Compression Methodologies for Remote Sensing: A Meta-Survey. [PDF]
Sensors (Basel)Dumic E, da Silva Cruz LA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
Unsymmetrical SPIHT Codec and 1D SPIHT Codec
2010 International Conference on Electrical and Control Engineering, 2010Conventional SPIHT compression is for a 2D image or image block with the same maximum feasible decomposition level in two directions, so, only the size of image or image block is symmetrical, that is to say the maximum feasible decomposition level in two directions must be same and the image sizes had better be equal to 2level such as 32, 64, 128 etc ...
Zhang Zhi-hui, Zhang Jun
openaire +1 more source
2014 Tenth International Conference on Signal-Image Technology and Internet-Based Systems, 2014
An improved SPIHT algorithm that combines the SPIHT and the sub bands threshold calculation to reduce the number of comparison operations, without sacrificing the reconstructed image quality, is proposed. After applying discrete wavelet transform to the image, the threshold of each independent sub band is calculated.
Humberto de Jesús Ochoa Domínguez +2 more
openaire +2 more sources
An improved SPIHT algorithm that combines the SPIHT and the sub bands threshold calculation to reduce the number of comparison operations, without sacrificing the reconstructed image quality, is proposed. After applying discrete wavelet transform to the image, the threshold of each independent sub band is calculated.
Humberto de Jesús Ochoa Domínguez +2 more
openaire +2 more sources
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 +3 more sources
Image Compression Using SPIHT with Modified Spatial Orientation Trees [PDF]
Procedia Computer Science, 2015 A new way of reordering spatial orientation tree of SPIHT for improving compression efficiencies for monochrome and color images has been proposed. Reordering ensures that SPIHT algorithm codes more significant information in the initial bits.
P Mythili
exaly +2 more sources
Improvement of SPIHT Algorithm
2012 Second International Conference on Intelligent System Design and Engineering Application, 2012In order to enhance the working efficiency of SPIHT algorithm, to reduce its complexity, to implement it easily in the software and hardware, an improvement to the original SPIHT algorithm has been made through adjusting sorting process of wavelet coefficients, substituting for the original chain table structure with one dimensional array, changing ...
Baiping Li, Xueyan Zhang
openaire +1 more source
SPIHT image compression without lists
2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), 2002A variant of the SPIHT image compression algorithm called no list SPIHT (NLS) is presented. NLS operates without linked lists and is suitable for a fast, simple hardware implementation. NLS has a fixed predetermined memory requirement about 50% larger than that needed for the image alone.
Frederick W. Wheeler +1 more
openaire +1 more source
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 +3 more sources