• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권4호
• /
• pp.1128-1139
• /
• 2012

With the development of three-dimensional display and related technologies, depth video coding becomes a new topic and attracts great attention from industries and research institutes. Because (1) the depth video is not a sequence of images for final viewing by end users but an aid for rendering, and (2) depth video is simpler than the corresponding color video, fast algorithm for depth video is necessary and possible to reduce the computational burden of the encoder. This paper proposes a fast mode decision algorithm for depth video coding based on depth segmentation. Firstly, based on depth perception, the depth video is segmented into three regions: edge, foreground and background. Then, different mode candidates are searched to decide the encoding macroblock mode. Finally, encoding time, bit rate and video quality of virtual view of the proposed algorithm are tested. Experimental results show that the proposed algorithm save encoding time ranging from 82.49% to 93.21% with negligible quality degradation of rendered virtual view image and bit rate increment.

• 대한전자공학회논문지SP
• /
• 제46권2호
• /
• pp.48-56
• /
• 2009

우리는 H.264/AVC의 비디오 부호화에서 조기 인트라 모드 생략을 결정하기 위한 알고리즘을 제안한다. 새롭게 추가된 다양한 예측 방법들에 의한 매크로블록 부호화 방법은 압축의 효율의 증가를 가져오지만, 모든 부호화 가능한 모드에 대해 율-왜곡 함수를 계산하여 가장 효율이 좋은 모드를 선택하기 때문에 상당한 계산량을 요구한다. 이 논문에서는 인터 프레임에 대한 부호화 시간을 감소시키기 위해서, 적응적인 움직임 벡터 맵(AMVM)을 이용한 모드 결정 방법을 H.264/AVC 비디오 부호화기에서 제안한다. 제안한 알고리즘은 PSNR과 Bit rate 그리고 부호화 처리시간에 대해서 일반적으로 좋은 성능을 가진다.

• 한국통신학회논문지
• /
• 제28권1C호
• /
• pp.64-71
• /
• 2003

본 논문에서는 정지 영상의 압축 방식인 JPEG2000에서 영상의 질을 일정하게 유지하면서 부호화 시간을 단축시키는 알고리즘을 제안하였다. 전체 이미지의 주파수 분포를 추정하여 출력 비트스트림을 위한 최적의 자름점(Truncation Point)을 찾아 선택된 비트플레인만 부호화하는 방법이다. 다해상도의 특징을 갖는 웨이블렛은 각각의 해상도마다 수직, 수평 및 대각선 주파수 성분을 얻을 수 있다. 이 주파수 상관관계는 전체 레벨에서 유지되며 입력영상에 따라 고유한 주파수 특징을 나타낸다. 따라서, 최상위 레벨의 주파수 관계로 각각의 코드블럭에서 부호화할 비트를 예측하여 적절한 자름점을 선택할 수 있어 부호화 시간을 단축시켰다. 또한 명도 성분보다는 에너지가 작은 컬러 성분에서 부호화 되지 않는 하위 레벨은 단순한 다운 샘플링만으로 저주파 통과 필터를 대신함으로써 부호화 시간을 줄이는 성과를 보였다. 이러한 제안된 알고리즘으로 부호화 시간을 약 15~36% 줄였으며 PSNR을 30$\pm$0.5㏈로 유지하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 춘계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.59-61
• /
• 2008

Optimal design of the direct-driven PM Wind Generator, combined with DEAS(Dynamic Encoding Algorithm for Searches) and FEM(Finite Element Method), has been proposed to maximize the Annual Energy Production(AEP) over the whole wind speed characterized by the statistical model of wind speed distribution. In particular, DEAS has been contributed to reducing the excessive computing time for the optimization process.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2542-2547
• /
• 2005

In this paper, we propose a support vector machine (SVM) hyper and kernel parameter optimization method which is based on minimizing radius/margin bound which is a kind of estimation of leave-one-error. This method uses dynamic encoding algorithm for search (DEAS) and gradient information for better optimization performance. DEAS is a recently proposed optimization algorithm which is based on variable length binary encoding method. This method has less computation time than genetic algorithm (GA) based and grid search based methods and better performance on finding global optimal value than gradient based methods. It is very efficient in practical applications. Hand-written letter data of MNI steel are used to evaluate the performance.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.75-76
• /
• 2008

A low complexity encoding scheme for coarse grain scalability is proposed. The proposed method exploits the statistics of residuals between current and reference blocks using the macroblock mode predicted from the previous quality layer. To test how the mode is optimal in the current layer, the statistical hypothesis testing for the variances of the residual sub-blocks is performed. The proposed method reduces the total encoding time up to 51% when three CGS scalability layers are encoded. However, the quality degradation and bit-rate increment of the each layer are negligible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2464-2479
• /
• 2020

This paper presents a detailed subjective quality assessment for the ultra-high definition (UHD) videos having frame rates of 30fps and 60 fps. The subjective assessment is based on the ITU-R BT-500 recommendations, where double stimulus continuous quality scale (DSCQS-type II) test is performed for the evaluation of the perceived quality of the user's in terms of differential mean opinion score (DMOS). Encoding of the UHD videos by opting encoders i.e. H.264/AVC, H.265/HEVC, and VP9 at five different quantization parameter (QP) levels is done to investigate the perceived user's quality of experience (QoE) given as DMOS. Moreover, the encoding efficiency as the encoding time for each encoder and qualitative performance by employing full-reference (FR) quality metrics are presented in this work.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권6호
• /
• pp.388-392
• /
• 2014

This paper proposes an early termination method of a block vector search for fast encoding of high efficiency video coding (HEVC) screen content coding (SCC). In the proposed algorithm, two blocks indicated by two block vector predictors (BVPs) were first employed as an intra block copy (IBC) search. If the sum of absolute difference (SAD) value of the block is less than a threshold defined empirically, an IBC BV search is terminated early. The initial threshold for early termination is derived by statistical analysis and it can be modified adaptively based on a quantization parameter (QP). The proposed algorithm is evaluated on SCM-2.0 under all intra (AI) coding configurations. Experimental results show that the proposed algorithm reduces IBC BV search time by 29.23% on average while the average BD-rate loss is 0.41% under the HEVC SCC common test conditions (CTC).

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2006년도 하계학술대회
• /
• pp.255-258
• /
• 2006

In the H.264/AVC standard, intra prediction increases the coding efficiency of intra macroblocks and by applying rate-distortion optimization to each macroblock, it is possible to choose Inter or Intra encoding adaptively. This sort of encoding scheme, however, increases encoding complexity dramatically and causes troubles in practical applications of the real-time mobile environment. In order to decrease the complexity, variety of methods is proposed but most of those take only its current block into consideration for selecting candidate modes which naturally causes degradation in PSNR (Peak Signal to Noise Ratio). The proposed fast intra mode decision finds the candidate modes by analyzing transformed coefficients of neighboring blocks stored in the buffer at the encoder stage of input sequences. We verify this proposed scheme in complexity, PSNR and bit-rate.

• ETRI Journal
• /
• 제33권4호
• /
• pp.641-644
• /
• 2011

In this letter, we propose a novel bitrate control, using both Kalman and FIR filters, based on a Hamiltonian analysis with respect to the amount of bits from each macroblock, in an encoding of a general video codec such as H.264/AVC. Since the proposed bitrate control is based on the simple computation of an optimal control method based on the Hamiltonian analysis, it is not necessary to use additional computation, such as a DCT or quantization, to estimate the bits for bitrate control. As a result, the proposed algorithm can be applied to single-pass encoding and can provide sufficient encoding speed with respect to various applications, even those requiring real-time control.