Results 171 to 180 of about 1,568 (215)
Some of the next articles are maybe not open access.
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 +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 +2 more sources
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
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 ...
Fouad Khelifi, Tahar Brahimi
exaly +3 more sources
Joint SPIHT compression and selective encryption
Applied Soft Computing, 2014Abstract JCSE-SPIHT, an algorithm of joint compression and selective encryption based on set partitioning in hierarchical trees (SPIHT), is proposed to achieve image encryption and compression simultaneously. It can protect SPIHT compressed images by only fast scrambling a tiny portion of crucial data during the coding process while keeping all the ...
Tao Xiang 0001, Jinyu Qu, Di Xiao 0001
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 +2 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 ...
Hyuk-Jae Lee, Yongseok Jin
exaly +3 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 +3 more sources
Generalization of SPIHT: Set Partition Coding System
IEEE Transactions on Image Processing, 2016This paper constructs a set partition coding system (SPACS) to combine the advantages of different types of set partition coding algorithms. General tree (GT) is an important conception introduced in this paper, which can represent tree set and square set simultaneously.
Qiufu Li +4 more
openaire +2 more sources
An effective improvement on 3D SPIHT
2012 International Conference on Image Analysis and Signal Processing, 2012As an extension of 2D SPIHT, 3D SPIHT inherits the properties of 2D SPIHT, and is suited very well large for volume data compression such as video, medical images, and multispectral images. But it still contains a great deal of redundant search, having not fully improved coding speed.
Zhong Cuixiang, Huaung Minghe
openaire +1 more source