• 한국정밀공학회지
• /
• 제23권11호
• /
• pp.78-84
• /
• 2006

The objective of this study is to design the optimal die profile that can prevent material fracture in the tube drawing process for automobile steering input shaft. First, the CDV(Critical Damage Value) of material is obtained by the compression test and FE-analysis. The occurrence of fracture is estimated by the FE-analysis considering the CDV. In order to achieve the objective of this study, optimization technique and FE-analysis are applied. FPS(Flexible Polyhedron Search) method, which is one of the non-gradient optimization techniques often used in engineering, is used to search optimal die profile. The drawing die profile is represented by Bezier-curve to generate all the possible die profile. Using FPS method and FE-analysis the optimal drawing die profile is determined. To verify tile effectiveness of the redesigned optimal die, the tube drawing experiment is performed. In the experimental result, it is possible to produce sound product without material fracture using the redesigned optimal die.

• 한국CDE학회논문집
• /
• 제6권1호
• /
• pp.31-39
• /
• 2001

Presented in this paper are algorithms to compute the positions of vertices and equations of edges of the Voronoi diagram of a circle set. The circles are located in a Euclidean plane, the radii of the circles are not necessarily equal and the circles are not necessarily disjoint. The algorithms correctly and efficiently work when the correct topology of the Voronoi diagram was given. Given three circle generators, the position of the Voronoi vertex is computed by treating the plane as a complex plane, the Z-plane, and transforming it into another complex plane, the W-plane, via the Mobius transformation. Then, the problem is formulated as a simple point location problem in regions defined by two lines and two circles in the W-plane. And the center of the inverse-transformed circle in Z-plane from the line in the W-plane becomes the position of the Voronoi vertex. After the correct topology is constructed with the geometry of the vertices, the equations of edge are computed in a rational quadratic Bezier curve farm.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.44-47
• /
• 2004

This paper proposes an approach for composite surface reconstruction from 2D serial cross-sections, where the number of contours varies from section to section. In a triangular surface-based approach taken in most reconstruction methods, a triangular $G^{1}$ surface is constructed by stitching triangular patches over a triangular net generated from the compiled contours. In the proposed approach, the resulting surface is a composite $G^{1}$ surface consisting of three kinds of surfaces: skinned, surface is first represented by a B-spline surface approximating the serial contours of the skinned region and then serial contours of the skinned region and then transformed into a mesh of rectangular Bezier patches. On branched and capped regions, triangular $G^{1}$ surfaces are constructed so that the connections between the triangular surfaces and their neighboring surfaces are $G^{1}$ continuous. Since each skinned region is represented by an approximated rectangular $G^{2}$ surface instead of an interpolated triangular $G^{1}$ surface, the proposed approach can provide more visually pleasing surfaces and realize more efficient data reduction than the triangular surface-based approach. Some experimental results demonstrate its usefulness and quality.

• 제어로봇시스템학회논문지
• /
• 제19권11호
• /
• pp.1036-1042
• /
• 2013

In this paper, an elderly assistance system is developed based on Xenomai, a real-time development framework cooperating with the Linux kernel. A Kinect sensor is used to recognize the behavior of the elderly and A-star search algorithm is implemented to find the shortest path to the person. The mobile robot also generates a trajectory using a digital convolution operator which is based on a Bezier curve for smooth driving. In order to follow the generated trajectory within the control period, we developed real-time tasks and compared the performance of the tracking trajectory with that of non real-time tasks. The real-time task has a better result on following the trajectory within the physical constraints which means that it is more appropriate to apply to an elderly assistant system.

• 대한전자공학회논문지
• /
• 제27권2호
• /
• pp.151-157
• /
• 1990

본 논문에서는 CSG 방식으로 나타내어진 3차원 입체를 신속하게 외형선 표시방식으로 그려줄 수 있는 방법을 제안한다. 두 개의 CSG 트리가 하나로 결합될때, 각 종속 트리에 해당하는 입체를 구성하는 다각형들간의 교차 부분을 계산하여 주어진 결합 연산자에 따라 합성 입체의 경계선 표현을 얻어내고, 이를 트리의 루트노드에 저장한다. 루트 노드에 저장된 경계선 표현은 입체를 외형선 표시방식으로 그려주는 부분과 다음 경계선 표현 계산에서 사용된다. 자유 곡면을 모델링하기 위하여 Bezier 곡면을 기본 입체의 하나로 취급하였고, 설계된 입체에 대한 실제적인 영상을 얻기 위하여 scan-line 알고리듬을 사용하였는데, 이 방식에서는 각 scan-line을 다각형들이 교차하지 않는 구간들로 나누고, 입체의 CSG 표현을 이용하여 각 구간을 묘화한다.

• 한국CDE학회논문집
• /
• 제3권3호
• /
• pp.183-191
• /
• 1998

