• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3286-3300
• /
• 2016

High Efficiency Video Coding (HEVC) Standard, as the latest coding standard, introduces satisfying compression structures with respect to its predecessor Advanced Video Coding (H.264/AVC). The new coding standard can offer improved encoding performance compared with H.264/AVC. However, it also leads to enormous computational complexity that makes it considerably difficult to be implemented in real time application. In this paper, based on machine learning, a fast partitioning method is proposed, which can search for the best splitting structures for Intra-Prediction. In view of the video texture characteristics, we choose the entropy of Gray-Scale Difference Statistics (GDS) and the minimum of Sum of Absolute Transformed Difference (SATD) as two important features, which can make a balance between the computation complexity and classification performance. According to the selected features, adaptive decision trees can be built for the Coding Units (CU) with different size by offline training. Furthermore, by this way, the partition of CUs can be resolved as a binary classification problem. Experimental results have shown that the proposed algorithm can save over 34% encoding time on average, with a negligible Bjontegaard Delta (BD)-rate increase.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2003.11a
• /
• pp.141-146
• /
• 2003

시간이 흐름에 따라 연속적으로 위치를 변경하는 객체를 이동 객체(Moving Objects)라고 한다. 이러한 이동 객체의 대용량 위치 정보를 효율적으로 검색하기 위하여 색인이 필요하며, 대표적인 색인으로 TB-tree가 제안되었다. 그러나 전통적인 R-tree 기반의 TB-tree는 엄격한 궤적 보존 정책에 의해 레코드가 삽입될 때마다 해당 레코드의 선행자(predecessor)를 포함하는 단말 노드를 검색해야 하며, 레코드 삽입으로 인한 단말 노드 MBB의 변경을 중간 노드들의 MBB에도 반영해야 하는 갱신 부하를 가지고 있다. 본 논문에서는 대용량 이동 객체 궤적 정보의 효율적인 색인을 위한 최소 전파 TB-tree를 제안한다. 본 기법은 앞으로 삽입될 이동 객체의 궤적을 포함하는 예상된 MBB(EMBB: Expected Minimum Bounding Box)를 트리에 먼저 반영한 후 레코드가 삽입될 때마다 중간 노드의 MBB를 갱신하지 않고, 객체가 EMBB을 벗어났을 때 중간 노드의 MBB를 조정하여 TB-tree의 MBB조정 횟수를 줄이고, 또한 TB-tree에 별도의 테이블 구조를 둠으로써 레코드 삽입을 위한 단말 노드 검색 비용을 줄여 전체적인 TB-tree의 갱신 비용을 감소시킨다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1825-1839
• /
• 2015

The final draft of the latest video coding standard, High Efficiency Video Coding (HEVC), was approved in January 2013. The coding efficiency of HEVC surpasses its predecessor, H.264/MPEG-4 Advanced Video Coding (AVC), by using only half of the bitrate to encode the same sequence with similar quality. However, the complexity of HEVC is sharply increased compared to H.264/AVC. In this paper, a method is proposed to decrease the complexity of intra coding in HEVC. Early pruning and an early splitting strategy are applied to the quadtree structure of coding tree units (CTU) and residual quadtree (RQT). According to our experiment, when our method is applied to sequences from Class A to Class E, the coding time is decreased by 44% at the cost of a 1.08% Bjontegaard delta rate (BD-rate) increase on average.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.571-582
• /
• 2008

This paper analyzes global convergence of the univariate dynamic encoding algorithm for searches (uDEAS) and provides an application result to function optimization. uDEAS is a more advanced optimization method than its predecessor in terms of the number of neighborhood points. This improvement should be validated through mathematical analysis for further research and application. Since uDEAS can be categorized into the generating set search method also established recently, the global convergence property of uDEAS is proved in the context of the direct search method. To show the strong performance of uDEAS, the global minima of four 30 dimensional benchmark functions are attempted to be located by uDEAS and the other direct search methods. The proof of global convergence and the successful optimization result guarantee that uDEAS is a reliable and effective global optimization method.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.73-83
• /
• 2010

Combinatorial testing has been an active research area in recent years. One challenge in this area is dealing with the combinatorial explosion problem, which typically requires a very expensive computational process to find a good test set that covers all the combinations for a given interaction strength (t). Parallelization can be an effective approach to manage this computational cost, that is, by taking advantage of the recent advancement of multicore architectures. In line with such alluring prospects, this paper presents a new deterministic strategy, called multicore modified input parameter order (MC-MIPOG) based on an earlier strategy, input parameter order generalized (IPOG). Unlike its predecessor strategy, MC-MIPOG adopts a novel approach by removing control and data dependency to permit the harnessing of multicore systems. Experiments are undertaken to demonstrate speedup gain and to compare the proposed strategy with other strategies, including IPOG. The overall results demonstrate that MC-MIPOG outperforms most existing strategies (IPOG, IPOF, IPOF2, IPOG-D, ITCH, TConfig, Jenny, and TVG) in terms of test size within acceptable execution time. Unlike most strategies, MC-MIPOG is also capable of supporting high interaction strengths of t > 6.

