• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1042-1042
• /
• 2001

In linear discriminant analysis there are two important properties concerning the effectiveness of discriminant function modeling. The first is the separability of the discriminant function for different classes. The separability reaches its optimum by maximizing the ratio of between-class to within-class variance. The second is the stability of the discriminant function against noises present in the measurement variables. One can optimize the stability by exploring the discriminant variates in a principal variation subspace, i. e., the directions that account for a majority of the total variation of the data. An unstable discriminant function will exhibit inflated variance in the prediction of future unclassified objects, exposed to a significantly increased risk of erroneous prediction. Therefore, an ideal discriminant function should not only separate different classes with a minimum misclassification rate for the training set, but also possess a good stability such that the prediction variance for unclassified objects can be as small as possible. In other words, an optimal classifier should find a balance between the separability and the stability. This is of special significance for multivariate spectroscopy-based classification where multicollinearity always leads to discriminant directions located in low-spread subspaces. A new regularized discriminant analysis technique, the principal discriminant variate (PDV) method, has been developed for handling effectively multicollinear data commonly encountered in multivariate spectroscopy-based classification. The motivation behind this method is to seek a sequence of discriminant directions that not only optimize the separability between different classes, but also account for a maximized variation present in the data. Three different formulations for the PDV methods are suggested, and an effective computing procedure is proposed for a PDV method. Near-infrared (NIR) spectra of blood plasma samples from daily monitoring of two Japanese cows have been used to evaluate the behavior of the PDV method in comparison with principal component analysis (PCA), discriminant partial least squares (DPLS), soft independent modeling of class analogies (SIMCA) and Fisher linear discriminant analysis (FLDA). Results obtained demonstrate that the PDV method exhibits improved stability in prediction without significant loss of separability. The NIR spectra of blood plasma samples from two cows are clearly discriminated between by the PDV method. Moreover, the proposed method provides superior performance to PCA, DPLS, SIMCA md FLDA, indicating that PDV is a promising tool in discriminant analysis of spectra-characterized samples with only small compositional difference.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.71-81
• /
• 2010

The problem of finding clusters is widely used in numerous applications, such as pattern recognition, image analysis, market analysis. The important factors that decide cluster quality are the similarity measure and the number of attributes. Similarity measures should be defined with respect to the data types. Existing similarity measures are well applicable to numerical attribute values. However, those measures do not work well when the data is described by categorical attributes, that is, when no inherent similarity measure between values. In high dimensional spaces, conventional clustering algorithms tend to break down because of sparsity of data points. To overcome this difficulty, a subspace clustering approach has been proposed. It is based on the observation that different clusters may exist in different subspaces. In this paper, we propose a new similarity measure for clustering of high dimensional categorical data. The measure is defined based on the fact that a good clustering is one where each cluster should have certain information that can distinguish it with other clusters. We also try to capture on the attribute dependencies. This study is meaningful because there has been no method to use both of them. Experimental results on real datasets show clusters obtained by our proposed similarity measure are good enough with respect to clustering accuracy.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.519-527
• /
• 2003

Speech is much influenced by the existence of outliers which are introduced by such an unexpected happenings as additive background noise, change of speaker's utterance pattern and voice detection errors. These kinds of outliers may result in severe degradation of speaker recognition performance. In this paper, we proposed the GMM based on robust principal component analysis (RPCA-GMM) using M-estimation to solve the problems of both ouliers and high dimensionality of training feature vectors in speaker identification. Firstly, a new feature vector with reduced dimension is obtained by robust PCA obtained from M-estimation. The robust PCA transforms the original dimensional feature vector onto the reduced dimensional linear subspace that is spanned by the leading eigenvectors of the covariance matrix of feature vector. Secondly, the GMM with diagonal covariance matrix is obtained from these transformed feature vectors. We peformed speaker identification experiments to show the effectiveness of the proposed method. We compared the proposed method (RPCA-GMM) with transformed feature vectors to the PCA and the conventional GMM with diagonal matrix. Whenever the portion of outliers increases by every 2%, the proposed method maintains almost same speaker identification rate with 0.03% of little degradation, while the conventional GMM and the PCA shows much degradation of that by 0.65% and 0.55%, respectively This means that our method is more robust to the existence of outlier.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.62-71
• /
• 2013

The passive emitter location method using TDOA and FDOA measurements has higher accuracy comparing to the single TDOA or FDOA based method. Moreover, it is able to estimate the velocity vector of a moving platform. Recently, several non-iterative methods were suggested using the nuisance parameter but the common reference sensor is needed for each pair of sensors. They show also relatively low performance in the case of a long range between the sensor groups and the emitter. To solve this, we derive the estimation method of the position and velocity of a moving platform based on the Gauss-Newton method. In addition, to analyze the estimation performance of the position and velocity, respectively, we decompose the CRLB matrix into each subspace. Simulation results show the estimation performance of the derived method and the CEP planes according to the given geometry of the sensors.

• Geophysics and Geophysical Exploration
• /
• v.7 no.2
• /
• pp.148-154
• /
• 2004

This article reviews the development of three-dimensional (3-D) magnetotelluric (MT) modeling. The 3-D modeling of electromagnetic fields is essential in understanding the physics of MT soundings, and in implementing an inversion method to reconstruct a 3-D resistivity image. Although various numerical schemes have been developed over the last two decades, practical methods have been quite limited. However, the recent rapid improvement in computer speed and memory, as well as the advance in iterative solution algorithms for a large system of equations, makes it possible to model the MT responses of complex 3-D structures, which have been very difficult to simulate before. The use of staggered grids in finite difference method has become popular, conserving a magnetic flux and an electric current and allowing for realistic discontinuous fields. The convergence of numerical solutions has been greatly accelerated by adopting Krylov subspace methods, proper preconditioning techniques, and static divergence corrections. The vector finite-element method using edge elements is also free from the discontinuity problem, and seems a natural choice for modeling complex structures including irregular topography because its flexibility allows one to capture full geometric complexity.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.19-32
• /
• 2007

