• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.468-488
• /
• 2016

The paper proposes a novel framework for 3D face verification using dimensionality reduction based on highly distinctive local features in the presence of illumination and expression variations. The histograms of efficient local descriptors are used to represent distinctively the facial images. For this purpose, different local descriptors are evaluated, Local Binary Patterns (LBP), Three-Patch Local Binary Patterns (TPLBP), Four-Patch Local Binary Patterns (FPLBP), Binarized Statistical Image Features (BSIF) and Local Phase Quantization (LPQ). Furthermore, experiments on the combinations of the four local descriptors at feature level using simply histograms concatenation are provided. The performance of the proposed approach is evaluated with different dimensionality reduction algorithms: Principal Component Analysis (PCA), Orthogonal Locality Preserving Projection (OLPP) and the combined PCA+EFM (Enhanced Fisher linear discriminate Model). Finally, multi-class Support Vector Machine (SVM) is used as a classifier to carry out the verification between imposters and customers. The proposed method has been tested on CASIA-3D face database and the experimental results show that our method achieves a high verification performance.

• Journal of Intelligence and Information Systems
• /
• v.10 no.3
• /
• pp.105-114
• /
• 2004

In the past year, the increasing concern about the biometric recognition makes the great activities on the security fields, such as the entrance control or user authentication. In particular, although the features of face recognition, such as user friendly and non-contact made it to be used widely, unhappily it has some disadvantages of low accuracy or low Re-attempts Rates. For this reason, I suggest the new approach to re-classify the classified data of recognition result data to solve the problems. For this study, I will use the typical appearance-based, PCA(Principal Component Analysis) algorithm and verify the performance improvement by adopting the re-classification approach using 200 peoples (10 pictures per one person).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3594-3607
• /
• 2017

The traditional feature extraction methods such as principal component analysis (PCA) cannot obtain the local structure of the samples, and locally linear embedding (LLE) cannot obtain the global structure of the samples. However, a common drawback of existing PCA and LLE algorithm is that they cannot deal well with the sparse problem of the samples. Therefore, by integrating the globality of PCA and the locality of LLE with a sparse constraint, we developed an improved and unsupervised difference algorithm called Sparse Difference Embedding (SDE), for dimensionality reduction of high-dimensional data in small sample size problems. Significantly differing from the existing PCA and LLE algorithms, SDE seeks to find a set of perfect projections that can not only impact the locality of intraclass and maximize the globality of interclass, but can also simultaneously use the Lasso regression to obtain a sparse transformation matrix. This characteristic makes SDE more intuitive and more powerful than PCA and LLE. At last, the proposed algorithm was estimated through experiments using the Yale and AR face image databases and the USPS handwriting digital databases. The experimental results show that SDE outperforms PCA LLE and UDP attributed to its sparse discriminating characteristics, which also indicates that the SDE is an effective method for face recognition.

• Journal of the Korean Wood Science and Technology
• /
• v.16 no.4
• /
• pp.61-69
• /
• 1988

Recently the automization of wood manufacturing and the development of CNC machine tools becomes the center of interest. Cutting mechanism, tool wear and the roughness of machined surface have been studied. In the studies about wood for special uses, concrete data of cutting is desired. While Pinus densiflora is characterized that heartwood develops as age increases, Chunyang District has the characteristic of strength, red color, relatively regular chap and high heartwood - percentage. But there is no data about cutting this wood, Chunyang District. In this study face milling by sintered carbide tool was excuted to Chunyang District. Cutting force, Surface roughness and states were investigated with regard to cutting speed. Example results were as follows; 1) Mean cutting resistance against lateral component force and longitudinal component force decreased rapidly up to cutting speed of 155 m/min, and remains constant above this speed. 2) The surface roughness of cutting surface lowered as cutting speed increased, regardless of fiber formation. Radial rougness of fiber is larger than lineal surface roughness. 3) Increase in Cutting speed made machining mark restrained. Down-milling showed larger marks than up-milling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.8
• /
• pp.2230-2252
• /
• 2024

