Results 131 to 140 of about 244 (177)
Some of the next articles are maybe not open access.
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 +1 more source
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 +1 more source
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
openaire +1 more source
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
Proceedings of IEEE TENCON '98. IEEE Region 10 International Conference on Global Connectivity in Energy, Computer, Communication and Control (Cat. No.98CH36229), 2002
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 +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 +2 more sources
SPIHT Algorithm Combined with Huffman Encoding
2010 Third International Symposium on Intelligent Information Technology and Security Informatics, 2010SPIHT is computationally very fast and among the best image compression algorithms known today. According to statistic analysis of the output binary stream of SPIHT encoding, propose a simple and effective method combined with Huffman encode for further compression.
Wei Li, Zhen Peng Pang, Zhi Jie Liu
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
Robust image hashing based on SPIHT
ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005., 2005Media hashing is an important resolving skill of copyright infringement. In this paper, a novel robust image hashing scheme is proposed. The set partitioning in hierarchical trees (SPIHT) algorithm, widely employed in image compression, is used to extract the identification information of images.
Shih-Hsuan Yang, Chin-Feng Chen
openaire +1 more source
Improving SPIHT Using Virtual Encapsulation
Circuits, Systems and Signal Processing, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kassim, A.A., SeeToh, C.-W.
openaire +2 more sources
FPGA implementation of a reconfigurable SPIHT coprocessor
Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings., 2003Third generation mobile communication standards is soon enable an ubiquitous fruition of audio-visual services. Beyond these attractive motivations, some critical factors are hidden: the design of wireless terminals has to deal with limited power budgets and reduced resources availability.
MARTINA, MAURIZIO +3 more
openaire +2 more sources
Differential-SPIHT for image sequence coding
2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010Efficient image sequence coding exploits both spatial correlation and temporal correlation. SPIHT is a powerful algorithm in exploiting spatial correlations for still image coding. Based on SPIHT, we present a novel approach to exploit temporal correlations for image sequence coding, while maintaining single frame, random access decoding. The so-called
Yang Hu, William A. Pearlman
openaire +1 more source