This paper present a new face recognition method based on LVQ neural net to construct a real time face recognition system. The previous researches which used PCA, LDA combined neural net usually need much time in training neural net. The supervised LVQ neural net needs much less time in training and can maximize the separability between the classes. In this paper, the proposed method transforms the input face image by PCA and LDA sequentially into low-dimension feature vectors and recognizes the face through LVQ neural net. In order to make the system robust to external light variation, light compensation is performed on the detected face by max-min normalization method as preprocessing. PCA and LDA transformations are applied to the normalized face image to produce low-level feature vectors of the image. In order to determine the initial centers of LVQ and speed up the convergency of the LVQ neural net, the K-Means clustering algorithm is adopted. Subsequently, the class representative vectors can be produced by LVQ2 training using initial center vectors. The face recognition is achieved by using the euclidean distance measure between the center vector of classes and the feature vector of input image. From the experiments, we can prove that the proposed method is more effective in the recognition ratio for the cases of still images from ORL database and sequential images rather than using conventional PCA of a hybrid method with PCA and LDA.

• Korean Journal of Remote Sensing
• /
• v.34 no.2_2
• /
• pp.313-326
• /
• 2018

This paper introduces core techniques on ship detection and tracking based on a compact HF radar platform which is necessary to establish a wide-area surveillance network. Currently, most HF radar sites are primarily optimized for observing sea surface radial velocities and bearings. Therefore, many ship detection systems are vulnerable to error sources such as environmental noise and clutter when they are applied to these practical surface current observation purpose systems. In addition, due to Korea's geographical features, only compact HF radars which generates non-uniform antenna response and has no information on target information are applicable. The ship detection and tracking techniques discussed in this paper considers these practical conditions and were evaluated by real data collected from the Yellow Sea, Korea. The proposed method is composed of two parts. In the first part, ship detection, a constant false alarm rate based detector was applied and was enhanced by a PCA subspace decomposition method which reduces noise. To merge multiple detections originated from a single target due to the Doppler effect during long CPIs, a clustering method was applied. Finally, data association framework eliminates false detections by considering ship maneuvering over time. According to evaluation results, it is claimed that the proposed method produces satisfactory results within certain ranges.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.27-36
• /
• 2004

Detection and recognition of human faces in images can be considered as an important aspect for applications that involve interaction between human and computer. In this paper, we propose a face recognition method using eigenfaces and fuzzy neural networks. The Principal Components Analysis (PCA) is one of the most successful technique that have been used to recognize faces in images. In this technique the eigenvectors (eigenfaces) and eigenvalues of an image is extracted from a covariance matrix which is constructed form image database. Face recognition is Performed by projecting an unknown image into the subspace spanned by the eigenfaces and by comparing its position in the face space with the positions of known indivisuals. Based on this technique, we propose a new algorithm for face recognition consisting of 5 steps including preprocessing, eigenfaces generation, design of fuzzy membership function, training of neural network, and recognition. First, each face image in the face database is preprocessed and eigenfaces are created. Fuzzy membership degrees are assigned to 135 eigenface weights, and these membership degrees are then inputted to a neural network to be trained. After training, the output value of the neural network is intupreted as the degree of face closeness to each face in the training database.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.325-336
• /
• 2020

Nonlinear Invariant Attack is an attack that should be considered when constructing lightweight block ciphers with relatively simple key schedule. A shortcut to prove a block cipher's resistance against nonlinear invariant attack is checking the smallest dimension of linear layer-invariant linear subspace which contains all known differences between round keys is equal to the block size. In this paper, we presents the following results. We identify the structure and number of optimal bit-permutations which require only one known difference between round keys for a designer to show that the corresponding block cipher is resistant against nonlinear invariant attack. Moreover, we show that PRESENT-like block ciphers need at least two known differences between round keys by checking all PRESENT-like bit-permutations. Additionally, we verify that the variants of PRESENT-like bit-permutations requiring the only two known differences between round keys do not conflict with the resistance against differential attack by comparing the best differential trails. Finally, through the distribution of the invariant factors of all bit-permutations that maintain BOGI logic with GIFT S-box, GIFT-variant block ciphers require at least 8 known differences between round keys for the resistance.

• The Journal of the Acoustical Society of Korea
• /
• v.41 no.3
• /
• pp.326-334
• /
• 2022

In this paper, we propose speech enhancement algorithm as a pre-processing for robust speech recognition in noisy environments. Auxiliary-function-based Independent Vector Analysis (AuxIVA) is performed with weighted covariance matrix using time-varying variances with scaling factor from target masks representing time-frequency contributions of target speech. The mask estimates can be obtained using Neural Network (NN) pre-trained for speech extraction or diffuseness using Coherence-to-Diffuse power Ratio (CDR) to find the direct sounds component of a target speech. In addition, outputs for omni-directional noise are closely chained by sharing the time-varying variances similarly to independent subspace analysis or IVA. The speech extraction method based on AuxIVA is also performed in Independent Low-Rank Matrix Analysis (ILRMA) framework by extending the Non-negative Matrix Factorization (NMF) for noise outputs to Non-negative Tensor Factorization (NTF) to maintain the inter-channel dependency in noise output channels. Experimental results on the CHiME-4 datasets demonstrate the effectiveness of the presented algorithms.