• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1167-1174
• /
• 2005

In this paper, we propose a priority method on same co-occurrence count in adaptive rank-based reindexing scheme for lossless indexed image compression. The priority on same co-occurrence count in co-occurrence count matrix depends on a front count value on each raw of co-occurrence count matrix, a count value around diagonal line on each raw of the matrix, and a count value around large co-occurrence count on each raw of the matrix. Experimental results show that our proposed method can be reduced up to 1.71 bpp comparing with Zeng's and Pinho's method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.1
• /
• pp.45-51
• /
• 2003

JPEG200, a new international standard for still image compression based on wavelet and bit-plane coding techniques, is developed. In this paper, we design the DWT(Discrete Wavelet Transform) and quantizer for JPEG2000 CODEC. DWT handles both lossy and lossless compression using the same transform-based framework: The Daubechies 9/7 and 5/3 transforms, and quantizer is implemented as SQ(Scalar Quantization). The architecture of the proposed DWT and SQ are synthesized and verified using Xilinx FPGA technology. It operates up to 30MHz, and executes algorithms of wavelet transform and quantization for VGA 10 frame per second.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2363-2366
• /
• 2003

With the increasing use of multimedia technologies, image compression requires higher performance as well as new features such as embedded Tossy to lossless coding, various progressive order, error resilience and region-of-interest coding. In the specific area of still image encoding, a new standard, the JPEG2000, has been currently developed. This paper presents a new compression scheme based on JPEG2000. In the proposed scheme, gray coding is applied to the wavelet coefficient. Since gray coding produces an image whose bit plane is will clustered. The proposed method improves compression efficiency of the JPEG2000.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.462-465
• /
• 2000

It is important to compress three dimensional (3D) data efficiently, since 3D data are too large to store or transmit in general. In this paper, we propose a lossless compression algorithm of the 3D mesh connectivity, based on the vertex degree. Most techniques for the 3D mesh compression treat the connectivity and the geometric separately, but our approach attempts to exploit the geometric information for compressing the connectivity information. We use the geometric angle constraint of the vertex fanout pattern to predict the vertex degree, so the proposed algorithm yields higher compression efficiency than the conventional algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.06a
• /
• pp.83-88
• /
• 1999

In this paper, a novel gray-scale lossless image coder combining context-based minimum mean squared error (MMSE) prediction and entropy coding is proposed. To obtain context of prediction, this paper first defines directional difference according to sharpness of edge and gradients of localities of image data. Classification of 4 directional differences forms“geometry context”model which characterizes two-dimensional general image behaviors such as directional edge region, smooth region or texture. Based on this context model, adaptive DPCM prediction coefficients are calculated in MMSE sense and the prediction is performed. The MMSE method on context-by-context basis is more in accord with minimum entropy condition, which is one of the major objectives of the predictive coding. In entropy coding stage, context modeling method also gives useful performance. To reduce the statistical redundancy of the residual image, many contexts are preset to take full advantage of conditional probability in entropy coding and merged into small number of context in efficient way for complexity reduction. The proposed lossless coding scheme slightly outperforms the CALIC, which is the state-of-the-art, in compression ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4C
• /
• pp.313-320
• /
• 2012

An ECG(Electrocardiogram) compression can increase the processing speed of system as well as reduce amount of signal transmission and data storage of long-term records. Whereas conventional performance evaluations of loss or lossless compression algorithms measure PRD(Percent RMS Difference) and CR(Compression Ratio) in the viewpoint of engineers, this paper focused on the performance evaluations of compression algorithms in the viewpoint of diagnostician who diagnosis ECG. Generally, for not effecting the diagnosis in the ECG compression, the position, length, amplitude and waveform of the restored signal of PQRST wave should not be damaged. AZTEC, a typical ECG compression algorithm, is validated its effectiveness in conventional performance evaluation. In this paper, we propose novel performance evaluation of AZTEC in the viewpoint of diagnostician.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.185-188
• /
• 2002

With improved network system and development of computer technology, a lot of hospitals are equipping PACS that deals with process and transmission of the medical images. Owing to equipment of PACS the problems on transmission and storage of the medical images were treated. The way to solve the problems is to use various image processing techniques and compression methods This paper describes RLC in lossless image compression method, JPEG using DCT in loss image compression applied to medical images as way implementing DICOM standard. Now the medical images were compressed with Wavelet transform method have been taken advantage of image process. And compression rate of each compression methods was analyzed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1227-1237
• /
• 1989

In this paper, we propose a lossless progressive image transmission scheme using hierarchical pyramid structure and classified vector quantizer in DCT domain. By adopting DCT to the hierarchical pyramid signals, we can reduce the spatial redundance. Moreover, the DCT coefficients can be encoded efficiently by using classified vector quantizer in DCT domain. The classifier is simply based on the variance of a subblock. Also, the mirror set of training set of images can improve the robustness of codebooks. Progressive image transmission can be achieved through following processes: from top to bottom level of planes in a pyramid, and from high to low AC variance class in a plane. Some simulation results with real images show that the proposed coding scheme yields a good performance at below 0.3 bpp and an excellent result at 0.409 bpp. The proposed coding scheme is well suited for lossless progressive image transmission as well as image data compression.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9B
• /
• pp.1259-1266
• /
• 2001

최근에 텍스트 압축에 뛰어난 성능을 가지는 블록 정렬 알고리즘인 BW변환 (Burrows-Wheeler Transform)이 소개되었다. 그러나 영상 압축에 BW변환을 직접 적용하면 영상과 텍스트가 갖는 상관성이 서로 다르기 때문에 만족할 만한 압축효과를 기대할 수 없게 된다. 따라서 본 논문에서는 가역의 L-SSKF(Lossless Symmetric Short Kernel Filter)를 사용한 계층적 대역분할로 영상화소 사이의 상관성을 줄인 후 BW변환을 하는 방법과 GAP(Gradient Adjusted Prediction)를 사용하여 LL 대역에 많이 분포된 상관성을 줄인 후 BW변환을 하는 방법을 제안한다. 실험결과 제안한 방법이 기존의 무손실 JPEG 표준안과 LZ 기반의 압축방법(PKZIP) 등에 비해 압축성능이 개선됨을 확인할 수 있었다.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2063-2066
• /
• 2002

In this paper, we propose a structure far lossless audio coding method. Prediction model is used in the wavelet transform domain. After DWT, wavelet coefficients is quantized and decorrelated by prediction modeling. The DWT can be constructed to critical bands. We can get a lower data rate representation of audio signal which has a good quality like the result of perceptual coding. Then the prediction errors are efficiently coded by the Golomb-coding method. The prediction coefficients are fixed for reducing the computational burden when we find prediction coefficients.