• ETRI Journal
• /
• v.42 no.2
• /
• pp.258-271
• /
• 2020

A correlation exists between luminance samples and chrominance samples of a color image. It is beneficial to exploit such interchannel redundancy for color image compression. We propose an algorithm that predicts chrominance components Cb and Cr from the luminance component Y. The prediction model is trained by supervised learning with Laplacian-regularized least squares to minimize the total prediction error. Kernel principal component analysis mapping, which reduces computational complexity, is implemented on the same point set at both the encoder and decoder to ensure that predictions are identical at both the ends without signaling extra location information. In addition, chrominance subsampling and entropy coding for model parameters are adopted to further reduce the bit rate. Finally, luminance information and model parameters are stored for image reconstruction. Experimental results show the performance superiority of the proposed algorithm over its predecessor and JPEG, and even over JPEG-XR. The compensation version with the chrominance difference of the proposed algorithm performs close to and even better than JPEG2000 in some cases.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.135-138
• /
• 2014

상속결격이란 피상속인이 상속할 순위에 있지만 그 자가 피상속인 등의 생명침해 혹은 피상속인의 유언행위에 대해 고의로 위법한 침해를 한 경우에 상속인자격을 박탈하는 제도이다. 상속인에게 법정결격사유가 발생하면 그 상속인은 법률상 당연히 상속인 자격을 상실하게 된다. 이렇게 상속인자격을 상실한 자를 상속결격자라고 한다. 즉 윤리적 경제적 관계에 있는 피상속인과의 정당한 상속관계를 파괴하는 자에게 상속권을 인정하지 않는 일종의 제재를 가하여야 한다는 상식 속에 그 근거가 있다고 본다. 우리나라의 현행 민법 제 1004조에 상속인의 결격사유를 규정하고 있으나, 특히 유언장을 위조한 상속인은 제1004조 5호 규정에 의거 상속결격사유가 발생되는데, 상속결격은 일신전속권인 효과로 인하여 다른 상속인들에게 그 효과가 미치지 않기 때문에 결국 대습상속을 통하여 실질적으로 상속재산의 소유권행사를 할 수 있는 등 여러 가지 문제점을 안고 있어, 본 논문에서는 우리나라 상속결격제도의 문제점을 지적하고 그에 대한 개선방안을 제시하고자 한다.

• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.157-164
• /
• 2011

This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.

• Journal of Korean Classical Literature and Education
• /
• no.16
• /
• pp.207-235
• /
• 2008

This study investigated the formation of communication education which is based on the contemporary language education. Concretely I watched chronologically the proportion of culture element and behavior element, its change, and the contents of writing education. To achieve this, I took the ancient Greek language education as the main materials. The sophists are right if we think only the empirical world, because of the changeability of external world and the relativity of sense. On the other hand, Platon emphasized the ability of abstract thought which is inherent in the human inside. But today's education only emphasizes the 'expression' which came from the Platonic thought. So students fills their devastated inside with arbitrary idea in this history-forgotten social circumstance. It is very beneficial to make subject have some cultural studies and to enhance the sensation on the world through the writing of representation because these can be good to the growth of subject. It is our-not as educator but as a predecessor of human being-duty to set the catalogue of cultural studies of this age and to make students feel the fundamental harmony and the beauty of the world.

• Genomics & Informatics
• /
• v.18 no.3
• /
• pp.30.1-30.7
• /
• 2020

The novel coronavirus pandemic that has originated from China and spread throughout the world in three months. Genome of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) predecessor, severe acute respiratory syndrome coronavirus (SARS-CoV) and Middle East respiratory syndrome coronavirus (MERS-CoV) play an important role in understanding the concept of genetic variation. In this paper, the genomic data accessed from National Center for Biotechnology Information (NCBI) through Molecular Evolutionary Genetic Analysis (MEGA) for statistical analysis. Firstly, the Bayesian information criterion (BIC) and Akaike information criterion (AICc) are used to evaluate the best substitution pattern. Secondly, the maximum likelihood method used to estimate of transition/transversions (R) through Kimura-2, Tamura-3, Hasegawa-Kishino-Yano, and Tamura-Nei nucleotide substitutions model. Thirdly and finally nucleotide frequencies computed based on genomic data of NCBI. The results indicate that general times reversible model has the lowest BIC and AICc score 347,394 and 347,287, respectively. The transition/transversions bias for nucleotide substitutions models varies from 0.56 to 0.59 in MEGA output. The average nitrogenous bases frequency of U, C, A, and G are 31.74, 19.48, 28.04, and 20.74, respectively in percentages. Overall the genomic data analysis of SARS-CoV-2, SARS-CoV, and MERS-CoV highlights the close genetic relationship.