• Korean Journal of Computational Design and Engineering
• /
• v.9 no.3
• /
• pp.203-211
• /
• 2004

In this paper, we present a method of extracting a regular 2-manifold triangular net from a triangular net including degenerate and self-intersected triangles. This method can be applied to obtaining an offset model without degenerate and self-intersected triangles. Then this offset model can be used to generate CL curves and extract machining features for CAPP The robust and efficient algorithm to detect valid triangles by growing regions from an initial valid triangle is presented. The main advantage of the algorithm is that detection of valid triangles is performed only in valid regions and their adjacent selfintersections, and omitted in the rest regions (invalid regions). This advantage increases robustness of the algorithm. As well as a k-d tree bucketing method is used to detect self-intersections efficiently.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.91-94
• /
• 2001

In this paper, we proposed localization method of mobile robot using color landmark mounted on ceiling. This work is composed 2 parts : landmark recognition part which finds the position of multiple landmarks in image and identifies them and absolute position estimation part which estimates the location and orientation of mobile robot in indoor environment. In landmark recognition part, mobile robot detects artificial color landmarks using simple histogram intersection method in rg color space which is insensitive to the change of illumination. Then absolute position estimation part calculates relative position of the mobile robot to the detected landmarks. For the verification of proposed algorithm, ceiling-orientated camera was installed on a mobile robot and performance of localization was examined by designed artificial color landmarks. As the result of test, mobile robot could achieve the reliable landmark detection and accurately estimate the position of mobile robot in indoor environment.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.782-787
• /
• 1997

This paper proposes methods for pencil machining and uncut area machining. Based on Z-map represented by triangular facets, self-intersection-free offset surface is generated with K-offset method in case of ball mill and flat mill Pencil machining can elliminate overload area before main machining rough, semi-finish and finish cutting,preventing fluctuations of cutting forces in concave regions form causing bad machining condition. Low productivity is caused by uncut area which has excessive or irreguar finishing allowance. Uncut area machining has the finishing allowance keep uniformly on part surface. This paper deals with two types of uncaut area, machining detection of excessive area and user-defined area.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.127-135
• /
• 2009

This paper presents a new technique for corner shape based object retrieval from a database. The proposed feature matrix consists of values obtained through a neighborhood operation of detected corners. This results in a significant small size feature matrix compared to the algorithms using color features and thus is computationally very efficient. The corners have been extracted by finding the intersections of the detected lines found using Hough transform. As the affine transformations preserve the co-linearity of points on a line and their intersection properties, the resulting corner features for image retrieval are robust to affine transformations. Furthermore, the corner features are invariant to noise. It is considered that the proposed algorithm will produce good results in combination with other algorithms in a way of incremental verification for similarity.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.11
• /
• pp.669-672
• /
• 2005

An algorithm detecting abrupt and gradual shot boundaries is proposed in this Paper. The conventional methods detect abrupt shot boundaries well, but do not show good performance on gradual shot boundaries. The proposed method Is based on the fact that the difference of the characteristic between frames is large when the shot conversion occurs. And the Proposed method detects abrupt and gradual shot boundaries with one algorithm. Moreover, it detects not only position where gradual shot conversion occurs, but also the exact duration where gradual shot conversion occurs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.511-513
• /
• 2001

지능형 교통 시스템(ITS)은 1) 도로의 상황 분석과 2) 위반 차량의 검지를 자동으로 수행하여 원활한 교통 제어를 제공하는 목적을 가지고 있다. 본 논문에서는 교차로에서 위반 차량을 검지하기 위하여 도로위의 차량 검지하고 차량의 진행 경로를 추적하는 기법으로 주간에는 배경 영상을 사용하지 않고 프레임간의 차를 이용하여 차량의 움직임 정보를 추출하고 야간에는 전조등을 검출하여 차량을 추적하는 기법으로 주간의 겨우 차량의 움직임만을 감지하므로 칼만 필터(Kalman Filter) 등에 의한 예측이 불가능하므로 현재 위치와 진행방향으로 움직임 정보를 추적하는 기법을 제안한다. 제안하는 기법은 주간 그림자의 영향과 야간의 난반사의 영향을 제거할 수 있고 입력 영상을 320x240으로 축소하여 초당 10프레임이상으로 처리하므로 정확한 차량의 움직임을 추적할 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.485-488
• /
• 2013

