• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1007-1010
• /
• 2002

In this paper, we present a new blocking artifact reduction algorithm using interpolation and signal adaptive filter (SAF) based on the edge map. Generally, block-based coding, such as JPEG and MPEG, is the most popular image compression method. However, for high compression it produces noticeable blocking and ringing artifacts in the decoded image. In proposed method, all the block is classified into low and high frequency blocks in block classification procedure. And edge map is obtained by using Sobel operator on decoded image. And according to the block property we applied blocking artifacts reduction algorithm. Namely, four neighbor low frequency block is participated in interpolation based on edge map. And ringing artifacts is removed by applying a signal adaptive filter around the edge using edge map in high frequency block. The computer simulation results confirmed a better performance by the proposed method in both the subjective and objective image qualities.

• Journal of Astronomy and Space Sciences
• /
• v.13 no.2
• /
• pp.198-209
• /
• 1996

In this paper, we present an image compression algorithm that is capable of significantly reducing the vast mount of information contained in multispectral images. The developed algorithm exploits the spectral and spatial correlations found in multispectral images. The scheme encodes the difference between images after contrast/brightness equalization to remove the spectral redundancy, and utilizes a two-dimensional wavelet trans-form to remove the spatial redundancy. The transformed images are than encoded by hilbert-curve scanning and run-length-encoding, followed by huffman coding. We also present the performance of the proposed algorithm with KITSAT-1 image as well as the LANDSAT MultiSpectral Scanner data. The loss of information is evaluated by peak signal to noise ratio (PSNR) and classification capability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.120-127
• /
• 2000

In this paper, we propose multispectral image compression using classified interband prediction and vector quantization in wavelet domain. This method classifies each region considering reflection characteristics of each band in image data. In wavelet domain, we perform the classified intraband VQ to remove intraband redundancy for a reference band image that has the lowest spatial variance and the best correlation with other band. And in wavelet domain, we perform the classifled interband prediction to remove interband redundancy for the remaining bands. Then error wavelet coefficients between original image and predicted image are intraband vector quantized to reduce prediction error. Experiments on remotely sensed satellite image show that coding efficiency of theproposed method is better than that of the conventional method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.1
• /
• pp.82-88
• /
• 2000

In this paper, We compare the Harr wavelet of the S+P transform with various integer coefficient filter banks and apply 9/7 ICFB to the wavelet transform. In addition, we propose a entropy-coding method that exploits the multiresolution structure and the feedback of the prediction error, and can efficiently compress the transformed image for progressive transmission. Simulation results are included to compare to the compression ratio using the S+P transform with different types of images.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.2
• /
• pp.124-130
• /
• 2005

In this paper, low-power design and implementation techniques for DWT(Discrete Wavelet Transform) of the JPEG2000 compression are proposed. In DWT block of the JPEG2000, linear phase 9 tap and 7 tap filters are used. For low-power implementation of those filters, processor technique for DA(Distributed Arithmetic) filter and minimization technique for number of addition in CSD(Canonic Signed Digit) filter are utilized. Proposed filter structure consists of 3 blocks. In the first CSD coefficient block, every possible 4 bit CSD coefficients are calculated and stored. In second processor block, multiplication is done by MUX and addition processor in terms of the binary values of filter coefficient. Finally, in third block, multiplied values are output and stored in flip-flop train. For comparison of the implementation area and power dissipation, proposed and conventional structures are implemented by using Verilog-HDL coding. In simulation, it is shown that 53.1% of the implementation area can be reduced comparison with those of the conventional structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.10
• /
• pp.964-971
• /
• 1991

In DPCM coder which has flat notse distributions, reconstruction noises might be shaped or transferred to hign frequency portion using the relevant noise reduction loop under the constraints of image compression. Noise shaping filter directly in loop can be used, but we shows the complete characteristics of signal blurred DPCM coder in view of data compression and noise processing. Equi weighting in bluming procedure of prefilter is introduced and the blurred signal is restored by debiurning postfilter. Noise shaping tegion on two dimensional frequency domain depends upon the size of masking filter. In spite of its noise increments by the signal blurring, the algonthm is effective for the visually relevant coding which has low pass freqency properties.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1382-1397
• /
• 1991

