• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• pp.683-686
• /
• 1988

In the recognition of similar patterns like profile contours of human faces, feature measure plays important role. We extracted effective and general feature by B-spline approximation. The nodes and vertices of the approximated curve are normalized and used as features. Since the features have both local property of curvature extrema and global property by B-spline approximation, they are superior to those of curvature extrema of the profile contour. For the image data of six sets of 56 persons, some of which are ill-made, averaged accuracy rate of 97.6 % is obtained in recognizing combinational 333 test samples.

• 한국공작기계학회논문집
• /
• 제12권2호
• /
• pp.9-16
• /
• 2003

A strategy of the optimal shape design with FEA(Finite Element Analysis) for 2-D structure is proposed by comparing subproblem approximation method with first order approximation method. A cantilever beam with two different loading conditions, a concentrated load and an evenly distribute load, and truss structure with a concentrated loading condition are implemented to optimize the shape. It gives a good design strategy on the optimal truss structure as well as the optimal cantilever beam shape. It is found that the convergence is quickly finished with the iteration number below ten. Optimized shapes of cantilever beam and truss structure are shown with stress contour plot by the results of the subproblem approximation method and the first order approximation methd.

• Journal of Information Processing Systems
• /
• 제13권1호
• /
• pp.174-183
• /
• 2017

In this paper, we propose a novel feature for recognizing handwritten Odia numerals. By using polygonal approximation, each numeral is segmented into segments of equal pixel counts where the centroid of the character is kept as the origin. Three primitive contour features namely, distance (l), angle (${\theta}$), and arc-tochord ratio (r), are extracted from these segments. These features are used in a neural classifier so that the numerals are recognized. Other existing features are also considered for being recognized in the neural classifier, in order to perform a comparative analysis. We carried out a simulation on a large data set and conducted a comparative analysis with other features with respect to recognition accuracy and time requirements. Furthermore, we also applied the feature to the numeral recognition of two other languages-Bangla and English. In general, we observed that our proposed contour features outperform other schemes.

• International Journal of CAD/CAM
• /
• 제12권1호
• /
• pp.29-37
• /
• 2012

A new algorithm has been developed to construct surface from the contours having branches and the final smooth surface is obtained by the reversible Catmull-Clark subdivision. In branching, a particular layer has more than one contour that correspond with at least one contour at the adjacent layer. In the next step, three-dimensional composite curve is constructed from contours of a layer having correspondence with at least one contour at the adjacent layer by inserting points between them and joining the contours. The points are inserted in such a way that the geometric center of the contours should merge at the center of the contours at the adjacent layer. This process is repeated for all layers having branching problems. Polyhedra are constructed in the next step with the help of composite curves and the contours at adjacent layer. The required smooth surface is obtained in the proposed work by providing the level of smoothness.

• International Journal of CAD/CAM
• /
• 제4권1호
• /
• pp.33-45
• /
• 2004

In this work, a rational procedure has been formulated for the selection of points approximating slice contours cut in LOM (Laminated Object manufacturing) with first order approximation. It is suggested that the number of points representing a slice contour can be 'minimised' or 'optmised' by equating the horizontal chordal deviation (HCD) to the user-defined surface form tolerance. It has been shown that such optimization leads to substantial reduction in slice height calculations and NC codes file size for cutting out the slices. Due to optimization, the number of contour points varies from layer to layer, so that points on successive layer contours have to be matched by four sided ruled surface patches and triangular patches. The technological problems associated with the cutting out of triangular patches have been addressed. A robust algorithm has been developed for the determination of slice height for optimum and arbitrary numbers of contour points with different strategies for error calculations. It has been shown that optimisation may even lead to detection and appropriate representation of elusive surface features. An index of optimisation has been defined and calculations of the same have been tabulated.

• 한국정밀공학회지
• /
• 제10권4호
• /
• pp.81-93
• /
• 1993

The three dimensional(3D) shape reconstruction from two dimensional(2D) cross-sections can be completed through three main phases : the input compilation, the triangular grid formation, and the smooth surface construction. In the input compilation phase, the cross-sections are analyzed to exctract the input data required for the shape reconstruction. This data includes the number of polygonized contours per cross-section and the vertices defining each polygonized contour. In the triangular grid formation phase, a triangular grid, leading to a polyhedral approximations, is constructed by extracting all the information concerning contour links between two adjacent cross- sections and then performing the appropriate triangulation procedure for each contour link. In the smooth surface construction phase, a smooth composite surface interpolating all vertices on the triangular grid is constructed. Both the smooth surface and the polyhedral approximation can be used as reconstructed models of the object. This paper proposes a new method for reconstructing the geometric model of a 3D objdect from a sequence of planar contours representing 2D cross-sections of the objdect. The method includes the triangular grid formation algorithms for contour closing, one-to-one branching, and one-to-many braanching, and many-to-many branching. The shape reconstruction method has been implemented on a SUN workstation in C.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (B)
• /
• pp.625-627
• /
• 2001

