• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.2
• /
• pp.24-28
• /
• 1984

A new type of digital echo canceler for two-wire digital transmission is presented. The new principle estimates an echo signal by use of the arithmetic means estimate for each transmitted data pattern, which leads to relatively simple hardware. The principle is compared with adaptive digital filter methods through theoretical analysis and computer simulation. The results show that the proposed method has fast convergence property with respect to its hardware simplicity and that the convergence time is independent of echo level. Quantization effects are also analyzed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.538-540
• /
• 2000

본 논문에서는 적응적인 웨이블릿 변환에 기초한 저속 비트율 비디오 코딩 방법의 새로운 알고리즘을 제안한다. 접근 방법은 양자화된 웨이블릿 계수들이 웨이블릿 서브밴드 구조내에서 중복성을 활용하는 메커니즘에 의해서 전처리 된다면 코딩 절차가 더욱 효과적으로 나타난다. 그러므로 본 논문에서는 코딩부분의 최적화 활동에 초점을 맞추어 완전한 중복 블록 움직임 보상된 에어프레임에서 일치를 확보하기 위해 이용하고, 향상된 코사인 윈도우를 적용하였다. 또한 웨이블릿 변환은 각 일치한 움직임 보상된 에러 프레임을 전체적인 에너지 컴팩션에 도달하도록 적용된다. 움직임 벡터의 수평적, 수직적 컴포넌트는 적응적 산술적 코딩을 사용하여 독립적으로 인코드되는 반면에 의미있는 웨이블릿 계수는 적응적 산술 코딩을 사용함에 의해서 비트-플레인 순서로 인코드된다. 제안된 부호기는 28Kbits에서 PSNR이 평균적으로 각각 대략 2.07과 1.38dB에 존재하는 H.263과 ZTE를 초과한다. 전체순서 코딩에 대하여도 3DWCVC 방법은 평균적으로 각각 0.35와 0.71dB을 나타내는 H.263과 ZTE보다 우수한 성능을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.934-937
• /
• 2015

본 논문은 비디오 디코더의 병목현장을 해결하고 대량의 데이터를 처리할 수 있는 다중병렬처리방식의 HEVC CABAC 디코더를 소개한다. CABAC 디코더를 병렬화한 하드웨어 VLSI구조를 설계하여 크기 대비 높은 처리량이 나오는지를 설계 및 분석결과를 통해 연구결과를 도출하는 게 본 논문의 목적이다. CABAC 디코더 내부 module(산술 디코더, 문맥 모델러, 역이진화기) 1개에서 4개까지의 병렬화를 분석한 결과 4개의 병렬화를 했을 때가 크기 대비 처리량이 가장 높다는 것을 알 수 있었다. 또한 내부 module 4개를 병렬화한 CABAC 디코더 4개를 병렬화하여 slice 단위로 나눠진 프레임 1개를 한 번에 처리하는 방식을 채택하였다. 본 논문에서는 각 CABAC 디코더의 내부 module 4개를 병렬화하고, 병렬화한 CABAC 디코더 4개를 다시 병렬화하는 하드웨어 구조를 사용한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.3
• /
• pp.287-293
• /
• 2012

This paper presents an efficient image registration method by measuring the similarity, which is based on multi-dimensional intensity fluctuation. Multi-dimensional intensity which considers 4 directions of the image, is applied to reflect more properties in similarity decision. And an intensity fluctuation is also applied to measure comprehensively the similarity by considering a change in brightness between the adjacent pixels of image. The normalized cross-correlation(NCC) is calculated by considering an intensity fluctuation to each of 4 directions. The 5 correlation coefficients based on the NCC have been used to measure the registration, which are total NCC, the arithmetical mean and a simple product on the correlation coefficient of each direction and on the normalized correlation coefficient by the maximum NCC, respectively. The proposed method has been applied to the problem for registrating the 22 face images of 243*243 pixels and the 9 person images of 500*500 pixels, respectively. The experimental results show that the proposed method has a superior registration performance that appears the image properties well. Especially, the arithmetical mean on the correlation coefficient of each direction is the best registration measure.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.200-202
• /
• 2014

본 논문은 High bit-depth 를 위한 SIMD (Single Instruction, Multiple Data) 명령어 기반 보간 필터 고속화 방법을 제안한다. 픽셀 연산을 기반으로 하는 보간 필터링은 HEVC 복호화기에서 높은 복잡도를 차지하고 있지만 반복적인 산술연산을 수행하기 때문에 SIMD 를 이용한 고속화에 적합한 구조를 가지고 있다. 이러한 이유로 본 논문에서는 보간 필터 연산에 대하여 SIMD 명령어를 이용하여 메모리를 효율적으로 사용하여 고속화하는 방법을 제안한다. 제안하는 기술은 HEVC 참조 소프트웨어 HM 12.0-RExt 4.1 에 기반을 둔 ANSI C 기반 자체 개발 HEVC RExt 복호화기 소프트웨어에서 평균 8.5%의 복호화 속도향상을 보였으며, 보간 필터의 수행 시간을 평균 24.8% 향상시켰다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.186-187
• /
• 2012

