• Journal of Multimedia Information System
• /
• 제6권2호
• /
• pp.91-98
• /
• 2019

Many researchers have attempted to recognize three-dimensional faces using feature points extracted from two-dimensional facial photographs. However, due to the limit of flat photographs, it is very difficult to recognize faces rotated more than 15 degrees from original feature points extracted from the photographs. As such, it is difficult to create an algorithm to recognize faces in multiple angles. In this paper, it is proposed a new algorithm to recognize three-dimensional face recognition based on feature points extracted from a flat photograph. This method divides into six feature point vector zones on the face. Then, the vector value is compressed and expanded according to the rotation angle of the face to recognize the feature points of the face in a three-dimensional form. For this purpose, the average of the compressibility and the expansion rate of the face data of 100 persons by angle and face zone were obtained, and the face angle was estimated by calculating the distance between the middle of the forehead and the tail of the eye. As a result, very improved recognition performance was obtained at 30 degrees of rotated face angle.

• 산업기술연구
• /
• 제20권B호
• /
• pp.219-226
• /
• 2000

In this paper, we propose a new novel method for similarity search that supports time warping. Our primary goal is to innovate on search performance in large databases without false dismissal. To attain this goal, we devise a new distance function $D_{tw-lb}$ that consistently underestimates the time warping distance and also satisfies the triangular inequality. $D_{tw-lb}$ uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping. For efficient processing, we employ a multidimensional index that uses the 4-tuple feature vector as indexing attributes and $D_{tw-lb}$ as a distance function. We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments. The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1550-1552
• /
• 2005

In this paper, we have designed a Fingerprint Recognition System based on the Embedded LINUX. The fingerprint is captured using the AS-S2 semiconductor sensor. To extract a feature vector we transform the image of the fingerprint into a column vector. The image is row-wise filtered with the low-pass filter of the Haar wavelet. The feature vectors of the different fingerprints are compared by computing with the probabilistic neural network the distance between the target feature vector and the stored feature vectors in advance. The system implemented consists of a server PC based on the LINUX and a client based on the Embedded LINUX. The client is a Tynux box-x board using a PXA-255 CPU. The algorithm is simple and fast in computing and comparing the fingerprints.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.204-206
• /
• 2005

In this paper, we have designed a Fingerprint Recognition System based on the Embedded LINUX. The fingerprint is captured using the AS-S2 semiconductor sensor. To extract a feature vector we transform the image of t10he fingerprint into a column vector. The image is row-wise filtered with the low-pass filter of the Haar wavelet. The feature vectors of the different fingerprints are compared by computing with the probabilistic neural network the distance between the target feature vector and the stored feature vectors in advance. The system implemented consists of a server PC based on the LINUX and a client based on the Embedded LINUX. The client is a Tynux box-x board using a PXA-255 CPU. The algorithm is simple and fast in computing and comparing the fingerprints.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.403-404
• /
• 2006

In this paper, we proposed muli-dimensional feature vector matching method combined with disparity smoothness constraint. The smoothness constraint was calculated using the difference between disparity of center pixel and those of 4-neighbor pixels. By applying proposed algorithm to IKONOS satellite stereo imagery, we obtained robust stereo matching result in urban areas.

• 전기학회논문지
• /
• 제63권5호
• /
• pp.696-702
• /
• 2014

Recently, researches on analyzing relationship between the state of emotion and musical stimuli using EEG are increasing. A selection of feature vectors is very important for the performance of EEG pattern classifiers. This paper proposes a comparison of EEG feature vectors for emotion classification according to music listening. For this, we extract some feature vectors like DAMV, IAV, LPC, LPCC from EEG signals in each class related to music listening and compare a separability of the extracted feature vectors using Bhattacharyya distance. So more effective feature vectors are recommended for emotion classification according to music listening.

• 한국해양공학회지
• /
• 제22권1호
• /
• pp.30-36
• /
• 2008

