• Bulletin of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.457-464
• /
• 2004

Let X be a Banach space and Z a closed subspace of a Banach space Y. Denote by Ｌ(X, Y) the space of all bounded linear operators from X to Y and by Ｋ(X, Y) its subspace of compact linear operators. Using Hahn-Banach extension operators corresponding to ideal projections, we prove that if either $X^{**}$ or $Y^{*}$ has the Radon-Nikodym property and Ｋ(X, Y) is an M-ideal (resp. an HB-subspace) in Ｌ(X, Y), then Ｋ(X, Z) is also an M-ideal (resp. HB-subspace) in Ｌ(X, Z). If Ｌ(X, Y) has property SU instead of being an M-ideal in Ｌ(X, Y) in the above, then Ｋ(X, Z) also has property SU in Ｌ(X, Z). If X is a Banach space such that $X^{*}$ has the metric compact approximation property with adjoint operators, then M-ideal (resp. HB-subspace) property of Ｋ(X, Y) in Ｌ(X, Y) is inherited to Ｋ(X, Z) in Ｌ(X, Z).

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.5
• /
• pp.490-496
• /
• 2020

We present a method to improve the performance of the multi-channel Wiener filter in noisy environment. To build subspace-based multi-channel Wiener filter, in the case of single target source, the target speech component can be effectively estimated in the principal subspace of speech correlation matrix. The speech correlation matrix can be estimated by subtracting noise correlation matrix from signal correlation matrix based on the assumption that the cross-correlation between speech and interfering noise is negligible compared with speech correlation. However, this assumption is not valid in the presence of strong interfering noise and significant error can be induced in the principal subspace accordingly. In this paper, we propose to adjust the principal subspace vector using speech presence probability and the steering vector for the desired speech source. The multi-channel speech presence probability is derived in the principal subspace and applied to adjust the principal subspace vector. Simulation results show that the proposed method improves the performance of multi-channel Wiener filter in noisy environment.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.2
• /
• pp.131-137
• /
• 2013

In this paper we propose an improved voice activity detection (VAD) algorithm using statistical models in the signal subspace domain. A uncorrelated signal subspace is generated using embedded prewhitening technique and the statistical characteristics of the noisy speech and noise are investigated in this domain. According to the characteristics of the signals in the signal subspace, a new statistical VAD method using GGD (Generalized Gaussian Distribution) is proposed. Experimental results show that the proposed GGD-based approach outperforms the Gaussian-based signal subspace method at 0-15 dB SNR simulation conditions.

• 전자공학회논문지 IE
• /
• v.48 no.1
• /
• pp.7-15
• /
• 2011

In this paper, we propose a correlation-based subspace estimation technique, which is called square-root forward/backward correlation-based projection approximation subspace tracking(SRFB-COPAST). The SRFB-COPAST utilizes the forward and backward correlation matrix as well as square-root recursive matrix update in projection approximation approach to develop the subspace tracking algorithm. With the projection approximation, the square-root recursive FB-COPAST is presented. The proposed algorithm has the better performance than the recently developed COPAST method.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.698-701
• /
• 2002

Subspace analysis (which includes PCA) seeks for feature subspace (which corresponds to the eigenspace), given multivariate input data and has been widely used in computer vision and pattern recognition. Typically data space belongs to very high dimension, but only a few principal components need to be extracted. In this paper I present a fast sequential algorithm for subspace analysis or tracking. Useful behavior of the algorithm is confirmed by numerical experiments.

• Communications of the Korean Mathematical Society
• /
• v.22 no.3
• /
• pp.383-389
• /
• 2007

In this paper we examine the hyperinvariant subspace problem for quasi-n-hyponormal operators. The main result on this problem is as follows. If T = N + K is such that N is a quasi-n-hyponormal operator whose spectrum contains an exposed arc and K belongs to the Schatten p-ideal then T has a non-trivial hyperinvariant subspace.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.162-170
• /
• 2010

