• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.903-906
• /
• 1998

We propose a new method for merging partical regions which have similar motion characteristics. In the proposed method, the trajectories of each partial regions are computed and the regions consisting a same object are merged by a similarity function defined in this paper. The similarity function is defined to take into consideration the motion characteristics of the trajectories. The proposed method shows good performance when the regions of an object show little variation in size and shape.

• Journal of Biomedical Engineering Research
• /
• v.14 no.1
• /
• pp.1-8
• /
• 1993

In this study, the extractions of formants and articulatory motion trajectories for Korean complex vowels are performed by using the RLSL adaptive linear prediction filter. This enables us to extract accurate spectrum in transition of speech signal. This study shows that the RLSL algorithm is superior to the Levinson algorithm, specially in transition part of speech.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.8
• /
• pp.899-905
• /
• 1988

In this paper, we suggest a new quasi-sliding mode condition with a wighting factor which guarantees all the states to reach switching planes and improves the convergence of the state trajectories. The result of computer simulation shows that by the suitable selection of a weighting factor, all the state trajectories reach switching planes and enter the sliding mode having the property of the insensitivity to parameter variation and disturbances.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.92-97
• /
• 1988

The path planning is done at the joint level. Cubic spline functions are used for constructing joint trajectories for industrial robots. For N-joint robot, Cartesian knots are transformed into N sets of joint displacements, with one set for each joint. For industrial application the speed of operation affects the productivity. An algorithm is developed to schedule the time intervals between each pair of adjacent knots such that the total traveling time is minimized subject to the physical constraints on joint velocties acceleration and jerks.

• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.553-567
• /
• 1997

This paper is concerned with the control problem $$ \dot{x}(t) = F(x) + u(t)G(x), t \in [0,T], x(0) = 0, $$ where F and G are smooth vector fields on $R^n$, and the admissible controls u satisfy the constraint $$\mid$u(t)$\mid$ \leq 1$. We provide the sufficient condition that the bang-bang trajectories having different switching orders intersect.

• CDE review
• /
• v.22 no.2
• /
• pp.6-10
• /
• 2016

This paper presents the kinematics of a walking robot leg based on Jansen mechanism. By using simple mathematics, all trajectories of walking robot leg links can be calculated. A foot point trajectory is used to evaluate the performance of a walking robot leg. Trial and Error method is used to find a best combination of link lengths under certain restrictions. All simulations are performed by Matlab. Ground score, drag score, step size, foot lift, instant speed, and average speed of foot point trajectories are used for selecting the best one.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.124-126
• /
• 2002

본 논문에서는 비디오 데이터가 지니는 이동 객체의 움직임 궤적(moving objects'trajectories)에 대해 유사 부분 움직임 궤적 검색을 효율적으로 지원하는 N-워핑(N-warping) 알고리즘을 제안한다. 제안하는 알고리즘은 기존의 시계열 데이터베이스에서 유사 서브시퀸스 검색을 위해 사용되었던 타임 워핑 변환 기법(time-warping transformation)을 변형란 알고리즘이다. 또한 제안하는 알고리즘은 움직임 궤적을 모델링하기 위해 사용되는 단일 속성(property)인 각도뿐만 아니라, 거리와 시간과 같은 다중 속성을 지원하며, 사용자 질의에 대해 유사 부분 움직임 궤적 검색을 가능하게 하는 근사 매칭(approximate matching)을 지원한다

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.5
• /
• pp.753-761
• /
• 1987

Approximation of a Cartesian straight line motion with linear interpolation in the joint space has many desirable advantages and applications. But inappropriate determination of the corresponding subtravelling and transition times makes such joint-trajectories violate the input torque/force constraints. An approach that can overcome this difficult and yield the joint trajectories utilizing the allowable maximum input torque/force is established in this paper. The effectiveness of these results is demonstrated by using a three-joint revolute manipulator.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.253-255
• /
• 2001

본 논문에서는 비디오 데이터가 지니는 움직임 객체의 움직임 경로(Moving Objects'Trajectories)를 이용한 사용자 질의에 대해 효율적인 검색을 위만 새로운 시그니쳐 기반 접근 기법을 제안한다. 제안하는 시그니쳐 기반 접근 기법은 데이터 파일을 직접 접근하기 전에 전체 시그니쳐들을 탐색하여 필터링을 수행하기 때문에, 순차 탐색에 대해 디스크 접근 횟수를 감소시켜 검색 성능을 향상시킨다. 마지막으로 성능 평가를 통해 제안하는 방법이 삽입 시간, 검색 시간, 그리고 부가 저장 공간의 검색 효율(Retrieval Efficiency) 측면에서 성능이 우수함을 보인다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.2
• /
• pp.229-236
• /
• 2016

In this paper, we suggest new technology that can draw characters at a long distance by tracking a hand and analysing the trajectories of hand positions. It's difficult to recognize the shape of a character without discriminating effective strokes from all drawing strokes. We detect end points from input trajectories of a syllable with camera system and localize strokes by using detected end points. Then we classify the patterns of the extracted strokes into eight classes and finally into two categories of stroke that is part of syllable and not. We only draw the strokes that are parts of syllable and can display a character. We can get 88.3% in classification accuracy of stroke patterns and 91.1% in stroke type classification.