• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.87-97
• /
• 2004

In this paper, we propose an algorithm for interlaced-to-progressive conversion by the weighted summation of the information collected from spatial do-interlacing method, in which the weighted edge based line average is applied, and the temporal method in which the motion compensation is employed by using hi-directional BMA (block matching algorithm). We employed time-recursive and motion adaptive processing as motion detection is involved. Also, a median filter is used to deal with limitation of the linear summation in which only an intermediate of values being involved is determined. The main goal of the approach is to overcome the shortcomings of each of the do-interlacing techniques without significant increment of the computational complexity, and the proposed method is apt to implement in hardware for real-time processing.

• School Mathematics
• /
• v.18 no.4
• /
• pp.793-818
• /
• 2016

The purpose of this study is to explore in detail $5^{th}$ grade students' understanding on the big ideas related to addition of fraction with different denominators: fixed whole unit, necessity of common measure, and recursive partitioning connected to algorithms. We conducted teaching experiments on 15 fifth grade students who had learned about addition of fractions with different denominators using the current textbook. Most students approached to the big ideas related to addition of fractions in a procedural way. However, some students were able to conceptually understand the interpretations and algorithms of fraction addition by quantitatively thinking about the context and focusing on the structures of units. Building on these results, this study is expected to suggest specific implications on instruction methods for addition of fractions with different denominators.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.11-25
• /
• 2012

We present the method to infer Context-Free Grammars by applying genetic algorithm to the Binary Third-order Recurrent Neural Networks(BTRNN). BTRNN is a multiple-layered architecture of recurrent neural networks, each of which is corresponding to an input symbol, and is combined with external stack. All parameters of BTRNN are represented as binary numbers and each state transition is performed with any stack operation simultaneously. We apply Genetic Algorithm to BTRNN chromosomes and obtain the optimal BTRNN inferring context-free grammar of positive and negative input patterns. This proposed method infers BTRNN, which includes the number of its states equal to or less than those of existing methods of Discrete Recurrent Neural Networks, with less examples and less learning trials. Also BTRNN is superior to the recent method of chromosomes representing grammars at recognition time complexity because of performing deterministic state transitions and stack operations at parsing process. If the number of non-terminals is p, the number of terminals q, the length of an input string k, and the max number of BTRNN states m, the parallel processing time is O(k) and the sequential processing time is O(km).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.47-53
• /
• 2007

True motion estimation is necessary for deinterlacing, frame-rate conversion, and film judder compensation. There have been several block-based approaches to find true motion vectors by tracing minimum sum-of-absolute-difference (SAD) values by considering spatial and temporal consistency. However, the algorithms cannot find robust motion vectors when the texture of objects is changed. To find the robust motion vectors in the region, a recursive vector selection scheme and an adaptive weighting parameter are proposed. Previous frame vectors are recursively averaged to be utilized for motion error region. The weighting parameter controls fidelity to input vectors and the recursively averaged ones, where the input vectors come from the conventional estimators. If the input vectors are not reliable, then the mean vectors of the previous frame are used for temporal consistency. Experimental results show more robust motion vectors than those of the conventional methods in time-varying texture objects.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.9
• /
• pp.493-502
• /
• 2002

The connectivity and edge-connectivity have been the prime deterministic measure of fault tolerance in multicomputer networks. These parameters have a problem that they do not differentiate the different types of disconnected graphs which result from removing the disconnecting vertices or disconnecting edges. To compensate for this shortcoming, one can utilize generalized measures of connectedness such as superconnectivity, toughness, scattering number, vertex-integrity, binding number, and restricted connectivity. In this paper, we analyze such deterministic measures of fault tolerance in recursive circulants and hypercubes, and compare them in terms of fault tolerance.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.3
• /
• pp.67-73
• /
• 2006

In this paper, a reconfigurable model following flight control method is proposed based on direct adaptive scheme using parameter estimation. Adaptive control scheme updates the control gains to make the system output follow the reference output even when fault occurs. By adopting the frequency domain parameter estimation method, system changes by the fault can be estimated. Recursive Fourier transformation is used for system identification. Using recursive Fourier transform, the proposed adaptive control algorithm guarantees the system stability and improves the system characteristics. To evaluate the performance of proposed control method, numerical simulations are performed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.624-626
• /
• 2016