There are many available algorithms based on the different approaches to solve the intersection problems between two curves. Among them, the implicitization method is frequently used since it computes precise solutions fast and is robust in lower degrees. However, once the degrees of curves to be intersected are higher than cubics, its computation time increases rapidly and the numerical stability gets worse. From this observation, it is natural to transform the original problem into a set of easier ones. Therefore, curves are subdivided appropriately depending on their geometric behavior and approximated by a set of rational quadratic Bezier cures. Then, the implicitization method is applied to compute the intersections between approximated ones. Since the solutions of the implicitization method are intersections between approximated curves, a numerical process such as Newton-Raphson iteration should be employed to find true intersection points. As the seeds of numerical process are close to a true solution through the mix-and-match process, the experimental results illustrates that the proposed algorithm is superior to other algorithms.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2005년도 춘계학술대회 논문집
• /
• pp.115-124
• /
• 2005

This paper analyzes the problems that occurred in the magnification process for a fine input image and investigates a method to improve the problems. This paper applies a curve interpolation algorithm in CAD/CAM for the same test images with the existing image algorithm in order to improve the problems. As a result. the nearest neighbor interpolation. which is the most frequently applied algorithm for the existing image interpolation algorithm. shows that the identification of a magnified image is not possible. Therefore. this study examines an interpolation of gray-level data by applying a low-pass spatial filter and verifies that a bilinear interpolation presents a lack of property that accentuates the boundary of the image where the image is largely changed. The periodic B-spline interpolation algorithm used for curve interpolation in CAD/CAM can remove the blurring but shows a problem of obscuration, and the Ferguson's curve interpolation algorithm shows a more sharpened image than that of the periodic B-spline algorithm. For the future study, hereafter. this study will develop an interpolation algorithm that has an excel lent improvement for the boundary of the image and continuous and flexible property by using the NURBS. Ferguson's complex surface. and Bezier surface used in CAD/CAM engineering based on. the results of this study.

• 대한기계학회논문집A
• /
• 제35권7호
• /
• pp.729-736
• /
• 2011

TOPSIS(Technique for Order Preference by Similarity to Ideal Solution)는 상충되는 다수의 속성이 존재하는 상황에서 의사결정이 요구되는 다속성 의사결정법(Multi Attribute Decision Making) 중 하나이다. 이는 선택된 대체안이 최선의 이상적 대체안으로부터 가장 가까운 거리에 위치해야 하고, 동시에 부정적으로 이상적인 대체안으로부터는 가장 멀리 위치해야 한다는 논리에 입각한 의사결정 기법이다. TOPSIS 는 최소화와 최대화가 공존하는 다목적함수 형상 최적설계에 적용이 가능하다. 본 연구에서는 TOPSIS 와 베지어 곡선(Rational Bezier Curve)을 적용하여 CRT(Cathode Ray Tubes) 후면유리의 다중목적 형상최적설계를 수행하였다. 무게와 1 차 주응력의 두 가지 다중목적 함수를 최적화하기 위하여, 다중목적 함수의 성능지표를 TOPSIS 의 상대적 근접도로 정의하고 이를 반응표면모델로 구성하여 다중목적 형상최적설계가 가능한 방법론을 제안하였다. 이를 통해 하나의 최적해가 아닌 최적해의 군이 선정되어, 무게와 주응력 최적해의 모순관계를 확인하면서 다양한 설계요구 스펙을 만족시켜줄 수 있는 방안을 설계자가 스스로 선택하도록 하였다.

• 대한전자공학회논문지SP
• /
• 제48권4호
• /
• pp.21-29
• /
• 2011

사전에 정의된 피부 색상 정보를 이용한 기존 피부 검출 방법들은 배경과 피부 영역을 분할하는 단계에서 사용되는 임계값을 실험을 통하여 주관적 관점에서 결정하였다. 또한 기존 방법들은 배경 환경과 조명 환경에 따라 각각 다른 임계값을 설정하였다. 이러한 기존 방법들은 반복 실험을 통하여 추정된 임계값에 따라 성능이 좌우되는 단점이 제시되었다. 제시된 기존 방법들의 단점을 극복하기 위하여 본 논문은 mean shift 알고리즘 기반의 히스토그램 근사화를 이용한 피부 영역 검출 방법을 제안한다. 제안하는 방법은 CbCr 컬러공간에서의 표준 피부색상과 유사도를 비교하여 생성된 입력 영상의 피부맵(skin-map)의 히스토그램에서 mean shift 방법을 이용하여 각각 밝기 영역별로 수렴하는 극대점을 능동적으로 찾아서 배경 영역과 피부영역으로 분할한다. 히스토그램은 픽셀의 명도값에 따라 누적되는 불연속 함수의 형태를 가지므로 베이지 곡선(Bezier curve) 기법을 이용하여 연속 가우시안 함수로 근사화된다. 따라서 제안하는 방법은 기존 방법에서처럼 수동적으로 임계값을 설정하는 방법을 사용하지 않고 mean shift 기법을 이용하여 능동적으로 영역 분할점인 극대점을 찾아서 피부 영역을 검출한다. 제안된 방법은 실험을 통하여 강인하고 효율적으로 피부 영역을 검출하였다.

• Kyungpook Mathematical Journal
• /
• 제43권4호
• /
• pp.593-604
• /
• 2003

In this paper we introduce the integral type Lupas-$B{\acute{e}}zier$ operator $\tilde{B}_{n,{\alpha}}$, which is a new approximation operator of probabilistic type. We study the rate of pointwise convergence of the operators $\tilde{B}_{n,{\alpha}}$ for local bounded functions and get an asymptotically estimate by means of some methods and techniques of probability theory.