• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.310-319
• /
• 2016

This paper proposes an effective FRUC (Frame Rate Up-Conversion) technique, which is based on ROI (Region Of Interest) separations and adaptive motion vector refinement. In this paper, in order to overcome the weakness of the EBME (Extended Bi-lateral Motion Estimation) algorithm, which is widely known in FRUC techniques, first, the proposed algorithm performs a bi-directional motion estimation for the complementary asymmetric region. Then, the proposed algorithm classifies each block into ROI or non-ROI block and refine motion vectors in accordance with their block characteristics to have a higher accuracy than the conventional EBME algorithm, specially, for the occlusion regions. The experimental results show that the proposed algorithm can improves 0.59dB on average PSNR as compared to the conventional method.

• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.756-763
• /
• 2013

Bilateral filter (BF), functioning by two Gaussian filters, domain and range filter is a nonlinear filter for sharpness enhancement and noise removal. In infrared (IR) small target detection field, the BF is designed by background predictor for predicting background not including small target. For this, the standard deviations of the two Gaussian filters need to be changed adaptively in background and target region of an infrared image. In this paper, the proposed bilateral filter make the standard deviations changed adaptively, using variance feature of mean values of surrounding block neighboring local filter window. And, in case the variance of mean values for surrounding blocks is low for any processed pixel, the pixel is classified to flat background and target region for enhancing background prediction. On the other hand, any pixel with high variance for surrounding blocks is classified to edge region. Small target can be detected by subtracting predicted background from original image. In experimental results, we confirmed that the proposed bilateral filter has superior target detection rate, compared with existing methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.112-119
• /
• 1999

TMN5 has been used to evaluate the performance of H.263, the ITU-T/LBC standard of moving picture coding. As DCT is used as transform coding methods in TMN5, blocking effect exists seriously in reconstruction picture at low bit rate. In this pater, DWT is substituted for DCT and adaptive quantizer is designed while the structure of TMN5 is maintained to be excellent in the transplantation of conventional system. It has shown that average PSNR is reduced by 0.35dB in luminance but increased by 2dB in chrominance comparing with that of TMN5. As block effect is reduced in reconstruction picture, the subjective picture quality is better than that of TMN5. Picture drop is, also, reduced because much more frames are transmitted at same bit rate.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1445-1454
• /
• 2006

To compress a specific part of an image with high quality or to transfer it, JPEG2000 standard offers an ROI(Region-of-Interest) image coding method. What is important in ROI coding is to process relative importance between ROI and background and to process ROI mask. We propose an adaptive ROI coding method supplemented the existing Implicit ROI coding and Modified implicit ROI coding to improve image quality and reduce ROI mask information. The proposed method is an EBCOT-based ROI coding that extracts ROI from the compressed bitstream, and gets the ROI mask information by classifying the codeblocks into 6 patterns. The information includes the pattern type(3bit) and the width(5bit) expressing the boundary between two regions for each codeblock. As a result, the method shows an excellent compression performance in ROI region as well as in the whole region of an image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.712-719
• /
• 2008

Temporal error concealment indicates the algorithm that restores the lost video data using temporal correlation between previous frame and current frame with lost data. It can be categorized into the methods of block-based and pixel-based concealment. The proposed method in this paper is for pixel-based temporal error concealment using affine transform. It outperforms especially when the object or background in lost block has geometric transform which can be modeled using affine transform, that is, rotation, magnification, reduction, etc. Furthermore, in order to maintain good performance even though one or more motion vector represents the motion of different objects, we defines a cost function. According to cost from the cost function, the proposed method adopts affine error concealment adaptively. Simulation results show that the proposed method yields better performance up to 1.9 dB than the method embedded in reference software of H.264/AVC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.662-668
• /
• 2013

Mobile communication systems have been adopting link adaptive transmission schemes such as adaptive modulation and coding (AMC) and hybrid-ARQ (HARQ). Incremental redundancy (IR) HARQ scheme is known to be highly efficient in terms of throughput and power consumption and can be a good solution for mobile communication systems. In this paper, we propose an IR-HARQ scheme based on dual-diagonal parity-type block LDPC codes in which we define a transmission priority of coded bits and propose the sub-packet construction rule. We present the throughput performance of IR-HARQ with various modulation and coding and multi-antenna modes. Consequently, the proposed scheme provides the improvement of system throughput by elaborate link adaptation with CQI information.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.282-291
• /
• 2001