Advances in deep learning technology have enabled the generation of more realistic deepfakes, which not only endanger individuals' identities but also exploit vulnerabilities in face recognition systems. The majority of existing deepfake detection methods have primarily focused on RGB-based analysis, offering unreliable performance in terms of detection accuracy and time. To address the issue, a grayscale-based deepfake detection method has recently been proposed. This method significantly reduces detection time while providing comparable accuracy to RGB-based methods. However, despite its significant effectiveness, the "key components" that directly affect the performance of grayscale-based deepfake detection have not been systematically analyzed. In this paper, we target three key components: RGB-to-grayscale conversion method, brightness level in grayscale, and resolution level in grayscale. To analyze their impacts on the performance of grayscale-based deepfake detection, we conducted comprehensive evaluations, including component-wise analysis and comparative analysis using real-world datasets. For each key component, we quantitatively analyzed its characteristics' performance and identified differences between them. Moreover, we successfully verified the effectiveness of an optimal combination of the key components by comparing it with existing deepfake detection methods.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.1
• /
• pp.7-15
• /
• 2009

In this paper, a novel framework that synthesizes and clones facial expression in parameter spaces is presented. To overcome the difficulties in manipulating face geometry models with high degrees of freedom, many parameterization methods have been introduced. In this paper, a data-driven parameterization method is proposed that represents a variety of expressions with a small set of fundamental independent movements based on the ICA technique. The face deformation due to the parameters is also learned from the data to capture the nonlinearity of facial movements. With this parameterization, one can control the expression of an animated character's face by the parameters. By separating the parameterization and the deformation learning process, we believe that we can adopt this framework for a variety applications including expression synthesis and cloning. The experimental result demonstrates the efficient production of realistic expressions using the proposed method.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.504-511
• /
• 2010

In this paper, we propose the face region recognition system for City-Security CCTV(Closed Circuit Television) using hippocampal neural network which is modelling of human brain's hippocampus. This system is composed of feature extraction, learning and recognition part. The feature extraction part is constructed using PCA(Principal Component Analysis) and LDA(Linear Discriminants Analysis). In the learning part, it can label the features of the image-data which are inputted according to the order of hippocampal neuron structure to reaction-pattern according to the adjustment of a good impression in a dentate gyrus and remove the noise through the auto-associative memory in the CA3 region. In the CA1 region receiving the information of the CA3, it can make long-term memory learned by neuron. Experiments confirm the each recognition rate, that are shape change and light change. The experimental results show that we can compare a feature extraction and learning method proposed in this paper of any other methods, and we can confirm that the proposed method is superior to existing methods.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.808-816
• /
• 2004

This paper proposes the method of implementation of practical online face verification system based on multiple feature combination and a similarity space. The main issue in face verification is to deal with the variability in appearance. It seems difficult to solve this issue by using a single feature. Therefore, combination of mutually complementary features is necessary to cope with various changes in appearance. From this point of view, we describe the feature extraction approaches based on multiple principal component analysis and edge distribution. These features are projected on a new intra-person/extra-person similarity space that consists of several simple similarity measures, and are finally evaluated by a support vector machine. From the experiments on a realistic and large database, an equal error rate of 0.029 is achieved, which is a sufficiently practical level for many real- world applications.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.149-156
• /
• 2003

This paper proposes a face recognition method based on modified Otsu binarization, Hu moment and linear discriminant analysis (LDA). Proposed method is robust to brightness, contrast, scale, rotation, and translation changes. Modified Otsu binarization can make binary images that have the invariant characteristic in brightness and contrast changes. From edge and multi-level binary images obtained by the threshold method, we compute the 17 dimensional Hu moment and then extract feature vector using LDA algorithm. Especially, our face recognition system is robust to scale, rotation, and translation changes because of using Hu moment. Experimental results showed that our method had almost a superior performance compared with the conventional well-known principal component analysis (PCA) and the method combined PCA and LDA in the perspective of brightness, contrast, scale, rotation, and translation changes with Olivetti Research Laboratory (ORL) database and the AR database.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.3 s.303
• /
• pp.63-72
• /
• 2005

In this paper, we propose a deformation technique based on Radial Basis Function (RBF) and a blending technique combining the deformed facial component with the original face for a Virtual Aesthetic Surgery (VAS) system. The deformation technique needs the smoothness and the accuracy to deform the fluid facial components and also needs the locality not to affect or distort the rest of the facial components besides the deformation region. To satisfy these deformation characteristics, The VAS System computes the degree of deformation of lattice cells using RBF based on a Free-Form Deformation (FFD) model. The deformation error is compensated by the coefficients of mapping function, which is recursively solved by the Singular Value Decomposition (SVD) technique using SSE (Sum of Squared Error) between the deformed control points and target control points on base curves. The deformed facial component is blended with an original face using a blending ratio that is computed by the Euclidean distance transform. An experimental result shows that the proposed deformation and blending techniques are very efficient in terms of accuracy and distortion.