Underwater ambient noise originating from geophysical, biological, and man-made acoustic sources contains information on the source and the ocean environment. Such noise affectsthe performance of sonar equipment. In this paper, three steps are used to identify the ambient noise source, detection, feature extraction, and similarity measurement. First, we use the zero-crossing rate to detect the ambient noisesource from background noise. Then, a set of feature vectors is proposed forthe ambient noise source using the Hilbert-Huang transform and the Karhunen-Loeve transform. Finally, the Euclidean distance is used to measure the similarity between the standard feature vector and the feature vector of the unknown ambient noise source. The developed algorithm is applied to the observed ocean data, and the results are presented and discussed.

• 한국멀티미디어학회논문지
• /
• 제10권7호
• /
• pp.923-933
• /
• 2007

본 논문에서는 SVM(Support Vector Machine)과 LDA(Linear Discriminant Analysis)를 이용하여 사각형 형태 마커 검출 및 인식의 성능을 향상시키는 방법을 제안한다. 본 논문의 방법에서는 사각형 형태의 마커 검출을 위하여 입력 영상을 이진 영상으로 변환하고 객체들의 윤곽선을 추출한 다음에 윤곽선을 선분으로 근사화 한다. 근사화된 선분으로부터 기하학적 특징을 이용하여 사각형을 찾는다. 마커의 사각형 영역을 찾은 다음에는 워핑 기법과 확대/축소 변환을 이용하여 사각형 영상을 정사각형 형태로 정규화한다. 정사각형 형태로 정규화한 다음에는 주성분 분석을 적용하여 특징 벡터의 크기를 줄인 다음에 SVM을 이용하여 마커 영상인지 아닌지를 검사한다. 마커 영상으로 판별된 영상에 대하여 LDA를 적용하여 특징 벡터의 크기를 더 줄이고 표준 마커에 대한 특징 벡터와의 최소 거리법에 의해 마커의 종류를 인식한다. 인식 실험 결과 SVM을 사용함으로써 마커 검출의 오류를 줄일 수 있었고 LDA를 사용함으로써 특징 벡터의 크기는 줄어들고 인식률이 높아짐을 알 수 있었다.

• 한국멀티미디어학회논문지
• /
• 제8권4호
• /
• pp.461-472
• /
• 2005

본 논문에서는 스테레오 영상의 정합값(matching)을 통한 얼굴 특징추출 알고리즘을 제안한다. 제안된 알고리즘에서는 얼굴색상 정보의 RGB컬러공간을 YCbCr컬러공간으로 변환하여 얼굴영역 검출하였다. 추출된 얼굴영역으로부터 눈 형판(template)을 적용하여 눈 사이의 거리와 기울어짐, 코와 입에 대한 특징의 기하학적인 특징 벡터를 추출하였다. 또한 제안한 방법은 2차원 특징정보 뿐만 아니라 스테레오 영상의 정합을 통한 얼굴의 눈, 코, 입의 특징을 추출할 수 있었다. 실험을 통하여 약 1m이내 거리에서 73%의 일치율을 보였고, 약 1m이후 거리에선 52%의 일치율을 보였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2010년도 춘계학술발표대회
• /
• pp.405-408
• /
• 2010

This paper presents a new feature extraction technique, correlation coefficient and Manhattan distance (MD) based method for recognition of rotated object in an image. This paper also represented a new concept of intensity invariant. We extracted global features of an image and converts a large size image into a one-dimensional vector called circular feature vector's (CFVs). An especial advantage of the proposed technique is that the extracted features are same even if original image is rotated with rotation angles 1 to 360 or rotated. The proposed technique is based on fuzzy sets and finally we have recognized the object by using histogram matching, correlation coefficient and manhattan distance of the objects. The proposed approach is very easy in implementation and it has implemented in Matlab7 on Windows XP. The experimental results have demonstrated that the proposed approach performs successfully on a variety of small as well as large scale rotated images.