• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.9
• /
• pp.663-669
• /
• 2004

The mobile tole-cardiology system is the new research area that support an ubiquitous health care based on mobile telecommunication networks. Although there are many researches presenting the modeling concepts of a GSM-based mobile telemedical system, practical application needs to be considered both compression performance and error corruption in the mobile environment. This paper evaluates three wavelet ECG compression algorithms over CDMA networks. The three selected methods are Rajoub using EPE thresholding, Embedded Zerotree Wavelet(EZW) and Wavelet transform Higher Order Statistics Coding(WHOSC) with linear prediction. All methodologies protected more significant information using Forward Error Correction coding and measured not only compression performance in noise-free but also error robustness and delay profile in CDMA environment. In addition, from the field test we analyzed the PRD for movement speed and the features of CDMA 1X. The test results show that Rajoub has low robustness over high error attack and EZW contributes to more efficient exploitation in variable bandwidth and high error. WHOSC has high robustness in overall BER but loses performance about particular abnormal ECG.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.61-64
• /
• 2000

EZW 알고리듬을 수행하는 동안 네 가지의 심벌 (POS, NEG, IZ, ZT)을 사용하게 된다. 하지만 POS 또는 NEG 심벌을 가지는 계수들의 하위밴드의 계수들이 모두 ZT 심벌을 가질 경우 도미넌트 계수열을 만드는데 있어서 데이터의 낭비가 심하다. 이러한 단점을 보완하기 위해 여섯개의 심벌(POS, NEG, IPOS, INEG, IZ, ZT)을 이용한 알고리듬이 제안된 바 있다. 하지만 경우에 따라서 4개의 심벌을 이용한 본래의 알고리듬보다 왜곡이 심한 경우가 간혹 발생하게 된다. 본 논문에서는 네 개의 심볼(LS, IS, IZ, ZT)을 이용한 새로운 알고리듬을 제안한다.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.9
• /
• pp.76-84
• /
• 1999

EZW proposed by Shapiro is based on a zerotree constructed in a way that a parent coefficient in a subband is related to four child coefficients in the next finer subband of similar orientation. This fixed treeing based on 1-to-4 parent-child is suitable to exploti hierachical correlations among subbands but not to exploit spatial correlations within a subband. A new treeing by Joo, et al. is suggested to simulatneously exploit those two correlatins by extending parent-child relationship in a flexible way. The flexible treeing leads to increasing the number of symbols and lowering entorpy comparing to the fixed treeing, and therefore a better compression can be resulted. In this paper, we suggest two techniques to suppress the increasing of symbols. First, a probing bit is generated to avoid redundant scan for insignivicant coefficients. Second, since all subbands do not always require the same kind of symbol-set, produced symbols are re-symbolized into binary codes according to a pre-defined procedure. Owing to those techniques, all symbols are generated as binary codes. The binary symbols can be entropy-coded by an adaptive arithmetic coding. Moerover, the binary symbol stream can give comparatively good performances without help of additional entropy coding. Our proposed coding scheme is suggested in two modes: binary coding mode and arithmetic coding mode. We evaluate the effectivenessof our modifications by comparing with the original EZW.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.19-22
• /
• 2000

In this paper, we present a new multiple description embedded zerotree wavelet coding method using the two splitted thresholds. We first model a half EZW coder and then we present multiple description coder which has two coding channels using wide threshold EZW(WTEZW) coders. To evaluate the performance of the proposed coder, we provide an image coding applications with two descriptions and compare MDC image coding results reported to date.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.27-30
• /
• 2000

In this paper, we propose new method for denoising in processing the image compression. Usually, to compress the noise image, we must have the denoising step before encoding. But this method has a embedded character, so need not an additional noise eliminator. In SAQ step, an embedded signal is quantized more detail and the other side is suppressed. Comparing with the conventional method, we can get the enhanced image quality.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.743-746
• /
• 2001

An improved zerotree-structure based wavelet coding algorithm is proposed. When the descendants of a significant coefficient are all zerotree, its four-childs are coded respectively in conventional EZW. But in the proposed algorithm, a new symbol is assigned for the significant coefficient. Entropy for both methods are analyzed and new coding scheme is proposed. The experimental results show that the Proposed algorithm has a better performance than the original EZW algorithm.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.58-66
• /
• 2003

In this paper. an image compression of embedded zerotree structure using multiwavelet filter banks is proposed. Multiwavelet is used DGHM(Donovan, Geronimo, Hardin, and Massopust) scaling functions and wavelet functions of a new method with two channel fillet banks. The important properties of the DGHM multiwavelet are orthogonality and approximation order. The DCHM muitiwavelet using the this paper preserves the approximation order=2 for better energy compaction and perfect reconstruction. Image compression using the preposed DGHM multiwavelet is better PSNR for compression ratio than single Daubechies wavelet(D4), Biorthogoanl wavelet, and GHM(Geronimo, Hardin, and Massopust) multi wavelet.

• Journal of Digital Contents Society
• /
• v.7 no.1
• /
• pp.53-58
• /
• 2006

In this paper, We proposed extraction method using EZW a specific character and then add watermark significant coefficient of image. After wavelet transform in image, the significant coefficient value add to watermark information image. In this method, the locations of nonzero wavelet coefficients are encoded with a tree structure, called zerotree, which can exploit the self-similarity of the pyramid decomposition across different scales. The simulation shows that this method provides a superior performance over conventional method and can be successfully applied to the application areas that requires of progressive transmission and search for image data.

• 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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.189-194
• /
• 1998

We introduce a new zerotree scheme that effectively exploits the inter-scale self-similarities found in the octave decomposition by a wavelet transform. A zerotree is useful to efficiently code wavelet coefficients and its efficiency was proved by Shapiro's EZW. In the coding scheme, wavelet coefficients are symbolized and entropy-coded for more compression. The entropy per symbol is determined from the produced symbols and the final coded size is calculated by multiplying the entropy and the total number of symbols. In this paper, were analyze produced symbols from the EZW and discuss the entropy per symbol. Since the entropy depends on the produced symbols, we modify the procedure of symbolic streaming out for the purpose. First, we extend the relation between a parent and children used in the EZW to raise a probability that a significant parent has significant children. The proposed relation is flexibly extended according to the fact that a significant coefficient is highly addressed to have significant coefficients in its neighborhood. The extension way is reasonable because an image is decomposed by convolutions with a wavelet filter and thus neighboring coefficients are not independent with each other.