• Journal of International Society for Simulation Surgery
• /
• 제2권2호
• /
• pp.64-66
• /
• 2015

Purpose : In this paper we proposed cascade feature filter and projection method for rapid human face recognition for the large-scale high-dimensional face database. Materials and Methods : The relevant features are selected from the large feature set using Fast Correlation-Based Filter method. After feature selection, project them into discriminant using Principal Component Analysis or Linear Discriminant Analysis. Their cascade method reduces the time-complexity without significant degradation of the performance. Results : In our experiments, the ORL database and the extended Yale face database b were used for evaluation. On the ORL database, the processing time was approximately 30-times faster than typical approach with recognition rate 94.22% and on the extended Yale face database b, the processing time was approximately 300-times faster than typical approach with recognition rate 98.74 %. Conclusion : The recognition rate and time-complexity of the proposed method is suitable for real-time face recognition system on the large-scale high-dimensional face database.

• 한국멀티미디어학회논문지
• /
• 제24권5호
• /
• pp.701-708
• /
• 2021

As one of the most widely used technology in the world right now, Face recognition has already received widespread attention by all the researcher and institutes. It has been used in many fields such as safety protection, surveillance system, crime control and even in our ordinary life such as home security and so on. This technology with today's technology has advantages such as high connectivity and real time transformation. But we still need to improve its recognition rate, reaction time and also reduce impact of different environmental status to the whole system. So in this paper we proposed a face recognition system model with improved CNN which combining the characteristics of flat network and residual network, integrated learning, simplify network structure and enhance portability and also improve the recognition accuracy. We also used AR and ORL database to do the experiment and result shows higher recognition rate, efficiency and robustness for different image conditions.

• 한국산학기술학회논문지
• /
• 제6권3호
• /
• pp.249-254
• /
• 2005

본 논문은 얼굴인식에서 사용되고 있는 PCA/LDA 방식의 유사도 측정 방식에 따른 인식 성능을 비교 분석하였다. 총 14가지의 거리 척도를 ORL 얼굴 데이터베이스에 적용하였으며, PCA와 PCA/LDA로 나누어 성능 비교를 하였다. PCA의 경우에는 맨하튼 거리, Weighted SSE 거리의 인식률이 좋지만, PCA/LDA인 경우에는 Angle-based 거리, Modified SSE거리에 대한 인식률이 좋음이 확인되었다. 또한 PCA보다 PCA/LDA의 경우 유사도 비교 차원의 수를 줄이면서 높은 인식률을 유지할 수 있어, PCA/LDA와 Angle-based 거리 척도를 적용하여 얼굴인식을 할 경우 계산의 경제성과 인식률에서 높은 경쟁력을 갖출 수 있다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.69-72
• /
• 2000

본 논문에서는 디지털 이미지 안에서의 얼굴 영상 분할을 위해서 데이터로부터 얼굴 영상과 배경 영상의 소속도(membership degree)를 학습시켜 구한다. 그리고 입력 이미지의 각 픽셀 값에 해당하는 소속도를 이용하여 얼굴 영상의 분할을 수행한다. 실험에서는 8-bit 그레이 스케일 영상의 ORL Database를 이용하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1824-1845
• /
• 2016

The GMM is a conventional approach which has been recently applied in many face recognition studies. However, the question about how to deal with illumination changes while ensuring high performance is still a challenge, especially with real-world databases. In this paper, we propose a Visual Observation Confidence (VOC) measure for robust face recognition for illumination changes. Our VOC value is a combined confidence value of three measurements: Flatness Measure (FM), Centrality Measure (CM), and Illumination Normality Measure (IM). While FM measures the discrimination ability of one face, IM represents the degree of illumination impact on that face. In addition, we introduce CM as a centrality measure to help FM to reduce some of the errors from unnecessary areas such as the hair, neck or background. The VOC then accompanies the feature vectors in the EM process to estimate the optimal models by modified-GMM training. In the experiments, we introduce a real-world database, called KoFace, besides applying some public databases such as the Yale and the ORL database. The KoFace database is composed of 106 face subjects under diverse illumination effects including shadows and highlights. The results show that our proposed approach gives a higher Face Recognition Rate (FRR) than the GMM baseline for indoor and outdoor datasets in the real-world KoFace database (94% and 85%, respectively) and in ORL, Yale databases (97% and 100% respectively).

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.800-803
• /
• 2006

본 논문에서는 여러 환경 변화에 민감한 특성을 가지고 있는 얼굴 인식의 성능 향상을 위해 혼합형 신경회로망 방식을 제안한다. 제안한 방식은 SOM과 LVQ를 이용하여 얼굴 인식의 성능을 향상시킨다. 제안한 방식의 유용성을 확인하기 위하여 ORL의 얼굴 영상을 이용하여 시뮬레이션을 수행하였다. 시뮬레이션 결과 제안한 방식이 고유얼굴 방식이나 은닉 마코프 모델 방식, 다층 신경회로망 방식보다 우수함을 확인하였다.

• 정보보호학회논문지
• /
• 제16권5호
• /
• pp.119-123
• /
• 2006

본 논문에서는 얼굴인식에 널리 사용되는 고유얼굴(eigenfaces)을 이용한 방법에서 고유얼굴들을 고유치(eigenvalues)의 크기에 따라 사용하는 기존의 방식과는 달리, 개인별로 인식에 사용될 고유얼굴들을 선택하여 인식하는 방법을 제안한다. YALE, ORL(Olivetti Research Laboratory) 데이터베이스에 대하여, 기존의 방법과 제안한 방법에 의한 선택에 따른 고유얼굴들을 사용한 경우를 비교 실험하였다. 실험결과, 개인별로 선택된 고유얼굴들에 의한 특징벡터를 이용한 인식이 더 우수한 성능을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.2991-3007
• /
• 2022

Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2004-2007
• /
• 2003

This paper describes a method of performance enhancement using Flatness Mesure(FM) for the Gaussian Mixture Model(GMM) face recognition systems. Using this measure we discard the frames having low information before training and test. As the result, the performance increases about 9％ in the lower mixtures and calculation burden is decreased. As well, the recognition error rate is decreased under the illumination change surroundings. We use the 2D DCT coefficients lot face feature vectors and experiments are carried out on the Olivetti Research Laboratory (ORL) face database.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 춘계종합학술대회
• /
• pp.597-600
• /
• 2007

얼굴은 개인의 신원확인을 위하여 중요한 생체부분이다. 하지만 얼굴인식은 고차원적인 패턴인식의 문제이다. 저해상도 얼굴영상 조차도 대단히 큰 특징공간을 생성한다. 고유공간기반 얼굴인식은 고차원적인 패턴인식의 문제를 보다 낮은 차원으로 줄여서 얼굴인식을 하는 방법이다. 본 연구의 목적은 실시간 얼굴인식을 위하여 빠른 특징 추출방법을 제공하는 것이다. 먼저, 입력된 얼굴 영상에서 주성분분석을 수행하여 고유벡터와 고유값을 생성하고, 생성된 고유벡터의 특이점에 Gabor 필터를 적용하여 특징벡터를 구성한 후에 앞에서 구해진 고유값을 곱하여 특징을 추출하는 방법을 제안한다. 본 연구에서는 ORL 데이터베이스를 이용하여 실험하였다.