• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.101.1-101
• /
• 2001

This paper describes a grid mapping for a vision based mobile robot in uncertain indoor environment. The map building is a prerequisite for navigation of a mobile robot and the problem of feature correspondence across two images is well known to be of crucial Importance for vision-based mapping We use a stereo matching algorithm obtained by singular value decomposition of an appropriate correspondence strength matrix. This new correspondence strength means a correlation weight for some local measurements to quantify similarity between features. The visual range data from the reconstructed disparity image form an occupancy grid representation. The occupancy map is a grid-based map in which each cell has some value indicating the probability at that location ...

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2011년도 추계학술대회
• /
• pp.161-164
• /
• 2011

영상 매칭은 컴퓨터 비전에서 기초적인 기술로써 영상 추적, 물체인식 등 다양한 분양에서 많이 사용되고 있다. 하지만 스케일, 시점변화, 조명 변화에 강인한 매칭점을 찾는 것은 어려운 일이다. 이러한 문제점을 보완하기 위해 SURF(Scale Invariant Feature Transform), SIFT(Speed up Robust Features) 등의 알고리즘이 제안 되었지만, 여전히 조명변화에 불안정하고 정확하지 못한 성능을 보인다. 본 논문에서는 이러한 조명변화에 대한 문제점을 해결하기 위해 히스토그램 평활화를 이용하여 영상을 보정 후, SURF를 통한 영상 매칭을 하였다. 열악한 조명환경 내에서 촬영된 영상에서 SURF를 이용하여 표현자(Descriptor)를 생성 할 때 특징점이 잘 추출되지 않는 문제점을 해결하기 위하여 히스토그램 평활화를 이용하였고, 보정 후 특징점 개수가 많이 증가하는 것을 보여 확인하였다. 기존의 SURF와 개량된 SURF를 조명이 서로 다른 영상간의 매칭 성능을 비교함으로써 제안한 알고리즘의 우수성을 확인하였다

• 전자공학회논문지B
• /
• 제32B권9호
• /
• pp.1171-1180
• /
• 1995

In this paper, we present a 3-D object recognition system in which the 3-D Hough transform domain is employed to represent the 3-D objects. In object modeling step, the features for recognition are extracted from the CAD models of objects to be recognized. Since the approach is based on the CAD models, the accuracy and flexibility are greatly improved. In matching stage, the sensed image is compared with the stored model, which is assumed to yield a distortion (location and orientation) in the 3-D Hough transform domain. The high dimensional (6-D) parameter space, which defines the distortion, is decomposed into the low dimensional space for an efficient recognition. At first we decompose the distortion parameter into the rotation parameter and the translation parameter, and the rotation parameter is further decomposed into the viewing direction and the rotational angle. Since we use the 3-D Hough transform domain of the input images directly, the sensitivity to the noise and the high computational complexity could be significantly alleviated. The results show that the proposed 3-D object recognition system provides a satisfactory performance on the real range images.

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

The palm print recognition is the most reliable authentication method in the biometrics. In this paper, using the efficient segmentation of the palm print region we propose the method of enabling the palm print recognition as the same method applicable to the finger print recognition. To achieve this, we propose the image processing procedures of the palm print segmentation and the feature extraction. We compare the matching result after extracting the features for the finger print and the palm print.

• 전자공학회논문지
• /
• 제53권7호
• /
• pp.67-77
• /
• 2016

본 논문에서는 변형된 하우스더프 거리 (MDH: Modified Hausdorff Distance)를 이용한 눈 개폐 감지 알고리즘을 제안한다. 제안하는 알고리즘은 얼굴 검출과 눈 개폐 감지로 크게 구분된다. 얼굴 영역의 검출을 위하여 고정 크기의 영역 내에서 픽셀 값을 이용하는 지역 구조특성의 MCT (Modified Census Transform)특징기반 방법을 사용하였다. 이후, 검출된 얼굴 영역 내에서 MHD를 이용하여 눈의 위치 및 개폐를 판단한다. 얼굴 검출의 처리절차는 먼저, 오프라인에서 다양한 얼굴 영상에 대해 MCT 이미지를 생성하고, 이를 기반으로 PCA를 이용하여 기준이 되는 특징벡터들을 추출한다. 다음으로, 온라인에서는 입력되는 실험 영상 내에서 새롭게 추출된 특징벡터들과 기준이 되는 특징 벡터들 간의 유클리드 거리를 이용하여 얼굴 영역을 검출하는 순서로 진행된다. 이후, 검출된 얼굴 영역 내에서 MHD 기반의 눈 영역 검출과 템플릿 매칭을 수행하여 눈의 개폐를 감지한다. 제안하는 방법의 성능 검증을 위하여 그레이 스케일 영상 (30FPS, $320{\times}180$)을 입력으로 실험을 수행한 결과, 눈 계폐 검출율에서 평균 94.04%의 정확도를 달성하였다.

• 전기학회논문지
• /
• 제66권10호
• /
• pp.1516-1522
• /
• 2017