본 논문에서는 기존의 표준 동영상 부호기의 산술적 연산 복잡도 및 대역폭을 낮추기 위하여 양자화된 두 영상에서 움직임을 예측하는 고속 영상 부호화 알고리즘을 제안한다. 기존에 제안된 이진 변환 기반 움직임 예측 알고리즘은 표적 영상과 참조 영상의 각 매크로 블록 단위로 가우시안 양자화를 적용한 뒤, 움직임 예측을 수행하기 때문에 블록 단위의 아티팩트로 인한 탐색 성능 저하를 피할 수 없다. 따라서, 우리는 참조 영상의 탐색 영역에 대해 하나의 양자화기를 적용함으로써 보다 정확한 움직임을 예측한다. 또한, 기존 알고리즘이 하나의 가우시안 양자화기를 적용하는 것과 달리, 제안 알고리즘은 데이터 특성 파악에 따른 다양한 확률 모델을 가정한 뒤 각 모델에 적합한 최적의 양자화기를 적용함으로써 블록 매칭 오류를 낮춘다. 실험 결과를 통해 제안 알고리즘이 기존의 이진 변환 기반 움직임 예측 알고리즘에 비해 보다 정확한 움직임 벡터를 예측함을 보인다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.6 s.360
• /
• pp.42-49
• /
• 2007

CABAC(Context-based Adaptive Binary Arithmetic Coding) among various entropy coding schemes which are used to improve compression efficiency in H.264/AVC has a high hardware complexity and the fast calculation is difficult because data dependancy exists in the bit-serial process. In this paper, the proposed architecture efficiently compose the renormalization process of binary arithmetic encoder which is an important part of CABAC used in H.264/AVC. At every clock cycle, the input symbol is encoded regardless of the iteration of the renormalization process for every input symbol. Also, the proposed architecture can deal with the bitsOutstanding up to 127 which is adopted to handle the carry generation problem and encode input symbol without stall. The proposed architecture with three-stage pipeline has been synthesized using the 0.18um Dongbu-Anam standard cell library and can be operated at 290MHz.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.10 no.6
• /
• pp.35-43
• /
• 2010

This study was carried out to find reliable relations between various concrete strength properties which are used as input data in concrete pavement design program. Concretes were made from different sources of coarse grained(granite, limestone and sandstone) and fine grained aggregates such as natural sand, washed sand and crushed sand. From strength test results, model equations were obtained based on the relation between strengths. For each coarse grained aggregate, models for compression-flexural strengths, compression-split tensile strengths, compressive strength-modulus and flexural-split tensile strengths with age were obtained. For concrete mixed with gneiss granite aggregates, concrete strengths were obtained from numerical mean values of concrete strengths mixed with fine grained aggregates. In addition models for concrete split tensile strengths and modulus values were provide by averaging numerically the estimated values obtained from the derived relationship and the experimental values. This is due to more scattered values of split tensile strengths and modulus values than other strength properties. Finally criteria for drying shrinkage strain as well as Poisson's ratio for concrete used in pavement were presented for all mixes with differed coarse grained aggregates.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.155-164
• /
• 2015

This paper describes a design and implementation of CABAC decoder, which would handle HEVC syntax elements in adaptively pipelined-parallel computation manner. Even though CABAC offers the high compression rate, it is limited in decoding performance due to context-based sequential computation, and strong data dependency between context models, as well as decoding procedure bin by bin. In order to enhance the decoding computation of HEVC CABAC, the flag-type syntax elements are adaptively pipelined by precomputing consecutive flag-type ones; and multi-bin syntax elements are decoded by processing bins in parallel up to three. Further, in order to accelerate Binary Arithmetic Decoder by reducing the critical path delay, the update and renormalization of context modeling are precomputed parallel for the cases of LPS as well as MPS, and then the context modeling renewal is selected by the precedent decoding result. It is simulated that the new HEVC CABAC architecture could achieve the max. performance of 1.01 bins/cycle, which is two times faster with respect to the conventional approach. In ASIC design with 65nm library, the CABAC architecture would handle 224 Mbins/sec, which could decode QFHD HEVC video data in real time.

• Journal of Biomedical Engineering Research
• /
• v.18 no.4
• /
• pp.349-356
• /
• 1997

In this paper, we propose the lossless coding: scheme for progressive transmission of medical images. The input image is decomposed by the proposed fast adaptive subband decomposition method which is suited for a lossless coding. The decomposed images are coded by an arithmetic coder with two conditioning pixels, and the conditioning pixels are selected differently according to the property of the subbands. The conditioning contexts are usually quantized to reduce the conditional state, and the optimization method of quantization is proposed For the purpose of improving compression ratio in this paper. The proposed lossless coding scheme provides the asymmetric structure of cosec and results in better compression ability than the JPEC lossless coding[ 1 ].