• Journal of Mechanical Science and Technology
• /
• 제18권8호
• /
• pp.1349-1357
• /
• 2004

Computer-Aided Inspection Planning (CAIP) is the integration bridge between CAD/CAM and Computer Aided Inspection (CAI). A CAIP system for On-Machine Measurement (OMM) is proposed to inspect the complicated mechanical parts efficiently during machining or after machining. The inspection planning consists of Global Inspection Planning (GIP) and Local Inspection Planning (LIP). In the GIP, the system creates the optimal inspection sequence of the features in a part by analyzing the various feature information such as the relationship of the features, Probe Approach Directions (PAD), etc. Feature groups are formed for effective planning, and special feature groups are determined for sequencing. The integrated process and inspection plan is generated based on the sequences of the feature groups and the features in a feature group. A series of heuristic rules are developed to accomplish it. In the LIP of Part II, the system generates inspection parameters. The integrated inspection planning is able to determine optimum manufacturing sequence for inspection and machining processes. Finally, the results are simulated and analyzed to verify the effectiveness of the proposed CAIP.

• 대한전자공학회논문지SP
• /
• 제49권1호
• /
• pp.97-103
• /
• 2012

본 논문에서는 잡음환경에서 효과적인 음성을 검출하기 위한 새로운 음성 검출 (VAD, voice activity detection) 알고리즘을 제안한다. 통계적 모델에 기반의 Likelihood ratio (LR)를 통하여 도출되는 전역 음성부재확률 (GSAP, global speech absence probability)은 음성검출을 위한 피쳐 (feature) 파라미터로 널리 적용되고 있다. 하지만 신호 대 잡음 비 (SNR, signal-to-noise ratio)가 낮은 잡음환경에서는 정확한 GSAP 추정이 어려운 문제점을 가지고 있다. 따라서 제안된 방법에서는 잡음환경에서 강인한 VAD 알고리즘을 위하여 Teager energy (TE) 기반의 GSAP를 피쳐 파라미터로 적용한다. 제안된 알고리즘은 기존의 방법과 객관적인 실험을 통해 비교 평가한 결과 다양한 배경잡음 환경에서 향상된 성능을 보였다.

• 대한전자공학회논문지
• /
• 제26권4호
• /
• pp.120-126
• /
• 1989

최근 집적도의 증가와 더불어 집적회로 제작과 점검을 자동화하기 위하여 영상처리방법을 이용한 집적회로의 인식 알고리듬이 개발되고 있다. 집적회로를 인식하기 위해서는 프레임 영상으로 부터 특징을 얻고 이것으로써 칩내의 모든 프레임 영상을 정합하여야한다. 본 논문은 layout 정보를 나타내는 꼭지점들의 위치와 형태를 직선화 알고리듬을 이용하여 추출한다. 부분적으로 겹치는 이웃 프레임들을 얻어진 꼭지점의 위치와 형태를 특징으로 하여 정합함으로써 꼭지점의 전체적 좌표와 형태를 추출한다.

• Journal of the Optical Society of Korea
• /
• 제20권1호
• /
• pp.107-117
• /
• 2016

We develop a new method to globally calibrate the feature points that are derived from the binocular systems at different positions. A three-DOF (degree of freedom) global calibration system is established to move and rotate the 3D calibration board to an arbitrary position. A three-DOF global calibration model is constructed for the binocular systems at different positions. The three-DOF calibration model unifies the 3D coordinates of the feature points from different binocular systems into a unique world coordinate system that is determined by the initial position of the calibration board. Experiments are conducted on the binocular systems at the coaxial and diagonal positions. The experimental root-mean-square errors between the true and reconstructed 3D coordinates of the feature points are 0.573 mm, 0.520 mm and 0.528 mm at the coaxial positions. The experimental root-mean-square errors between the true and reconstructed 3D coordinates of the feature points are 0.495 mm, 0.556 mm and 0.627 mm at the diagonal positions. This method provides a global and accurate calibration to unity the measurement points of different binocular vision systems into the same world coordinate system.

• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.207-211
• /
• 2011

This paper presents a method for facial feature representation and recognition from the Covariance Matrices of the Gabor-filtered images. Gabor filters are a very powerful tool for processing images that respond to different local orientations and wave numbers around points of interest, especially on the local features on the face. This is a very unique attribute needed to extract special features around the facial components like eyebrows, eyes, mouth and nose. The Covariance matrices computed on Gabor filtered faces are adopted as the feature representation for face recognition. Geodesic distance measure is used as a matching measure and is preferred for its global consistency over other methods. Geodesic measure takes into consideration the position of the data points in addition to the geometric structure of given face images. The proposed method is invariant and robust under rotation, pose, or boundary distortion. Tests run on random images and also on publicly available JAFFE and FRAV3D face recognition databases provide impressively high percentage of recognition.