기존의 종이지도를 수치지도 처리과정으로 얻어진 등고선(contour line) 데이터는 원격탐사(Remote Sensing)와 지리정보시스템(GIS)의 응용분야에서 주로 사용되어지는 데이터이다. 이러한 등고선은 해당 지역의 DTM(Digital Terrain Model) 데이터 생성을 위해 보간(interpolation)하여 생성하는 데 연구가 집중되어 왔다. 본 논문에서는 DEM(Digital levation Model)으로부터 얻어진 등고선 데이터를 이용하여 사용자에게 3차원으로 가시화 해 줄 수 있는 기법을 소개한다. 등고선 추출을 위한 방법으로는 기존의 소개되어진 Marching Square 알고리즘을 적용하였고, 지역적인 최고점(local minimum)과 최소점(maximum)을 구하기 위해 등고선을 열린 등고선(open contour)과 닫힌 등고선(closed contour)으로 분류하게 된다. 지역적 최고, 최소점을 찾기 위한 탐색공간을 줄이기 위해 닫힌 등고선만을 닫힌 등고만을 대상으로 등고선 트리를 생성하였으며, 생성된 트리의 리프노드에 대해서 최고, 최소점에 대한 근사(approximation)를 수행하게 된다. 이렇게 구해진 근사된 장점들과 등고선 데이털 입력으로 하여 제한된 딜로니 삼각분할(Constrained Delaunay Triangulation)을 수행함으로써, 3차원 지형을 재구성할 수 있다. 실험에서 간단한 그리드 샘플데이터와 USGS로 획득한 데이터를 이용하여 속도 측정을 하였다. 결과적으로 저장공간 측면에서 적은 량의 데이터를 가지면서 등고선을 표현할 수 있는 3차원 지형을 랜더링할 수가 있음을 알 수 있다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2001년도 추계학술발표논문집 (상)
• /
• pp.641-644
• /
• 2001

기존의 종이지도를 수치지도 처리과정으로 얻어진 등고선(contour line) 데이터는 원격탐사(Remote Sensing)와 지리정보시스템(GIS)의 응용분야에서 주로 사용되어지는 데이터이다. 이러한 등고선은 해당 지역의 DTM(Digital Terrain Model) 데이터 생성을 위해 보간(interpolation)하여 생성하는 데 연구가 집중되어 왔다. 본 논문에서는 DEM(Digital Elevation Model)으로부터 얻어진 등고선 데이터를 이용하여 사용자에게 3 차원으로 가시화 해 줄 수 있는 기법을 소개한다. 등고선 추출을 위한 방법으로는 기존의 소개되어진 Marching Square 알고리즘을 적용하였고, 지역적인 최고점(local minimum)과 최소점(maximum)을 구하기 위해 등고선을 열린 등고선(open contour)과 닫힌 등고선(closed contour)으로 분류하게 된다. 지역적 최고, 최소점을 찾기 위한 탐색공간을 줄이기 위해 닫힌 등고선만을 대상으로 등고선 트리를 생성하였으며, 생성된 트리의 리프노드에 대해서 최고, 최소점에 대한 근사(approximation)를 수행하게 된다. 이렇게 구해진 근사된 정점들과 등고선 데이터를 입력으로 하여 제한된 딜로니 삼각분할(Constrained Delaunay Triangulation)을 수행함으로써, 3 차원 지형을 재구성할 수 있다. 실험에서 USGS 로부터 획득한 지형 데이터를 이용하여 속도 측정을 하였다. 결과적으로 저장공간 측면에서 적은 량의 데이터를 가지면서 등고선을 표현할 수 있는 3 차원 지형을 렌더링 할 수 있음을 알 수 있다.

• 전자공학회논문지SC
• /
• 제47권5호
• /
• pp.24-32
• /
• 2010

본 연구에서는 Optical Flow Method의 추적 성능을 향상시키기 위한 전처리 알고리즘을 제안한다. 제안하는 알고리즘은 Median Filter, Binarization, Morphology, Canny Edge, Contour Detecting 및 Approximation Method를 기반으로 개발되었다. Optical Flow 추적 성능 향상 여부를 평가하기 위해 Lucas-Kanade Optical Flow 알고리즘에 개발된 전처리 알고리즘을 적용하고, 전처리 알고리즘이 적용되지 않은 Optical Flow 영상과 추적 결과를 비교 분석하였다. 또한, Median Filter와 Histogram Equalization으로 구성된 기존 전처리 알고리즘과의 결과 비교를 통해, 개발된 전처리 알고리즘의 추적 성능 향상여부를 평가하였다. 실험결과, 전처리 알고리즘을 적용하지 않은 영상과 기존 전처리 알고리즘을 적용한 영상은 특징영역의 분할이 이루어지지 않아, Optical Flow의 추적 정확도가 매우 낮게 나타났다. 반면, 개발된 전처리 알고리즘을 적용한 영상에서는 외곽선이 내외부로 세분화되고, 외곽선 트리가 구성됨에 따라 Optical Flow의 추적 성능이 매우 높게 나타났다.

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

Detection of vanishing point is a challenging task in the situations where there are several structures with straight lines. Commonly used approaches for determining vanishing points involves finding the straight lines using edge detection and Hough transform methods. This approach often fails to perform effectively when there are a lot of straight lines found. The lines not meeting at a vanishing point are considered to be noises. In such situation, finding right candidate lines for detecting vanishing points is not a simple task. This paper proposes to use reference objects for vanishing point detection. By analyzing a reference object, it identifies the contour of the object, and derives a polygon from the contour information. Then the edges of the detected polygon are used to find the vanishing points. Our experimental results show that the proposed approach can detect vanishing points with comparable accuracy to the existing edge detection based method. Our approach can also be applied effectively even to complex situations, where too many lines generated by the existing methods make it difficult to select right lines for the vanishing points.