• 한국멀티미디어학회논문지
• /
• 제21권2호
• /
• pp.147-157
• /
• 2018

Alzheimer's disease has the significant factors for the both specific and characteristic features according to the disease progressing that are the volumetry and surface area by the brain hippocampus shrinking and thinning. However, we have suggested a shape analysis to calculate the variance by the roughness, coarseness or uneven surface on 3D MR images. For the reasons we have presented two methods: the first method is the distance calculation from major axis to edge points and the second method is the distance calculation from centroidal point to edge points on a coronal plane. Then we selected the shortest distance and the longest distance in each slice and analyzed the ANOVA and average distances. Consequently we obtained the available and great results by the longest distance of the axial and centroidal point. The results of average distances were 44.85(AD), 45.04(MCI) and 49.31(NC) from the axial points and 39.30(AD), 39.58(MCI) and 44.78(NC) from centroidal points respectively. Finally the distance variations for the easily recognized visualization were shown by the color mapping. This research could be provided an indicator of biomarkers that make diagnosis and prognosis the Alzheimer's diseases in the future.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2007년도 춘계학술대회B
• /
• pp.3467-3472
• /
• 2007

The effects of the wall geometry on the spray-wall impingement process of a hollow-cone fuel spray emerging from a high-pressure swirl injector of the Gasoline Direct Injection (GDI) engine were investigated by means of a numerical method. The ized Instability Sheet Atomization (LISA) & Aerodynamically Progressed Taylor Analogy Breakup (APTAB) model for spray atomization process and the Gosman model were applied to model the atomization and wall impingement process of the spray. The calculation results of spray characteristics, such as a spray development process and a radial distance after wall impingement, compared with the experimental ones by the Laser Induced Exciplex Fluorescence (LIEF) technique. It was found that the radial distance of the cavity angle of 90$^{circ]$ after wall impingement was the shortest and the ring shaped vortex was generated near the wall after spray-wall impingement process.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.719-728
• /
• 1997

In the AGV routing a vehicle can select the shortest route on which no conflicts are anticipated. The procedure includes time constraint and the node/arc occupation times of vehicles in order to locate the conflicting paths. The slight differences among AGV routing algorithms exist in identifying the conflict regions encountered while reaching out to the destination node. In this paper, a novel approach to the use of the re-routing scheme is presented. It will be used to minimize the travel distance of vehicles in a regular vehicle routing process rather than to cope with emergency situations. The proposed algorithm provides existing active vehicles with the ability of changing their current paths for a new vehicle whenever the equal-distance paths exist, in on attempt to optimize the AGV transportation system. This ability is possible because of the flexibility of on AGV system controlled by a computer system.

• 한국멀티미디어학회논문지
• /
• 제22권12호
• /
• pp.1466-1480
• /
• 2019

This paper addresses the efficient processing of all-farthest-neighbors (AFN) queries in spatial network databases. Given a set of data points P={p₁,p₂,…,p_|p|} in a spatial network, where the distance between two data points p and s, denoted by dist (p,s), is the length of the shortest path between them, an AFN query is defined as follows: find the farthest neighbor ω(p)∈P of each data point p such that dist(p,ω(p)) ≥ dist(p,s) for all s∈P. In this paper, we propose a shared execution algorithm called FAST (for All-Farthest-neighbors Search in spatial neTworks). Extensive experiments on real-world roadmaps confirm the efficiency and scalability of the FAST algorithm, while demonstrating a speedup of up to two orders of magnitude over a conventional solution.

• 한국항해학회지
• /
• 제17권1호
• /
• pp.17-29
• /
• 1993

The new flexible controlling method integrated with some existing maneuvers of reducing a great head way during approaching a pilot station or anchor berth, namely , Super Rudder (Woo) controlling method originally was developed. The conclusions of this paper are drawn. 1) Super Rudder (Woo) controlling method has the shortest distance along base course and distance off base course among all reducing maneuvers including Rudder Cycling. 2) This new method is flexibly adjustable to a range of yaw angles 5-35 degrees either ship's side depending on traffic situations, 3) This new method is versatile controlling maneuver enabling shipandlers to reduce or stop a ship's headway and to adjust the proper courses to a pilot station or anchor berth.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1140-1143
• /
• 1996

A new approach based on artificial potential function is proposed for the obstacle avoidance of redundant manipulators. Unlike the so-called "global" path planning method, which requires expensive computation for the path search before the manipulator starts to move, this new approach, "local" path planning, researches the path in real-time using the local distance information. Previous use of artificial potential function has exhibited local minima in some complex environments. This thesis proposes a potential function that has no local minima even for a cluttered environment. This potential function has been implemented for the collision avoidance of a redundant robot in Simulation. The simulation also employ an algorithm that eliminates collisions with obstacles by calculating the repulsive potential exerted on links, based on the shortest distance to object.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2010-2014
• /
• 2005

Object detection and parameter estimation in point cloud data is a relevant subject to robotics, reverse engineering, computer vision, and sport mechanics. In this paper a software is presented for fully-automatic object detection and parameter estimation in unordered, incomplete and error-contaminated point cloud with a large number of data points. The software consists of three algorithmic modules each for object identification, point segmentation, and model fitting. The newly developed algorithms for orthogonal distance fitting (ODF) play a fundamental role in each of the three modules. The ODF algorithms estimate the model parameters by minimizing the square sum of the shortest distances between the model feature and the measurement points. Curvature analysis of the local quadric surfaces fitted to small patches of point cloud provides the necessary seed information for automatic model selection, point segmentation, and model fitting. The performance of the software on a variety of point cloud data will be demonstrated live.

• 응용통계연구
• /
• 제17권1호
• /
• pp.75-88
• /
• 2004

서포트 벡터 기계(Support Vector Machines, SVMs) 알고리즘은 표본 점들과 분리 초평면 사이의 최소 거리를 최대화하는 것에 관심을 가져왔다. 본 논문은 모든 데이터 점들과 분리 초평면 사이의 거리들을 고려하는 total margin을 제안한다. 본 논문에서 제안하는 방법은 기존의 서포트 벡터 기계 알고리즘을 확장하고, 일반화 오차 경계를 개선하게 된다. 새롭게 제안하는 total margin알고리즘이 기존 방법들과의 비교를 통하여 더욱 우수한 수행능력을 가지고 있음을 수치 예제들을 통하여 확인할 수 있다.

• 한국정보처리학회논문지
• /
• 제6권8호
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.59-59
• /
• 2000

In this paper, we present a framework for modeling and control of multiple mobile robots which cowork within a bounded workspace and limited resources. To achieve this goal, we adopt a formalism of discrete event system and supervisory control theory based on Petri nets. We can divide our whole story into two parts: first, we search the shortest path using the distance vector algorithm, and then we construct the control scheme from which a number of mobile robots can work within a bounded workspace without any collision. The use of Petri net modeling allows us In synthesize a controller which achieves a control specification for the desired closed-loop behavior efficiently. Finally, the usefulness of the proposed Petri net formalism is illustrated by a simulation study.