Adaptive arrays reject interferences while preserving the desired signal, exploiting a priori information on its arrival angle. Subspace-based adaptive arrays, which adjust their weight vectors in the signal subspace, have the advantages of fast convergence and robustness to steering vector errors, as compared with the ones in the full dimensional space. However, the complexity of theses subspace-based methods is high because the eigendecomposition of the covariance matrix is required. In this paper, we present a simple subspace-based method based on the PASTd (projection approximation subspace tracking with deflation). The orignal PASTd algorithm is modified such that eigenvectora are orthogonal to each other. The proposed method allows us to significantly reduce the computational complexity, substantially having the same performance as the beamformer with the direct eigendecomposition. In addition to the simple beamforming method, we present theoretical analyses on the SINR (signal-to-interference plus noise ratio) of subspace beamformers to see their behaviors.

• Journal of Biomedical Engineering Research
• /
• v.31 no.6
• /
• pp.456-463
• /
• 2010

In the present study, we proposed a new subspace scanning algorithm to enhance the spatial resolution of electroencephalography (EEG) and magnetoencephalography(MEG) source localization. Subspace scanning algorithms, represented by the multiple signal classification (MUSIC) algorithm and the first principal vector (FINE) algorithm, have been widely used to localize asynchronous multiple dipolar sources in human cerebral cortex. The conventional MUSIC algorithm used principal component analysis (PCA) to extract the noise vector subspace, thereby having difficulty in discriminating two or more closely-spaced cortical sources. The FINE algorithm addressed the problem by using only a part of the noise vector subspace, but there was no golden rule to determine the number of noise vectors. In the present work, we estimated a non-orthogonal signal vector set using independent component analysis (ICA) instead of using PCA and performed the source scanning process in the signal vector subspace, not in the noise vector subspace. Realistic 2D and 3D computer simulations, which compared the spatial resolutions of various algorithms under different noise levels, showed that the proposed ICA-MUSIC algorithm has the highest spatial resolution, suggesting that it can be a useful tool for practical EEG/MEG source localization.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.7
• /
• pp.139-148
• /
• 2012

An ensemble of classifiers is to employ a set of individually trained classifiers and combine their predictions. It has been found that in most cases the ensembles produce more accurate predictions than the base classifiers. Combining outputs from multiple classifiers, known as ensemble learning, is one of the standard and most important techniques for improving classification accuracy in machine learning. An ensemble of classifiers is efficient only if the individual classifiers make decisions as diverse as possible. Bagging is the most popular method of ensemble learning to generate a diverse set of classifiers. Diversity in bagging is obtained by using different training sets. The different training data subsets are randomly drawn with replacement from the entire training dataset. The random subspace method is an ensemble construction technique using different attribute subsets. In the random subspace, the training dataset is also modified as in bagging. However, this modification is performed in the feature space. Bagging and random subspace are quite well known and popular ensemble algorithms. However, few studies have dealt with the integration of bagging and random subspace using SVM Classifiers, though there is a great potential for useful applications in this area. The focus of this paper is to propose methods for improving SVM performance using hybrid ensemble strategy for bankruptcy prediction. This paper applies the proposed ensemble model to the bankruptcy prediction problem using a real data set from Korean companies.

• Journal of Advanced Navigation Technology
• /
• v.26 no.3
• /
• pp.166-171
• /
• 2022

In this paper, we propose an algorithm to improve DoA(direction of arrival) estimation performance of the subspace-based method by generating high robustness correlation matrix of the signals incident on the uniformly linear array antenna. The existing subspace-based DoA estimation method estimates the DoA by obtaining a correlation matrix and dividing it into a signal subspace and a noise subspace. However, the component of the correlation matrix obtained from the low SNR and small number of snapshots inaccurately estimates the signal subspace due to the noise component of the antenna, thereby degrading the DoA estimation performance. Therefore a robust correlation matrix is generated by arranging virtual signal vectors obtained from the existing correlation matrix in a sliding manner. As a result of simulation using MUSIC and ESPRIT, which are representative subspace-based methods,, the computational complexity increased by less than 2.5% compared to the existing correlation matrix, but both MUSIC and ESPRIT based on RMSE 1° showed superior DoA estimation performance with an SNR of 3dB or more.