We propose a novel monitoring system for diagnosing crack faults of the wind turbine using image information. The proposed method classifies a normal state and a abnormal state for the blade parts of the wind turbine. Specifically, the images are input to the proposed system in various states of wind turbine rotation. according to the blade condition. Then, the video of rotating blades on the wind turbine is divided into several image frames. Motion vectors are estimated using the previous and current images using the motion estimation, and the change of the motion vectors is analyzed according to the blade state. Finally, we determine the final blade state using the Support Vector Machine (SVM) classifier. In SVM, features are constructed using the area information of the blades and the motion vector values. The experimental results showed that the proposed method had high classification performance and its $F_1$ score was 0.9790.

• 한국멀티미디어학회논문지
• /
• 제19권6호
• /
• pp.1003-1013
• /
• 2016

This paper proposes a framework of superpixel-based vehicle detection method using plane normal vector in disparity space. We utilize two common factors for detecting vehicles: Hypothesis Generation (HG) and Hypothesis Verification (HV). At the stage of HG, we set the regions of interest (ROI) by estimating the lane, and track them to reduce computational cost of the overall processes. The image is then divided into compact superpixels, each of which is viewed as a plane composed of the normal vector in disparity space. After that, the representative normal vector is computed at a superpixel-level, which alleviates the well-known problems of conventional color-based and depth-based approaches. Based on the assumption that the central-bottom of the input image is always on the navigable region, the road and obstacle candidates are simultaneously extracted by the plane normal vectors obtained from K-means algorithm. At the stage of HV, the separated obstacle candidates are verified by employing HOG and SVM as for a feature and classifying function, respectively. To achieve this, we trained SVM classifier by HOG features of KITTI training dataset. The experimental results demonstrate that the proposed vehicle detection system outperforms the conventional HOG-based methods qualitatively and quantitatively.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2002년도 학술대회지
• /
• pp.517-520
• /
• 2002

Stereoscopic particle image velocimetry is a measurement technique to acquire of three dimensional velocity field by two cameras. With a laser sheet illumination, the third velocity component can be deduced by out-of-plane velocity components using a stereoscopic matching method. Industrial fluid flows are almost three dimensional turbulent flows, so it is necessary to use the stereoscopic PIV measurement method. However the existing stereoscopic PIV system seems hard to use since it is very expensive and complex. In this study we have developed a Stereoscopic Miniature PIV(MPIV) system based on the concept of the Miniature PIV system which we have already developed. In this paper, we address the design and some first experimental results of the stereoscopic PIV system. The Stereoscopic MPIV system features relatively modest performances, but is considerably smaller, cheaper and easy to handle. The proposed Stereoscopic MPIV system uses two one-chip-only CMOS cameras with digital output. Only two other chips are needed, one for a buffer memory and one for an interfacing logic that controls the system. Images are transferred to a personal computer (PC) via its standard parallel port. No extra hardware is required (in particular, no frame grabber board is needed).

• 디지털산업정보학회논문지
• /
• 제8권1호
• /
• pp.29-40
• /
• 2012

A challenging research issue that has been one of growing importance to those working in human-computer interaction are to endow a machine with an emotional intelligence. Thus, emotion recognition technology plays an important role in the research area of human-computer interaction, and it allows a more natural and more human-like communication between human and computer. In this paper, we propose the multimodal emotion recognition system using face and speech to improve recognition performance. The distance measurement of the face-based emotion recognition is calculated by 2D-PCA of MCS-LBP image and nearest neighbor classifier, and also the likelihood measurement is obtained by Gaussian mixture model algorithm based on pitch and mel-frequency cepstral coefficient features in speech-based emotion recognition. The individual matching scores obtained from face and speech are combined using a weighted-summation operation, and the fused-score is utilized to classify the human emotion. Through experimental results, the proposed method exhibits improved recognition accuracy of about 11.25% to 19.75% when compared to the most uni-modal approach. From these results, we confirmed that the proposed approach achieved a significant performance improvement and the proposed method was very effective.

• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1083-1094
• /
• 2020

Recognizing plant species based on leaf images is challenging because of the large inter-class variation and inter-class similarities among different plant species. The effective extraction of leaf descriptors constitutes the most important problem in plant leaf recognition. In this paper, a multi-scale angular description method is proposed for fast and accurate leaf recognition and retrieval tasks. The proposed method uses a novel scale-generation rule to develop an angular description of leaf contours. It is parameter-free and can capture leaf features from coarse to fine at multiple scales. A fast Fourier transform is used to make the descriptor compact and is effective in matching samples. Both support vector machine and k-nearest neighbors are used to classify leaves. Leaf recognition and retrieval experiments were conducted on three challenging datasets, namely Swedish leaf, Flavia leaf, and ImageCLEF2012 leaf. The results are evaluated with the widely used standard metrics and compared with several state-of-the-art methods. The results and comparisons show that the proposed method not only requires a low computational time, but also achieves good recognition and retrieval accuracies on challenging datasets.