The QM-Coder based on the recommandation of the JBIG committee has been studied for applying it to G3 FAX. In the point of view of implementation. the QM-Coder is modified to have following properties : 1) initialized at each start of the new line for protecting the error propagation, 2) pixel context for error estimation, fill bit insertion to meet minimum scan line time of 10 msec. and it is found that the modified QM-Coder is useful for encoding half tone images for low end G3 FAX machine, For higher compression ration than QM-Coder in encoding of the image binarized by ordered orther thchniques, a rearranging process before applying the QM-Coder is used and the resultant compression ratic was increased 1.13∼1.31 times than that of the conventional QM-Coder.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.21-26
• /
• 2012

As electrocardiogram (ECG) signals are generally sampled with a frequency of over 200 Hz, a method to compress diagnostic information without losing data is required to store and transmit them efficiently on a wireless personal area network (WPAN). In this paper, an ECG signal compression method for communications onWPAN, which uses feature points based on curvature, is proposed. The feature points of P, Q, R, S, and T waves, which are critical components of the ECG signal, have large curvature values compared to other vertexes. Thus, these vertexes were extracted with the proposed method, which uses local extrema of curvatures. Furthermore, in order to minimize reconstruction errors of the ECG signal, extra vertexes were added according to the iterative vertex selectionmethod. Through the experimental results on the ECG signals from Massachusetts Institute of Technology-Beth Israel hospital arrhythmia database, it was concluded that the vertexes selected by the proposed method preserved all feature points of the ECG signals. In addition, it was more efficient than the amplitude zone time epoch coding method.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.1
• /
• pp.112-119
• /
• 2002

We propose an enhanced wavelet packet image coder algorithm which is based on the coefficients partition. The proposed wavelet packet image coder uses the first-order entropy to reduce the total compression time, and achieves low bit rates and rate-distortion performance by the zero-tree based coding using correlations between coefficients partition. This new algorithm represents new parent-children relationships for reducing image reconstruction error using the correlations between each frequency subbands and then the wavelet packet coefficients are Partitioned by a new order. The computer simulations demonstrate higher PSNR under the same bit rate and improved image compression time and enhanced rate control compare with conventional algorithms. From the simulation results, it is shown that the encoding and decoding process of proposed coder are much simple and accurate than present method against texture images , which include many mid-frequency elements.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.11a
• /
• pp.79-81
• /
• 2022

MPEG-VCM(Video Coding for Machines)에서는 머신비전(machine vision) 네트워크의 백본(backbone)에서 추출된 이미지/비디오 특징 압축을 위한 표준화를 진행하고 있다. 현재 VCM 표준기술 탐색 과정에서 가장 좋은 압축 성능을 보이는 MSFC(Multi-Scale Feature compression) 기반 압축 네트워크 모델은 추출된 멀티-스케일 특징을 단일-스케일 특징으로 변환하여 특징맵으로 구성하고 이를 VVC 로 압축한다. 본 논문에서는 MSFC 기반 압축 모델에서 Min-Max 값 시그널링을 제외한 최소-최대(Min-Max) 정규화를 포함한 개선된 특징맵 생성 기법을 제시한다. 즉, 제안기법은 VCM 디코더에서의 특징맵 복원을 위한 Min-Max 값을 학습 기반으로 생성함으로써 Min-Max 시그널링의 비트 오버헤드 절감뿐만 아니라 별도의 시그널링 기제를 생략한 보다 단순한 전송 비트스트림 구성을 가능하게 한다. 실험결과 제안기법은 이미지 앵커(Anchor) 대비 BPP-mAP 성능에서 83.24% BD-rate 이득을 보이며, 이는 기존 MSFC 보다 1.74%정도 다소 떨어지지만 별도의 Min-Max 시그널링 없이도 기존의 성능을 유지할 수 있음을 보인다.