• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.687-695
• /
• 2003

In this paper, we present a document image compression system based on segmentation, Quincunx downsampling, (5/3) wavelet lifting and subband-oriented SPIHT coding. We reduced the coding time by the adaptation of subband-oriented SPIHT coding and Quincunx downsampling. And to increase compression rate further, we applied arithmetic coding to the bitstream of SPIHT coding output. Finally, we present the reconstructed images for visual comparison and also present the compression rates and PSNR values under various scalar quantization methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.7-14
• /
• 2003

A number of embedded wavelet image coding methods have been proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. In this paper We propose a recursive set partitioning in hierarchy trees(RSPIHT) algorithm for embedded image coding and evaluate it's effectiveness experimentally. The proposed RSPIHT algorithm takes the simple and regular form and the worst case time complexity of O(n). From the viewpoint of processing time, the RSPIHT algorithm takes about 16.4% improvement in average than the SPIHT algorithm at T-layer over 4 of experimental images. Also from the viewpoint of coding rate, the RSPIHT algorithm takes similar results at T-layer under 7 but the improved results at other T-layer of experimental images.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.53-56
• /
• 2000

In progressive image coding, if object region that have main contents in image are transmitted prior to the remained region, this method will be very useful. In this paper, the progressive image coding based on SPIHT using object region transmission method by priority is proposed. First, an original image is transformed by wavelet. Median filtering is used about wavelet transformed coefficient region for extracting object region. This extracted object region encoded by SPIHT. Then encoded object region are transmitted in advance of the remained region. This method is good to a conventional progressive image coding about entire original image. Experimental results show that the proposed method can be very effectively used for image coding applications such as internet retrieval and database searching system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.814-821
• /
• 2002

The SPIHT(set partitioning in hierarchical tree) is efficient and well-known in the zerotree coding algorithm. However SPIHT's high memory requirement is a major difficulty for hardware implementation. In this paper we propose low-memory and fast zerotree algorithm. We present following three methods for reduced memory and fst coding speed. First, wavelet transform by lifting has a low memory requirement and reduced complexity than traditional filter bank implementation. The second method is to divide the wavelet coefficients into a block. Finally, we use NLS algorithm proposed by Wheeler and Pearlman in our codec. Performance of NLS is nearly same as SPIHT and reveals low and fixed memory and fast coding speed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.101-109
• /
• 2004

In this paper, we propose an efficient algerian for wavelet-based sti image coding method that utilizes the rate-distortion (R-D) theory. Since conventional tree-structured image coding schemes do not consider the rate-distortion theory properly, they show reduced coding performance. In this paper, we apply an rate-distortion optimized embedding (RDE) operation into the set partitioning in hierarchical trees (SPIHT) algorithm. In this algorithm, we use the rate-distortion slope as a criterion for the coding order of wavelet coefficients in SPIHT lists. We also describe modified set partitioning and rate-distortion optimized list scan methods. Experimental results demonstrate that the proposed method outperforms the SPIHT algorithm and the rate-distortion optimized embedding algerian with respect to the PSNR (peak signal-to-noise ratio) performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.37-43
• /
• 2023

Compressed still image or video bitstreams require protection from channel errors in a wireless channel. Embedded Zerotree Coding(EZW), SPIHT could have provided unprecedented high performance in image compression with low complexity. If bit error is generated by dint of wireless channel transmission problem, the loss of synchronization on between encoder and decoder causes serious performance degradation. But wavelet zerotree coding algorithms are producing variable-length codewords, extremely sensitive to bit errors. The idea is to partition the lifting coefficients. A many partition of lifting transform coefficients distributes channel error from wireless channel to each partition. Therefore synchronization problem that caused quality deterioration in still image and video stream was improved.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.3
• /
• pp.263-269
• /
• 2003

This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3D) irreversible integer wavelet transform. We offer an application of the Set Partitioning in Hierarchical Trees(SPIHT) algorithm〔l-3〕to medical images, using a 3-D wavelet decomposition and a 3-D spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method, where careful scaling and truncations keep the integer precision small and the transform unitary. As the compression rate increases, the boundaries between adjacent coding units become increasingly visible. Unlike video, the volume image is examined under static condition, and must not exhibit such boundary artifacts. In order to eliminate them, we utilize overlapping at axial boundaries between adjacent coding units. We have tested our encoder on medical images using different integer filters. Results show that our algorithm with certain filters performs as well. The improvement is visibly manifested as fewer ringing artifacts and noticeably better reconstruction of low contrast.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.36-40
• /
• 2003

A number of embedded wavelet image coding methods have been Proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. The SPIHT algorithm is computationally very simple, but even so it provides excellent numerical and visual results. But the evaluation of its time complexity is no more than the relative result of experimental comparisons and the strict time complexity analysis wasn't taken until now. In this paper, we analyze strictly the processing time complexity of SPIHT algorithm and prove that the time complexity for one bit-plane processing is O( nlog $_2$n) in worst case.

• Journal of the Korean Society of Radiology
• /
• v.5 no.6
• /
• pp.329-334
• /
• 2011

This paper presents improvement of compression rate for SPIHT algorithm based on wavelet compression through redundancy bit removing. Proposed SPIHT algorithm uses a method to select of optimized threshold from feature of wavelet transform coefficients and removes sign bit only if coefficient is LL area. Finally Proposed SPIHT algorithm applies to Huffman coding. Experimental results show that the proposed algorithm achieves more improvement bit rate and more fast progressive transmission with low bit rate.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.15-20
• /
• 2002

The frame coding inside the screen for a video coder has a big influence on the quality of the whole frame. The standardized video coder uses DCT, however it can give rise to a low image quality due to the blocking effect at low bit rate. This paper proposes a video coding method for an image quality improvement in human visual aspects. With the proposed method, the perceptual weight is coded with SPIHT and VLC by applying it into the frame and the visual noises are eliminated.