• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1407-1413
• /
• 1994

To obtain accurate target information in a radar system, clutter or interference signals must first be effectively removed for target detection. In this paper, the signal is projected onto a constrained orthogonal subspace, so that a minimum variance optimal detector is transformed into an unconstrained detector. The proposed algorithm is equivalent to the conventional optimal detector algorithm, and th algorithm structure shows that the Gram-Schmidt orthogonalization can be achieved to obtain the fast convergence. The performance of the proposed method was observed by simulation experiments.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.271-273
• /
• 2002

추천 시스템에서 사용되고 있는 중요한 방법인 협력적 여과는 유사한 사용자들에 기초하여 그 사용자들이 선호하는 아이템을 교차 추천을 해주는 방법이다. 사용자들에 대한 정보는 아이템을 평가한 등급에 기초하며, 그 평가 등급 패턴이 유사한 사용자를 찾게 된다. 협력적 여과는 사용자와 정보의 증가에 따라서 성능이 저하되는 문제점을 가지고 있다. 이러한 문제점을 해결하기 위하여 SVD, PCA, LSI와 같은 차원 감소 방법이 제시되어 왔으나, 이러한 방법은 계산 비용이 크다는 단점을 가지고 있다. 따라서, 계산 비용이 적고, 정확성에 있어서도 충분히 정확한 임시 사상이 최근에 주목을 받고 있다. 본 논문에서는 임의 사상을 이용한 차원 감소 방법이 협력적 여과에 미치는 효과를 실험을 통하여 제시한다. 실험적으로, 임의 사상 방법은 협력적 여과에서 충분히 정확한 성능을 보였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.4
• /
• pp.375-385
• /
• 2020

In this paper, a special indefinite inner product, named hyperbolic scalar product, is used and all acquired results have been raised and proved with the proviso that the space is equipped with this indefinite scalar product. The main objective is to be introduced and applied an indefinite oblique projection method, called Indefinite Lanczos J-biorthogonalizatiom process, which in addition to building a pair of J-biorthogonal bases for two used Krylov subspaces, leads to the introduction of a process for solving large non-J-symmetric linear systems, i.e., Indefinite two-sided Lanczos Algorithm for Linear systems.

• Bulletin of the Korean Chemical Society
• /
• v.6 no.5
• /
• pp.309-311
• /
• 1985

When a molecule is perturbed by an external field, the perturbed moecue can be described as a doubly perturbed system. Hartree-Fock operator in the absence of the field is the zeroth order Hamiltonian, and a correlation operator and the external field operator are perturbations. The effective Hamiltonian, which is a projection of the total Hamiltonian onto a small finite subspace (usually a valence space), has been formally derived. The influence of the external field to the molecular Hamiltonian itself has been examined within an effective Hamiltonian framework. The first order effective expectation values, for instance electromagnetic transition amplitudes, between valence states are found to be easily calculated - by simply taking matrix elements of the effective external field operator. Implications of the terms in perturbation expansion are discussed.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2179-2188
• /
• 2015

Recently, many researches have been done to solve the challenging problem of Blind Source Separation (BSS) problems in the underdetermined cases, and the “Two-step” method is widely used, which estimates the mixing matrix first and then extracts the sources. To estimate the mixing matrix, conventional algorithms such as Single-Source-Points (SSPs) detection only exploits the sparsity of original signals. This paper proposes a new underdetermined mixing matrix estimation method for time-delayed mixtures based on the receiver prior exploitation. The prior information is extracted from the specific structure of the complex-valued mixing matrix, which is used to derive a special criterion to determine the SSPs. Moreover, after selecting the SSPs, Agglomerative Hierarchical Clustering (AHC) is used to automaticly cluster, suppress, and estimate all the elements of mixing matrix. Finally, a convex-model based subspace method is applied for signal separation. Simulation results show that the proposed algorithm can estimate the mixing matrix and extract the original source signals with higher accuracy especially in low SNR environments, and does not need the number of sources before hand, which is more reliable in the real non-cooperative environment.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.1
• /
• pp.31-39
• /
• 2015

This paper deals with a method for estimating variance components on the basis of projections under the assumption of random effects model. It discusses how to use projections for getting sums of squares to estimate variance components. The use of projections makes the vector subspace generated by the model matrix to be decomposed into subspaces that are orthogonal each other. To partition the vector space by the model matrix stepwise procedure is used. It is shown that the suggested method is useful for obtaining Type I sum of squares requisite for the ANOVA method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1243-1263
• /
• 2018

The two-stage linear discrimination analysis (TSLDA) is a feature extraction technique to solve the small size sample problem in the field of image recognition. The TSLDA has retained all subspace information of the between-class scatter and within-class scatter. However, the feature information in the four subspaces may not be entirely beneficial for classification, and the regularization procedure for eliminating singular metrics in TSLDA has higher time complexity. In order to address these drawbacks, this paper proposes an improved two-stage linear discriminant analysis (Improved TSLDA). The Improved TSLDA proposes a selection and compression method to extract superior feature information from the four subspaces to constitute optimal projection space, where it defines a single Fisher criterion to measure the importance of single feature vector. Meanwhile, Improved TSLDA also applies an approximation matrix method to eliminate the singular matrices and reduce its time complexity. This paper presents comparative experiments on five face databases and one handwritten digit database to validate the effectiveness of the Improved TSLDA.

• The Korean Journal of Applied Statistics
• /
• v.23 no.5
• /
• pp.933-941
• /
• 2010

Biplot is a modern graphical methodology allowing for the projection of high-dimensional data to a low-dimensional subspace that is rich in information on variation in the data, correlation among variables as well as class separation. For the construction of biplots, we use a BiplotGUI package in a free statistical software R with increasing popularity. Moreover, using data from questionnaires given to Chonbuk National University freshmen in 2009, the relationship between career goals and career maturity are studied by applying the biplot method.

• ETRI Journal
• /
• v.35 no.2
• /
• pp.193-199
• /
• 2013

This paper addresses nonnegative independent component analysis (NICA), with the aim to realize the blind separation of nonnegative well-grounded independent source signals, which arises in many practical applications but is hardly ever explored. Recently, Bertrand and Moonen presented a multiplicative NICA (M-NICA) algorithm using multiplicative update and subspace projection. Based on the principle of the mutual correlation minimization, we propose another novel cost function to evaluate the diagonalization level of the correlation matrix, and apply the multiplicative exponentiated gradient (EG) descent update to it to maintain nonnegativity. An efficient approach referred to as the EG-NICA algorithm is derived and its validity is confirmed by numerous simulations conducted on different types of source signals. Results show that the separation performance of the proposed EG-NICA algorithm is superior to that of the previous M-NICA algorithm, with a better unmixing accuracy. In addition, its convergence speed is adjustable by an appropriate user-defined learning rate.