In this paper, an efficient VLSI architecture of Shape Adaptive Discrete Cosine Transform(SADCT) based on systolic array is proposed. Since transform size in SADCT is varied according to the shape of object in each block, it are dropped that both usability of processing elements(PE´s) and throughput rate in time-recursive SADCT structure. To overcome these disadvantages, it is proposed that the architecture based on a systolic way structure which doesn´t need memory. In the proposed architecture, throughput rate is improved by consecutive processing of one-dimensional SADCT without memory and PE´s in the first column are connected to that in the last one for improvement of usability of PE. And input data are put into each column of PE in parallel according to the maximum data number in each rearranged block. The proposed architecture is described by VHDL. Also, its function is evaluated by MentorTM. Even though the hardware complexity is somewhat increased, the throughput rate is improved about twofold.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.383-393
• /
• 2010

DVC (Distributed Video Coding) allows us to explore the video statistics at the decoder side, resulting in a less complex encoder and more complex decoder. In this approach, it is important to generate a good prediction to the current Wyner-Ziv frame, called side information, which plays a crucial role in the overall performance of a DVC system. Conventional MCFI (motion compensated frame interpolation) techniques, which explore temporal correlations between neighbor frames of the current frame, preform the block-based or object-based motion estimation, but, they do not include the basis frame for the Wyner-Ziv frame. This paper proposes an efficient way to get better side information, by finding the average frame between neighbor frames and by comparing adaptively the candidate blocks. Through computer simulations, it is shown that the proposed method can improve the performance up to 0.4dB and provide better subjective and objective visual qualities in Wyner-Ziv CODEC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.4C
• /
• pp.312-320
• /
• 2008

The macroblock-based adaptive interpolation filter method has been considered to be able to achieve high coding efficiency in H.264/AVC. In this method, although the filter selection criterion considered in terms of rate and distortion have showed a good performance, it still leaves room for improvement. To improve high coding efficiency better than conventional method, we propose a new filter selection criterion which considers two bit rates, motion vector and prediction error, and reconstruction error. In addition, the algorithm for reducing the overhead of transmitting the selected filter information is presented. Experimental results show that the proposed method significantly improves the coding efficiency compared to ones using conventional criterion. It leads to about a 5.19% (1 reference frame) and 5.14% (5 reference frames) bit rate savings on average compared to H.264/AVC, respectively.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2003.11a
• /
• pp.61-64
• /
• 2003

무손실 이미지 압축은 (Lossless Image Compression)은 손실이미지 압축(Lossy Image Compression)에 비해, 압축률(compression ratio)은 떨어지지만, 반면 원이미지와 복원이미지가 완전히 일치하므로, 원인이미지의 품질을 그대로 유지학 수 있다. 따라서, 이미지의 품질(Quality)과 압축효율(compression ratio)은 서로 상반된 관계에 있으며, 지금도 좀 더 놀은 압축효과를 얻으려는 여러 무손실 압축 방법이 발표되고 있다. 무손실 이미지 압축은 이미지의 정확성과 정밀성이 요구되는, 의료영양분야에서 가장 널리 쓰이고 있으며, 그밖에, 원본이미지를 기본으로 다른 이미지프로세싱이 필요한 경우, 압축 복원을 반복적으로 수행할 필요가 있을 때, 기타 사진 예술분야, 원격 영상 등 정밀성이 요구되는 분양에서 쓰이고 있다. [7]. 무손실 이미지 압축의 가장 대표적인 CALIC[3]과 JPEG_LS[2]를 들 수 있다. CALIC은 비교적 높은 압축률을 나타내지만, 3-PASS의 과정을 거치는 복잡도가 지적되고 있다. 반면 JPEG-LS는 압축률은 CALIC에 미치지 못하지만 빠른 코딩/디코딩 속도를 보인다. 본 논문에서는 여거 가지의 예측 모드를 두어, 블록단위별로 주변 CONTEXT에 따라, 최상의 예측 모드를 판단하여, 이를 적용, 픽셀의 여러 값을 최소화하였다. 그 후 적응산술 부호기(Adaptive arithmetc coder)를 이용하여, 인코딩을 하였다. 이때 최대 에러값은 64를 넘지 않게 했으며, 또한 8*8블록별로 에러의 최대값을 측정하여 그 값을 $0\~7$까지의 8개의 대표값으로 양자화하는 방법을 통하여 그에 따라 8개의 보호화 심볼 모델중 알맞은 모델에 적용하였다. 이를 통해, 그 소화값의 확률 구간을 대폭 넓힘으로써, 에러 이미지가 가지고 있는 엔트로피에 좀 근접하게 코딩을 할 수 있게 되었다. 이 방법은 실제로 Arithmetic Coder를 이용하는 다른 압축 방법에 그리고 적용할 수 있다. 실험 결과 압축효율은 JPEG-LS보다 약 $5\%$의 압축 성능 개선이 있었으며, CALIC과는 대등한 압축률을 보이며, 부호화/복호화 속도는 CALIC보다 우수한 것으로 나타났다.