• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.117-122
• /
• 2000

The fractal image compression is based on the self-similarity that some area in an image is very similar to others. This compression method offers high compression ratio and fast decompression, but it has very long encoding time. To cut-off the encoding time, most researches give a restriction on domain blocks to be compared with a range block or make an effective search sequence of the domain blocks for a range block. However, most of them take much encoding time yet. In this research, we propose an algorithm that greatly reduces the encoding time by considering the coherence between range blocks. This algorithm first classifies all range blocks into some groups using the coherence between range blocks, and then searches corresponding domain blocks only for the key block of each group. If this scheme is joined in a prior work of the other fractal compression algorithm, it will give a great effectiveness to encoding time.

• ETRI Journal
• /
• v.31 no.6
• /
• pp.784-794
• /
• 2009

We present a full HD (1080p) H.264/AVC High Profile hardware encoder based on fast motion estimation (ME). Most processing cycles are occupied with ME and use external memory access to fetch samples, which degrades the performance of the encoder. A novel approach to fast ME which uses shared multibank memory can solve these problems. The proposed pixel subsampling ME algorithm is suitable for fast motion vector searches for high-quality resolution images. The proposed algorithm achieves an 87.5% reduction of computational complexity compared with the full search algorithm in the JM reference software, while sustaining the video quality without any conspicuous PSNR loss. The usage amount of shared multibank memory between the coarse ME and fine ME blocks is 93.6%, which saves external memory access cycles and speeds up ME. It is feasible to perform the algorithm at a 270 MHz clock speed for 30 frame/s real-time full HD encoding. Its total gate count is 872k, and internal SRAM size is 41.8 kB.

• ETRI Journal
• /
• v.35 no.2
• /
• pp.270-280
• /
• 2013

A fast intra-prediction method is proposed for High Efficiency Video Coding (HEVC) using a fast intra-mode decision and fast coding unit (CU) size decision. HEVC supports very sophisticated intra modes and a recursive quadtree-based CU structure. To provide a high coding efficiency, the mode and CU size are selected in a rate-distortion optimized manner. This causes a high computational complexity in the encoder, and, for practical applications, the complexity should be significantly reduced. In this paper, among the many predefined modes, the intra-prediction mode is chosen without rate-distortion optimization processes, instead using the difference between the minimum and second minimum of the rate-distortion cost estimation based on the Hadamard transform. The experiment results show that the proposed method achieves a 49.04% reduction in the intra-prediction time and a 32.74% reduction in the total encoding time with a nearly similar coding performance to that of HEVC test model 2.1.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.627-630
• /
• 2014

The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

• Journal of Broadcast Engineering
• /
• v.23 no.1
• /
• pp.115-125
• /
• 2018

This paper presents a fast partition decision framework for High Efficiency Video Coding (HEVC) Screen Content Coding (SCC) based on machine learning. Currently, the HEVC performs quad-tree block partitioning process to achieve optimal coding efficiency. Since this process requires a high computational complexity of the encoding device, the fast encoding process has been studied as determining the block structure early. However, in the case of the screen content video coding, it is difficult to apply the conventional early partition decision method because it shows different partition characteristics from natural content. The proposed method solves the problem by classifying the screen content blocks after partition decision, and it shows an increase of 3.11% BD-BR and 42% time reduction compared to the SCC common test condition.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.862-870
• /
• 2015

The RDO (Rate Distortion Optimization) process of HEVC results in good coding efficiency, but relatively requires much encoding time. In order to reduce the encoding time of RDO process, this paper proposes a method of fast intra prediction mode decision using DCT coefficients distributions and the existence of DCT coefficients. The proposed fast Intra coding sets the number of intra prediction mode candidates to three(3) from the RMD (Rough Mode Decision) process in HM16.0 reference SW and reduces the number of candidates one more time by investigating DCT coefficients distribution. After that, if there exists a quantized DCT block having all zero coefficient values for a specific candidate before the RDO process, the candidate is chosen without the RDO process. The proposed method reduces the encoder complexity on average 46%, while the coding efficiency is 2.1% decreased compared with the HEVC encoder.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.45-48
• /
• 2008

This paper presents a brief overview of scalable video coding (SVC) with a focus on spatial scalability and its application to Advanced Terrestrial-DMB (AT-DMB). By adopting SVC with two spatial-layers and hierarchical modulation, AT-DMB provides standard definition (SD)-level video while maintaining compatability with the existing CIF-level video. In this paper, we suggest a layer-configuration and coding parameters of SVC which are well suit for an AT-DMB system. In order to reduce extremely large encoding time resulted by an exhaustive search of a macroblock coding mode in spatial scalability, we propose a fast mode decision method which excludes redundant modes in each layer. It utilizes the mode distribution of each layer and their correlations. Experimental results show that a simplified encoding model with the method reduces the computational complexity significantly with negligible coding loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.43-50
• /
• 2012

The use of an error-correcting code is essential in digital communication systems where the channel is noisy. Unless a receiver has accurate channel coding parameters, it becomes difficult to decode the digitized encoding bits correctly. In this paper, estimation algorithm for RM(Reed-Muller) codes using FHT (Fast Hadamard algorithm) is proposed. The proposed algorithm estimates the channel coding parameters of RM codes and then decodes the codes using the characteristic of FHT. And we also verify the algorithm by performing intensive computer simulation in additive white gaussian noise (AWGN) channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1144-1152
• /
• 2005

Intra prediction coding is one of the many coding-efficiency oriented tools of H.264/AVC, but it requires high computational complexity. Many fast intra coding algorithms have been proposed to reduce the computational complexity of intra prediction. While most of them have been focused on the mode decision methods themselves, we propose a fast algorithm in which new intra modes are substituted for the conventional intra modes so that the number of intra modes can be reduced. The simulation results show that the proposed method could reduce the encoding time of the overall sequence by $49\%$ without any noticeable degradation of the coding efficiency.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.231-238
• /
• 2009

DNA sequences are the fundamental information for each species and a comparison between DNA sequences of different species is an important task. Since DNA sequences are very long and there exist many species, not only fast matching but also efficient storage is an important factor for DNA sequences. Thus, a fast string matching method suitable for encoded DNA sequences is needed. In this paper, we present a fast string matching method for encoded DNA sequences which does not decode DNA sequences while matching. We use four-characters-to-one-byte encoding and combine a suffix approach and a multi-pattern matching approach. Experimental results show that our method is about 5 times faster than AGREP and the fastest among known algorithms.