본 논문에서는 생물학적 네트워크 구성을 개선하기 위해서 노이즈의 영향으로 상관관계가 명확하게 나타나지 않았던 기존의 방법을 보완할 수 있는 새로운 방법을 제안한다. 제안된 방법은 재귀적응분할 방법으로 상관행렬에서 노이즈의 영향을 줄여 표본간의 상관관계를 명확히 보여 줄 수 있다. 시뮬레이션 결과 네트워크 구성의 오류를 15% 줄여 기존의 방법보다 향상된 결과가 나타났다. 또한, 유전자 발현 데이터를 이용한 실례 연구에서는 원 데이터에 잘 나타나지 않았던 조건별 네트워크 구성이 제안된 방법으로는 잘 분리되어 있는 것을 확인 할 수 있었다. 본 논문에서 제안된 방법은 유전자 발현 데이터 분석 등의 생물학적 네트워크 구성에 활용될 수 있을 것으로 기대한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.8
• /
• pp.399-405
• /
• 2001

이 논문은 재귀원형군 G(2$^{m}$ , 2$^{k}$ )의 강한 해밀톤 성질을 그래프 이론적 관점에서 고찰한다. 재귀원형군은 [9]에서 제안된 다중 컴퓨터의 연결망 구조이다. G(2$^{m}$ , 2$^{k}$ )가 임의의 정점 쌍 ν, $\omega$를 잇는 길이 ι인 경로를 가지는가 하는 문제를 고려하여, (a) G(2$^{m}$ , 2$^{k}$ )는 ι$\geq$d(ν, $\omega$)을 만족하는 모든 ι에 대해서 길이 ι인 경로를 가지며, (b) G(2$^{m}$ , 4)는 ι$\geq$d(ν, $\omega$)+2인 모든 길이의 경로를 가지며, (c)G(2$^{m}$ , 2$^{k}$ ), k$\geq$3은 길이 d(ν, $\omega$)+2$^{k}$ -3인 경로를 가지지 않는 정점 쌍이 있음을 보인다. 여기서, d(ν, $\omega$)는 ν와 $\omega$ 사이의 거리이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.367-369
• /
• 2001

GSPA(Generic Shortest Path Algorithm)은 각종 정보통신 네트워크 상에서 멀티미디어 정보전송시 요구되는 QoS 기반의 라우팅을 위한 새로운 라우팅 알고리즘이다. 전체적인 동작은 원시노드(Source Node)에서 목적노드(Destination Node) 사이에서 이전 단계의 재귀호출에서 찾은 최단 경로를 기준으로 해서 이웃 노드들을 대상으로 재귀호출을 통해서 QoS 요구조건을 만족하는 경로정보를 기록하면서 최단 경로를 찾는 알고리즘이다. GSPA는 기존 Distance Vector 알고리즘이 경로를 설정하기 위해 많은 시간과 대역폭을 낭비하며 네트워크 형상이 수시로 변경될 때 “Counting to Infinity”현상을 발생시키는 단점을 보완하고, Link-State 데이터 베이스를 이용해서 함수 재귀호츨을 통해서 최단 경로를 찾아냄으로써 구현하기가 쉬운 알고리즘이다. 또, Distance-Vector와 Link-State 알고리즘의 장점을 수용하였으며, 이 알고리즘을 분산 네트워크 환경에서 동작하도록 수정하면 분산 네트워크 환경에서의 Hierarchical Routing, Multi-Path Routing, QoS Routing을 위한 기본 알고리즘으로 매우 좋은 특성들을 가지고 있다. 본 논문에서는 이 알고리즘을 소개하고 간단한 예를 통해 기본 동작에 대해 살펴본다.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.5 s.170
• /
• pp.45-54
• /
• 2005

The purpose of this research is to find a simple and accurate NURBS interpolator for CNC systems such as robot, CMM and CNC machine tools. This paper presents a new design of NURBS interpolator for CNC system. The proposed algorithm used the recursive characteristics of NURBS equation, the previous incremental value and chord length for the sake of a constant chord length. Simulation study was conducted to see the performance of the proposed interpolator with reference-word and reference-pulse method. Consequently, an accurate and simple NURBS interpolator was possible for modem CNC systems.