• 한국컴퓨터정보학회논문지
• /
• 제5권3호
• /
• pp.64-69
• /
• 2000

본 논문은 고속 및 고압축을 위한 프랙탈 영상 부호화 기법에 대해서 제안한다. 먼저, 원영상의 크기를 스케일링 방식 및 비트플레인 이용하여 1/2 및 1/4로 축소한다. 이어서, 부호화 시간의 단축을 위해 제한된 영역내에서 원영상의 1/4 크기의 도메인 블록과 가장 유사한 블록을 원영상의 1/2 크기를 가지는 레인지 영역에서 찾는다. 실험 결과, 제안된 알고리즘은 재퀸의 방식에 비해 화질은 다소 저하되었으나, 부호화 시간과 압축율은 많이 향상되었다.

• 전자공학회논문지
• /
• 제50권6호
• /
• pp.260-264
• /
• 2013

This paper proposes a fast enhancement layer coding method to reduce computational complexity for Scalable HEVC (SHVC) which is based on High Efficiency Video Coding (HEVC). The proposed method decreases encoding time by simplifying Rate Distortion Optimization (RDO)for enhancement layers (EL). The simplification is achieved by restricting CU depths based on the correlation of coding unit (CU) depths between adjacent layers and scalability (spatial or quality) of EL. Comparing with the performance of SHM 1.0 software encoder, the proposed method reduces the encoding time by up to 31.5%.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1195-1211
• /
• 2016

The emerging video coding standard High Efficiency Video Coding (HEVC) has shown almost 40% bit-rate reduction over the state-of-the-art Advanced Video Coding (AVC) standard but at about 40% computational complexity overhead. The main reason for HEVC computational complexity is the inter prediction that accounts for 60%-70% of the whole encoding time. In this paper, we propose several fast coding unit (CU) encoding schemes based on the Merge mode and motion estimation information to reduce the computational complexity caused by the HEVC inter prediction. Firstly, an early Merge mode decision method based on motion estimation (EMD) is proposed for each CU size. Then, a Merge mode based early termination method (MET) is developed to determine the CU size at an early stage. To provide a better balance between computational complexity and coding efficiency, several fast CU encoding schemes are surveyed according to the rate-distortion-complexity characteristics of EMD and MET methods as a function of CU sizes. These fast CU encoding schemes can be seamlessly incorporated in the existing control structures of the HEVC encoder without limiting its potential parallelization and hardware acceleration. Experimental results demonstrate that the proposed schemes achieve 19%-46% computational complexity reduction over the HEVC test model reference software, HM 16.4, at a cost of 0.2%-2.4% bit-rate increases under the random access coding configuration. The respective values under the low-delay B coding configuration are 17%-43% and 0.1%-1.2%.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
• /
• pp.343-344
• /
• 2012

With the increase of sensitive data and their secure transmission and storage, the use of encryption techniques has become widespread. The performance of encoding majorly depends on the computational time, so a system with less computational time suits more appropriate as compared to its contrary part. Double Random Phase Encoding (DRPE) is an algorithm with many sub functions which consumes more time when executed serially; the computation time can be significantly reduced by implementing important functions in a parallel fashion on Graphics Processing Unit (GPU). Computing convolution using Fast Fourier transform in DRPE is the most important part of the algorithm and it is shown in the paper that by performing this portion in GPU reduced the execution time of the process by substantial amount and can be compared with MATALB for performance analysis. NVIDIA graphic card GeForce 310 is used with CUDA C as a programming language.

• ETRI Journal
• /
• 제38권5호
• /
• pp.807-817
• /
• 2016

A novel fast algorithm is suggested for a coding unit (CU) mode decision using pseudo rate-distortion based on a separated encoding structure in High Efficiency Video Coding (HEVC). A conventional HEVC encoder requires a large computational time for a CU mode prediction because prediction and transformation procedures are applied to obtain a rate-distortion cost. Hence, for the practical application of HEVC encoding, it is necessary to significantly reduce the computational time of CU mode prediction. As described in this paper, under the proposed separated encoder structure, it is possible to decide the CU prediction mode without a full processing of the prediction and transformation to obtain a rate-distortion cost based on a suitable condition. Furthermore, to construct a suitable condition to improve the encoding speed, we employ a pseudo rate-distortion estimation based on a Hadamard transformation and a simple quantization. The experimental results show that the proposed method achieves a 38.68% reduction in the total encoding time with a similar coding performance to that of the HEVC reference model.

• 한국정보통신학회논문지
• /
• 제11권1호
• /
• pp.131-138
• /
• 2007

기존의 웹 서비스(Web Services)는 운영환경에 독립적인 문서 형식을 정의할 수 있는 XML(Extensible Markup Language)을 기본 문서 형식으로 사용함으로서 서비스의 통합을 실현하였다. 그러나 텍스트 데이터로 이루어져 있는 XML 문서는 네트워크 환경이나 임베디드 시스템과 같이 상대적으로 느린 통신 매체에 자주 접속하거나 모바일과 같이 자원이 한정된 소형기기에서 사용 할 경우 전체 응용 프로그램의 성능을 저하시키는 요소로 작용한다. 이에 본 논문은 Fast Infoset 방식과 ASN.1의 PER 인코딩 기법을 사용하여 XML 문서를 Fast XML으로 변환 할 수 있는 Fast Infoset 알고리즘을 구현하였고, 테스트 베드(Test Bed)를 구축하였다. 또한, 웹 서비스 구축 시 전송 프로토콜로 사용되는 XML 기반의 SOAP 메시지를 인코딩하여 기존의 순수 XML 메시지 방식과의 처리 성능 차이를 비교 분석하였다.

• 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.

• 방송공학회논문지
• /
• 제19권3호
• /
• pp.405-414
• /
• 2014

HEVC는 재귀적 쿼드 트리 구조를 갖는 CU를 부호화에 적용함으로써 높은 부호화 효율을 얻었다. 그러나 이러한 재귀적 쿼드 트리 구조는 HEVC의 부호화 복잡도를 매우 증가시키는 결과를 가져왔다. 본 논문에서는 이러한 재귀적 쿼드 트리 구조 안에서 빠른 CU 결정이 가능한 알고리즘을 제안한다. 제안하는 알고리즘은 CTU 부호화가 이루어지기 전에 미리 초기 CU 크기를 예측하고, CU 부호화 과정에서 CBF와 PU 모드 예측 비용을 이용한 조건을 확인하여 고속 CU 결정이 이루어지도록 한다. 또한 인터 PU 모드 예측과정에서 얻은 CBF값들을 이용하여 인트라 모드 예측 생략이 가능하다. 실험결과, 제안한 알고리즘의 조건에 포함된 가중치값에 따라 최대 평균 49.91%, 37.97%의 부호화 시간 감소 효과를 얻을 수 있었다.