• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.144-149
• /
• 1998

This paper presents a fast motion estimation algorithm, 5DS, useful for video coding. We first try block matching to 4 directions(N, E, W, S) to estimate motions in this algorith, since most of motions in video are oriented to those direction, and then try one additional diagonal matching between the matching ponts having small MADs. It makesthis algorithm possible for searching through a diagonal direction which is not adequate to logarithmic (LOG) search algorithm. This proposed algorithm has almost same PSNR but, 1.9, 1.2 times faster than classical block matching methods such as three steps search(TSS) and LOG search algorithms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.9
• /
• pp.76-84
• /
• 1994

This paper presents a new high-performance VLSI architecture and VLSI implementation for full-search block matching algorithm. The proposed VLSI architecture has the feature of two directional parallel and pipeline processing, thereby reducing the PE idle time at which the direction of block matching operation within the search area is changed. Therfore, the proposed architecture is faster than the existing architectures under the same clock frequency. Based on HSPICE circuit simulation, it is verified that the implemented procesing element is operated successfully within 13 ns for 75 MHz operation.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.295-298
• /
• 2002

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1417-1423
• /
• 1995

In this paper, we propose a full-search block-matching algorithm with early retirement, which can be applied to a 1-D systolic array of processing elements (PE's) for fast motion estimation. In the proposed algorithm, a PE is retired when its current accumulated sum is equal to or larger than the current minimum MAD. If all PE's are retired, the MAD calculation is stopped for the current array position and is started for the next one in the search window. Simulation results show that the optimum motion vector is always found with less computation, the total computation cycles for motion estimation are decreased to about 60%, and the power dissipation in the PE's is reduced to about 40-60%.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.3
• /
• pp.90-96
• /
• 2011

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

• The Journal of the Korea Contents Association
• /
• v.15 no.7
• /
• pp.655-663
• /
• 2015

The purpose of this study is to inquiry 'instructive fairy tale story making' teaching model developed in Russia to cultivate creativity and character and to present implementation idea in Korea. Fairy tale story is one of first tasks to spread his and her creativity and latent ability, and good genre to identify and express his and her feeling and to accomplish through these experience for children. In process of this teaching model, they are able to recognize and compare good literary works, to know 'instructive fairy tale story making' algorithm and to do 'instructive fairy tale story making' personally. As a result, students' imagination, creativity and linguistic performance would be developed more through 'instructive fairy tale story making', at the same time they will examine closely and apply moral and ethical contents in daily life and internalize.

• Composites Research
• /
• v.12 no.4
• /
• pp.42-54
• /
• 1999

FMLC(Fiber-Metal Laminate Composites) is a new structural material combining thin metal laminate with adhesive fiber prepreg, it nearly include all the advantage of metallic materials, for example: good plasticity, impact resistance, processibility, light weight and excellent fatigue properties. This research studied the optimum design of the FMLC subject to various loading conditions using genetic algorithm. The finite element method based on the shear deformation theory was used for the analysis of FMLC. Tasi-Hill failure criterion and Miser yield criterion were taken as fitness functions of the fiber prepreg and the metal laminate, respectively. The design variables were fiber orientation angles. In genetic algorithm, the tournament selection and the uniform crossover method were used. The elitist model was also used to be effective evolution strategy and the creeping random search method was adopted in order to approach a solution with high accuracy. Optimization results were given for various loading conditions and compared with CFRP(Carbon Fiber Reinforced Plastic). The results show that the FMLC is more excellent than the CFRP in point and uniform loading conditions and it is more stable to unexpected loading because the deviation of failure index is smaller than that of CFRP.

• The Journal of the Acoustical Society of Korea
• /
• v.11 no.3
• /
• pp.53-60
• /
• 1992

Many adaptive beamforming methods have been studied for interference cancellation and speech signal enhancement in telephone conference and auditorium. Main aspect of adaptive beamforming methods for speech signal processing is different from radar, sonar and seismic signal processing because desire output signal should be apt to the human ear. Considering that phase of speech is quite insensible to the human ear, Sondhi proposed a nonlinear constrained optimization technique whose constraint was on the magnitude transfer function from the source to the output. In real environment the phase response of the speech signal affects the human auditorium system. So it is desirable to design linear phase system. In this paper, linear phase beamformer is proposed and sample processing algorithm is also proposed for real time consideration Simulation results show that the proposed algorithm yields more consistent beam patterns and deep nulls to the noise direction than Sondhi's.

• Journal of Navigation and Port Research
• /
• v.39 no.4
• /
• pp.307-312
• /
• 2015

ARPA(Automatic Radar Plotting Aid) is a device to calculate CPA(closest point of approach)/TCPA(time of CPA), true course and speed of targets by vector operation of relative courses and speeds. The purpose of this study is to develop target acquisition and tracking technology for ARPA Radar implementation. After examining the previous studies, applicable algorithms and technologies were developed to be combined and basic ARPA functions were developed as a result. As for main research contents, the sequential image processing technology such as combination of grayscale conversion, gaussian smoothing, binary image conversion and labeling was deviced to achieve a proper target acquisition, and the NNS(Nearest Neighbor Search) algorithm was appllied to identify which target came from the previous image and finally Kalman Filter was used to calculate true course and speed of targets as an analysis of target behavior. Also all technologies stated above were implemented as a SW program and installed onboard, and verified the basic ARPA functions to be operable in practical use through onboard test.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.1-8
• /
• 2009

In this paper, we deal an implementation of the software that produces sub-optimal solution of cutting-ironbar planning problem using dynamic programming. Generally, it is required to design an optimization algorithm to accept the practical requirements of cutting ironbar manufacturing. But, this problem is a multiple-sized 1-dimensional cutting stock problem and Linear Programming approaches to get the optimal solution is difficult to be applied due to the problem of explosive computation and memory limitation. In order to overcome this problem, we reform the problem for applying Dynamic Programming and propose a cutting-ironbar planning algorithm searching the sub-optimal solution in the space of fixed amount of combinated columns by using heuristics. Then, we design a graphic user interfaces and screen displays to be operated conveniently in the industry workplace and implement the software using open-source GUI library toolkit, GTK+.