• 제어로봇시스템학회논문지
• /
• 제15권4호
• /
• pp.451-455
• /
• 2009

This paper provides a comparison of global path planning method in single string by using pulled and pushed SOFM (Self-Organizing Feature Map) which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial-weight-vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified SOFM method in this research uses a predetermined initial weight vectors of the one dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward or reverse the input vector, by rising a pulled- or a pushed-SOFM. According to simulation results one can conclude that the modified neural networks in single string are useful tool for the global path planning problem of a mobile robot. In comparison of the number of iteration for converging to the solution the pushed-SOFM is more useful than the pulled-SOFM in global path planning for mobile robot.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.473-479
• /
• 2006

A global path planning algorithm using modified self-organizing feature map(SOFM) which is a method among a number of neural network is presented. The SOFM uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors of the 2-dimensional mesh, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the opposite direction of input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

• Journal of Information Processing Systems
• /
• 제17권4호
• /
• pp.737-753
• /
• 2021

As the demand for high-quality rendering for mixed reality, videogame, and simulation has increased, global illumination has been actively researched. Monte Carlo path tracing can realize global illumination and produce photorealistic scenes that include critical effects such as color bleeding, caustics, multiple light, and shadows. If the sampling rate is insufficient, however, the rendered results have a large amount of noise. The most successful approach to eliminating or reducing Monte Carlo noise uses a feature-based filter. It exploits the scene characteristics such as a position within a world coordinate and a shading normal. In general, the techniques are based on the denoised pixel or sample and are computationally expensive. However, the main challenge for all of them is to find the appropriate weights for every feature while preserving the details of the scene. In this paper, we compare the recent algorithms for removing Monte Carlo noise in terms of their performance and quality. We also describe their advantages and disadvantages. As far as we know, this study is the first in the world to compare the artificial intelligence-based denoising methods for Monte Carlo rendering.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (C)
• /
• pp.222-225
• /
• 2006

한국은 다른 나라에 비해 많은 인터넷 사용자를 가지고 있다. 이에 비례해서 한국의 인터넷 유저들은 Spam Mail에 대해 많은 불편함을 호소하고 있다. 이러한 문제를 해결하기 위해 본 논문은 다양한 Feature Weighting, Feature Selection 그리고 문서 분류 알고리즘들을 이용한 한국어 스팸 문서 Filtering연구에 대해 기술한다. 그리고 한국어 문서(Spam/Non-Spam 문서)로부터 영사를 추출하고 이를 각 분류 알고리즘의 Input Feature로써 이용한다. 그리고 우리는 Feature weighting 에 대해 기존의 전통적인 방법이 아니라 각 Feature에 대해 Variance 값을 구하고 Global Feature를 선택하기 위해 Max Value Selection 방법에 적용 후에 전통적인 Feature Selection 방법인 MI, IG, CHI 들을 적용하여 Feature들을 추출한다. 이렇게 추출된 Feature들을 Naive Bayes, Support Vector Machine과 같은 분류 알고리즘에 적용한다. Vector Space Model의 경우에는 전통적인 방법 그대로 사용한다. 그 결과 우리는 Support Vector Machine Classifier, TF-IDF Variance Weighting(Combined Max Value Selection), CHI Feature Selection 방법을 사용할 경우 Recall(99.4%), Precision(97.4%), F-Measure(98.39%)의 성능을 보였다.

• 한국콘텐츠학회논문지
• /
• 제3권1호
• /
• pp.9-13
• /
• 2003

이 논문에서는 비디오 영상에서의 블록 모션 측정을 위한 통계학적인 특징에 기반 한 알고리즘을 제안한다. 우선 참조 블록의 통계학적인 특징을 구하고, 이를 참조 블록의 통계적 특징과 정규 시작점 패턴 (SPP) 에 퍼져 있는 블록에서의 특징을 비교하여, SPP에서의 시작점 (SP) 후보를 선택하는 데에 적용한다. 최종적인 SP 들은 SP 후보 들에서의 평균절대차이 (MAD) 값으로 구한다. 마지막으로 기존의 고속탐색 알고리즘인 BBG나 DS 그리고 TSS중 하나를 이용하여 참조블록의 모션 벡터를 최종 SP를 시작점으로 하여 계산하였다. 실험결과는 기대 했던 바와 같이 최종 SP로부터의 시작점들이 전역최소값 (global minimum)에 근접함을 보여 주었다.