• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2355-2358
• /
• 2003

The purpose of this paper is to investigate two major feature extraction techniques based on generic modular face recognition system. Detailed algorithms are described for principal component analysis (PCA) and independent component analysis (ICA). PCA and ICA ate statistical techniques for feature extraction and their incorporation into a face recognition system requires numerous design decisions. We explicitly state the design decisions by introducing a modular-based face recognition system since some of these decision are not documented in the literature. We explored different implementations of each module, and evaluate the statistical feature extraction algorithms based on the FERET performance evaluation protocol (the de facto standard method for evaluating face recognition algorithms). In this paper, we perform two experiments. In the first experiment, we report performance results on the FERET database based on PCA. In the second experiment, we examine performance variations based on ICA feature extraction algorithm. The experimental results are reported using four different categories of image sets including front, lighting, and duplicate images.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.398-400
• /
• 2019

Faced with the increasing demand for image recognition on mobile devices, how to run convolutional neural network (CNN) models on mobile devices with limited computing power and limited storage resources encourages people to study efficient model design. In recent years, many effective architectures have been proposed, such as mobilenet_v1, mobilenet_v2 and PeleeNet. However, in the process of feature selection, all these models neglect some information of shallow features, which reduces the capture of shallow feature location and semantics. In this study, we propose an effective framework based on Feature Pyramid Networks to improve the recognition accuracy of deep and shallow images while guaranteeing the recognition speed of PeleeNet structured images. Compared with PeleeNet, the accuracy of structure recognition on CIFA-10 data set increased by 4.0%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.9
• /
• pp.84-93
• /
• 1993

Recently, several nonlinear shape normalization methods have been proposed in order to compensate for the shape distortions in handwritten characters. In this paper, we review these nonlinear shape normalization methods from the two points of view : feature projection and feature density equalization. The former makes feature projection histogram by projecting a certain feature at each point of input image into horizontal-or vertical-axis and the latter equalizes the feature densities of input image by re-sampling the feature projection histogram. A systematic comparison of these methods has been made based on the following criteria: recognition rate, processing speed, computational complexity and measure of variation. Then, we present the result of quantitative evaluation of each method based on these criteria for a large variety of handwritten Hangul syllables.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.402-410
• /
• 2017

For many years, researchers in face description area have been representing and recognizing faces based on different methods that include subspace discriminant analysis, statistical learning and non-statistics based approach etc. But still automatic face recognition remains an interesting but challenging problem. This paper presents a novel and efficient face image representation method based on Optimized Local Ternary Pattern (OLTP) texture features. The face image is divided into several regions from which the OLTP texture feature distributions are extracted and concatenated into a feature vector that can act as face descriptor. The recognition is performed using nearest neighbor classification method with Chi-square distance as a similarity measure. Extensive experimental results on Yale B, ORL and AR face databases show that OLTP consistently performs much better than other well recognized texture models for face recognition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2632-2649
• /
• 2012

Most approaches to human action recognition is limited due to the use of simple action datasets under controlled environments or focus on excessively localized features without sufficiently exploring the spatio-temporal information. This paper proposed a framework for recognizing realistic human actions. Specifically, a new action representation is proposed based on computing a rich set of descriptors from keypoint trajectories. To obtain efficient and compact representations for actions, we develop a feature fusion method to combine spatial-temporal local motion descriptors by the movement of the camera which is detected by the distribution of spatio-temporal interest points in the clips. A new topic model called Markov Semantic Model is proposed for semantic feature selection which relies on the different kinds of dependencies between words produced by "syntactic " and "semantic" constraints. The informative features are selected collaboratively based on the different types of dependencies between words produced by short range and long range constraints. Building on the nonlinear SVMs, we validate this proposed hierarchical framework on several realistic action datasets.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• 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.

• Journal of Integrative Natural Science
• /
• v.1 no.2
• /
• pp.133-139
• /
• 2008

Face recognition technologies using PCA(principal component analysis) recognize faces by deciding representative features of faces in the model image, extracting feature vectors from faces in a image and measuring the distance between them and face representation. Given frequent recognition problems associated with the use of point-to-point distance approach, this study adopted the K-nearest neighbor technique(class-to-class) in which a group of face models of the same class is used as recognition unit for the images inputted on a continual input image. This paper proposes a new PCA recognition in which database of faces.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.425-434
• /
• 2011

The success of iris recognition depends mainly on two factors: image acquisition and an iris recognition algorithm. In this study, we present a system that considers both factors and focuses on the latter. The proposed algorithm aims to find out the most efficient wavelet family and its coefficients for encoding the iris template of the experiment samples. The algorithm implemented in software performs segmentation, normalization, feature encoding, data storage, and matching. By using the Haar and Biorthogonal wavelet families at various levels feature encoding is performed by decomposing the normalized iris image. The vertical coefficient is encoded into the iris template and is stored in the database. The performance of the system is evaluated by using the number of degrees of freedom, False Reject Rate (FRR), False Accept Rate (FAR), and Equal Error Rate (EER) and the metrics show that the proposed algorithm can be employed for an iris recognition system.

• Journal of Korea Multimedia Society
• /
• v.23 no.3
• /
• pp.412-420
• /
• 2020

This paper proposes a performance-improving face recognition system based on a super resolution method for low-resolution images. The conventional face recognition algorithm has a rapidly decreased accuracy rate due to small image resolution by a distance. To solve the previously mentioned problem, this paper generates a super resolution images based o deep learning method. The proposed method improved feature information from low-resolution images using a super resolution method and also applied face recognition using a feature extraction and an classifier. In experiments, the proposed method improves the face recognition rate when compared to conventional methods.

• Journal of Biomedical Engineering Research
• /
• v.19 no.3
• /
• pp.233-242
• /
• 1998

In anatomical aspects, magnetic resonance image offers more accurate information than other medical images such as X ray ultrasonic and CT images. This paper introduces a method that recognizes disk diseases from spine MR images. In this method, image enhancement, image segmentation and feature extraction for sagittal plane and axial plane images are performed to separate the disk region. And then template matching method is used to extract disease region for axial plane imges. Finally, disease feature vectors are integrated and disease discrimination processes are performed. Experimental results show that the proposed method discriminates between normal and diseased disk with a considerable recognition ratio.