• The Journal of the Korea Contents Association
• /
• v.10 no.8
• /
• pp.18-25
• /
• 2010

The study has proposed a method that simultaneously takes advantage of each projection matrix acquired by using column-directional two-dimensional PCA(C2DPCA) and row-directional two-dimensional LDA(R2DLDA). The proposed method can acquire a great secure recognition rate, with no relation to the number of training images, with acquired low-dimensional feature matrixes including both the horizontal and the vertical features of a face. Besides, in the alternate experiment of PCA and LDA to row-direction and column-direction respectively(C2DPCA & R2DLDA, C2DLDA & R2DPCA), we could make sure the system of 2 dimensional LDA with row-directional feature(C2DPCA & R2DLDA) obtain higher recognition rate with low dimension than opposite case. As a result of experimenting that, the proposed method has showed a greater recognition rate of 99.4% than the existing methods such as 2DPCA and 2DLDA, etc. Also, it was proved that its recognition processing is over three times as fast as that of 2DPCA or 2DLDA.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.217-218
• /
• 2007

Face recognition, recognizing the human faces, is one of the most important techniques for making intelligent robot that provide commendable services to human. In this paper, we make a comparative study of Original PCA, 2DPCA, 2DPCA based algorithms and LDA in robot environment. Database is obtained through the robot's camera in a laboratory what is made like home environment for experiment.. We consider distance state what can be generated in home environment for database.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.2
• /
• pp.83-92
• /
• 2018

Using ground moving target indicators equipped with synthetic aperture radars for locating moving targets within a wide background clutter in a short time is an excellent method for monitoring traffic. Although the displaced phase center antenna (DPCA) technique and along track interferometry (ATI) are real time methods with low computational complexity, they are essential for reducing cases of false alarm that can result in poor performance. In this paper, we propose two detection methods using DPCA and ATI-the parallel fusion method and serial fusion method. Simulation results demonstrate that the proposed detection methods are characterized by low probability of false alarm along with good performance. In particular, the serial fusion method possesses high detection probability along with low probability of false alarm (1/5th of the false alarm probability of the DPCA technique).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5474-5490
• /
• 2017

Although two-dimensional principal component analysis (2DPCA) has been shown to be successful in face recognition system, it is still very sensitive to illumination variations. To reduce the effect of these variations, texture-based techniques are used due to their robustness to these variations. In this paper, we explore several texture-based techniques and determine the most appropriate one to be used with 2DPCA-based techniques for face recognition. We also propose a new distance metric computation in 2DPCA called Row Assembled Matrix Distance (RowAMD). Experiments on Yale Face Database, Extended Yale Face Database B, AR Database and LFW Database reveal that the proposed RowAMD distance computation method outperforms other conventional distance metrics when Local Line Binary Pattern (LLBP) and Multi-scale Block Local Binary Pattern (MB-LBP) are used for face authentication and face identification, respectively. In addition to this, the results also demonstrate the robustness of the proposed RowAMD with several texture-based techniques.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.648-654
• /
• 2009

In this paper, a method called bilateral diagonal 2DLDA is proposed for face recognition. Two methods called Dia2DPCA and Dia2DLDA were suggested to reserve the correlations between the variations in the rows and columns of diagonal images. However, these methods work in the row direction of these images. A row-directional projection matrix can be obtained by calculating the between-class and within-class covariance matrices making an allowance for the column variation of alternative diagonal face images. In addition, column-directional projection matrix can be obtained by calculating the between-class and within-class covariance matrices making an allowance for the row variation in diagonal images. A bilateral projection scheme was applied using left and right multiplying projection matrices. As a result, the dimension of the feature matrix and computation time can be reduced. Experiments carried out on an ORL face database show that the proposed method with three different distance measures, namely, Frobenius, Yang and AMD, is more accurate than some methods, such as 2DPCA, B2DPCA, 2DLDA, etc.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.2
• /
• pp.139-146
• /
• 2017

A ground moving target's velocity estimation algorithm applicable for a SAR-GMTI system using 2 channel displaced phase center antenna(DPCA) is proposed. In this algorithm, we assume target's across-track velocity can be estimated by along-track interferometry (ATI) and present a method to estimate target's along-track velocity. To accomplish this method, we first transform a radar-target geometry in which a moving target has zero velocity via altering a radar velocity such that target's velocity is reflected into it and next manipulate the spectral centers of the subapertures within the synthetic aperture. The validity of the proposed algorithm is demonstrated through simulation results showing the performance of the target's velocity estimation and the enhancement of reconstructed target image quality in terms of resolution and SINR.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.103-108
• /
• 2022

In this paper, we propose a new image analysis method based on regression manifold 3-D PCA. The proposed method is a new image analysis method consisting of a regression analysis algorithm with a structure designed based on an autoencoder capable of nonlinear expansion of manifold 3-D PCA and PCA for efficient dimension reduction when entering large-capacity image data. With the configuration of an autoencoder, a regression manifold 3-DPCA, which derives the best hyperplane through three-dimensional rotation of image pixel values, and a Bayesian rule structure similar to a deep learning structure, are applied. Experiments are performed to verify performance. The image is improved by utilizing the fine dust image, and accuracy performance evaluation is performed through the classification model. As a result, it can be confirmed that it is effective for deep learning performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.5
• /
• pp.423-430
• /
• 2013

In typical face recognition systems, the frontal view of face is preferred to reduce the complexity of the recognition. Thus individuals may be required to stare into the camera, or the camera should be located so that the frontal images are acquired easily. However these constraints severely restrict the adoption of face recognition to wide applications. To alleviate this problem, in this paper, we address the problem of tracking and recognizing faces in video captured with no environmental control. The face tracker extracts a sequence of the angle/size normalized face images using IVT (Incremental Visual Tracking) algorithm that is known to be robust to changes in appearance. Since no constraints have been imposed between the face direction and the video camera, there will be various poses in face images. Thus the pose is identified using a PCA (Principal Component Analysis)-based pose classifier, and only the pose-matched face images are used to identify person against the pre-built face DB with 5-poses. For face recognition, PCA, (2D)PCA, and $(2D)^2PCA$ algorithms have been tested to compute the recognition rate and the execution time.