최근 자동차 산업의 활성화로 인해 교통사고 급증이 사회 문제화 되면서 사고를 미연에 방지할 수 있는 운전자 보조 시스템 연구가 활발하게 이루어지고 있다. 일반적으로 자동차 사고 원인의 70% 이상이 운전자 과실에 의해서 발생되고 전체 추돌사고의 75%가 시속 29km 이하의 속도에서 발생한다. 이를 예방하기 위해서 운전자의 인지 판단을 보조하는 시스템의 개발이 많이 이루어지고 있는데, 예를 들어 자동 주차 시스템, AVM(Around View Monitoring) 시스템 등이 있다. 본 논문에서는 AVM 시스템 중 원근 왜곡을 보정하는 단계에서 직선 및 교점을 검출할 때, NMS(Non-Maximum Suppression)를 적용한 허프 변환 방법을 사용할 것이다. 또한 기존의 Sub-Pixel을 이용한 직선 및 교점 검출 방법과 NMS을 적용한 허프 변환 방법을 사용한 직선 및 교점을 검출하는 방법을 비교 분석함으로써 제안하는 NMS를 적용한 허프변환을 이용한 직선 및 교점을 검출하는 방법을 사용하여 보다 효율적인 AVM 시스템의 구현 가능성을 검증한다.

• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.150-150
• /
• 1999

In this paper, a content-based image retrieval scheme based on scale-space theory is proposed. The existing methods using scale-space theory consider all scales for image retrieval,thereby requiring a lot of computation. To overcome this problem, the proposed algorithm utilizes amodified histogram intersection method to select candidate images from database. The relative scalebetween a query image and a candidate image is calculated by the ratio of histograms. Feature pointsare extracted from the candidates using a corner detection algorithm. The feature vector for eachfeature point is composed of RGB color components and differential invariants. For computing thesimilarity between a query image and a candidate image, the euclidean distance measure is used. Theproposed image retrieval method has been applied to various images and the performance improvementover the existing methods has been verified.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.484-489
• /
• 2006

Private Matching은 각기 다른 두 참여자 (two-party)가 가진 데이터의 교집합 (intersection)을 구하는 문제이다. Private matching은 보험사기 방지시스템 (insurance fraud detection system), 의료정보 검색, 항공기 탐승 금지자 목록 (Do-not-fly list) 검색 등에 이용될 수 있으며 다자간의 계산 (multiparty computation)으로 확장하면 전자투표, 온라인 게임 등에도 이용될 수 있다. 2004년 Freedman 등은 이 문제를 확률적 (probabilistic)으로 해결하는 프로토콜 (protocol) [1]을 제안하고 악의적인 공격자 (malicious adversary) 모델과 다자간 계산으로 확장하였다. 이 논문에서는 기존의 프로토콜을 결정적 (deterministic) 방법으로 개선하여 Semi-Honest 모델에서 결과의 정확성을 보장하는 한편, 이를 악의적인 공격자 모델에 확장하여 신뢰도와 연산속도를 향상시키는 새로운 프로토콜을 제안한다.

• Journal of Internet Computing and Services
• /
• v.21 no.6
• /
• pp.23-31
• /
• 2020

This study was carried out to generate various images of railroad surfaces with random defects as training data to be better at the detection of defects. Defects on the surface of railroads are caused by various factors such as friction between track binding devices and adjacent tracks and can cause accidents such as broken rails, so railroad maintenance for defects is necessary. Therefore, various researches on defect detection and inspection using image processing or machine learning on railway surface images have been conducted to automate railroad inspection and to reduce railroad maintenance costs. In general, the performance of the image processing analysis method and machine learning technology is affected by the quantity and quality of data. For this reason, some researches require specific devices or vehicles to acquire images of the track surface at regular intervals to obtain a database of various railway surface images. On the contrary, in this study, in order to reduce and improve the operating cost of image acquisition, we constructed the 'Defective Railroad Surface Regeneration Model' by applying the methods presented in the related studies of the Generative Adversarial Network (GAN). Thus, we aimed to detect defects on railroad surface even without a dedicated database. This constructed model is designed to learn to generate the railroad surface combining the different railroad surface textures and the original surface, considering the ground truth of the railroad defects. The generated images of the railroad surface were used as training data in defect detection network, which is based on Fully Convolutional Network (FCN). To validate its performance, we clustered and divided the railroad data into three subsets, one subset as original railroad texture images and the remaining two subsets as another railroad surface texture images. In the first experiment, we used only original texture images for training sets in the defect detection model. And in the second experiment, we trained the generated images that were generated by combining the original images with a few railroad textures of the other images. Each defect detection model was evaluated in terms of 'intersection of union(IoU)' and F1-score measures with ground truths. As a result, the scores increased by about 10~15% when the generated images were used, compared to the case that only the original images were used. This proves that it is possible to detect defects by using the existing data and a few different texture images, even for the railroad surface images in which dedicated training database is not constructed.