• Journal of Broadcast Engineering
• /
• v.23 no.5
• /
• pp.628-635
• /
• 2018

In this paper, we propose a fast motion estimation algorithm which is important in video encoding. So many fast motion estimation algorithms have been published for improving prediction quality and computational reduction. In the paper, we propose an algorithm that reduces unnecessary computation, while almost keeping prediction quality compared with the full search algorithm. The proposed algorithm calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, and finds optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain fast computational speed by reducing unnecessary computations. Additionally, the proposed algorithm can be used with conventional fast motion estimation algorithms and prove it in the experimental results.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.17 no.4
• /
• pp.323-329
• /
• 2011

This study is to determine an optimal yacht mooring location candidate among many alternative candidates in order to obtain the maximized efficiency under the natural conditions using integer programming. To deal with marina's construction location, the optimal construction location is selected using 21 important factors analysis for 4 candidates in the Mokpo city. The development period and the initial investment cost weight are one and half times more than the others among 21 factors. The optimal spiral analysis of weighted linear model shows that the Peace Square sea area is selected as the most optimal place among 4 candidates. This proposed model has not been applied in the optimal marina's facility candidate selection problem yet. This paper will contribute to determine the most reasonable alternative. Also, this proposal model can be applied to other marina's facility candidate selection problem in other regions.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.612-628
• /
• 2001

This paper presents a methodology to extract classes and inheritance relations from procedural software. The methodology is based on the idea of generating all groups of class candidates, based on the combinatorial groups of object candidates, and their inheritance with all possible combinations and selecting a group of object candidates, and their inheritance with all possible combinations and selecting a group with the best or optimal combination of candidates with respect to the degree of relativity and similarity between class candidates in the group and classes in a domain model. The methodology has innovative features in class candidates in the group and classes in a domain model. The methodology has innovative features in class and inheritance extraction: a clustering method based on both static (attribute) and dynamic (method) clustering, the combinatorial cases of grouping class candidate cases based on abstraction, a signature similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement for inheritance relations among n class candidates or m classes, two-dimensional similarity measurement, that is, the horizontal measurement for overall group similarity between n class candidates and m classes, and the vertical measurement for specific similarity between a set of classes in a group of class candidates and a set of classes with the same class hierarchy in a domain model, etc. This methodology provides reengineering experts with a comprehensive and integrated environment to select the best or optimal group of class candidates.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.227-230
• /
• 1997

In this paper, robot navigation experiments with a new navigation algorithm are carried out in real environments. The authors already proposed a reactive navigation algorithm for mobile robots using optimal via-point selection method. At each sampling time, a number of via-point candidates is constructed with various candidates of heading angles and velocities. The robot detects surrounding obstacles, and the proposed algorithm utilizes fuzzy multi-attribute decision making in selecting the optimal via-point the robot would proceed at next step. Fuzzy decision making allows the robot to choose the most qualified via-point even when the two navigation goals-obstacle avoidance and target point reaching-conflict each other. The experimental result shows the successful navigation can be achieved with the proposed navigation algorithm for real environments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1868-1871
• /
• 2007

This paper proposes a novel scheme to significantly reduce mode decision time by predicting optimal mode candidates. Unlike previous fast mode decision algorithms computing RDcost in a pre-defined mode order, the proposed scheme predicts optimal mode candidates and calculates their RDcosts first, increasing the possibility to satisfy early-exit conditions sooner, resulting in fast mode decision. This H.264 mode decision time reduction enables small computing power mobile devices to handle H.264 encoding effectively. Extensive simulations show that, when compared with JM10.2, AMD and LCIMS, the proposed scheme boosts H.264 encoding speed by up to 575% with a reasonable image quality degradation.

• Journal of Navigation and Port Research
• /
• v.34 no.1
• /
• pp.59-64
• /
• 2010

This study is to determine an optimal marina's construction location candidate among many alternative candidates in order to obtain the maximized efficiency under the natural conditions. To deal with marina's construction location, the optimal construction location is selected using 10 important factor analysis for 10 candidates in Yeosu city. In this paper, the new model to assign the most reasonable alternative is introduced using 0-1 integer programming. This proposed model has not been applied in the optimal marina's facility candidate selection problem yet. This paper will contribute to determine the most reasonable alternative. Also, this proposal model can be applied to other marina's facility candidate selection problem in other regions.

• Fashion & Textile Research Journal
• /
• v.20 no.4
• /
• pp.464-473
• /
• 2018

The objective of this study is to develop a sizing system of fitness clothing that can properly accommodate various body sizes of Korean senior women. The sizing system of upper and lower fitness clothing was developed in the present study by selection of key variables, identification of size category candidates, and determination of an optimal sizing system. First, key anthropometric dimensions (stature and bust circumference for upper clothing and stature; waist circumference for lower clothing) were identified by factor analysis on the direct body measurements (n = 272) and 3D whole-body scan data (n = 271) of Korean senior women in Size Korea. Second, sizing system candidates based on the key dimensions of upper and lower clothing were explored using a grid method and an optimization method. Lastly, among the sizing system candidates, optimal sizing systems of upper and lower clothing were selected in terms of accommodation rate. Five size categories (short/small, short/medium, tall/small, tall/medium, and tall/large) were selected as the optimal sizing systems of upper and lower clothing with 89% and 78% of accommodation rate, respectively, for the Korean senior women. The anthropometric characteristics of the representative humans of the optimal size categories would be of use in the design of fitness compressive wear for the better fit and effectiveness of exercise and health of Korean senior women.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.27 no.6
• /
• pp.407-416
• /
• 2014

Five factors are identified, which affect the performance of optical filter: 1) type of optical glass, 2) existence of Fe, 3) photo pic coating type, 4) coating form, and 5) coating thickness. If we consider all the levels of five factors, there are 360 possible candidates. We determined five evaluation criteria, which can be used to evaluate possible candidates. For the performance measures we selected white-state avearge voltage, black-state average voltage, and black-state error rate. And we added economic criterion and quality and maintenance criterion. Through the two-step statistical analysis of white-state avearge voltage, black-state average voltage, and black-state error rates, we selected final four candidates. Based on the five criteria we finally determined optimal optical filter using AHP.

• The Korean Journal of Applied Statistics
• /
• v.6 no.2
• /
• pp.303-309
• /
• 1993

In this paper we have defined two approaches to be error-robust when the precise form of error-structure is unknown. An experiment is optimal by the first criterion if it maximizes the minimum effciency over all candidates of error structure and is optimal by the second if it maximizes the minimum average of the efficiency over all candidates of error structure. In order to appreciate the basic implications of each design criterion, these approaches are applied to two different experimental situations, D- and heteroscedastic G-optimalities.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.199-205
• /
• 2018

So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.