• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.6
• /
• pp.503-511
• /
• 2013

This paper presents a speech enhancement method using non-negative matrix factorization. In training phase, we can obtain each basis matrix from speech and specific noise database. After training phase, the noisy signal is separated from the speech and noise estimate using basis matrix in enhancement phase. In order to improve the performance, we model the change of encoding matrix from training phase to enhancement phase using independent Gaussian distribution models, and then use the constraint of the objective function almost same as that of the above Gaussian models. Also, we perform a smoothing operation to the encoding matrix by taking into account previous value. Last, we apply the Log-Spectral Amplitude type algorithm as gain function.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.251-263
• /
• 2004

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Grobner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2171-2179
• /
• 2009

In this paper, we propose a novel Image Encryption using MLCA (Maximum Length Cellular Automata) and CAT (Cellular Automata Transform). Firstly, we use the Wolfram rule matrix to generate MLCA state transition matrix T. Then the state transition matrix T changes pixel value of original image according to pixel position. Next, we obtain Gateway Values to generate 2D CAT basis function. Lastly, the basis function encrypts the MLCA encrypted image into cellular automata space. The experimental results and security analysis show that the proposed method guarantees better security and non-lossy encryption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3482-3497
• /
• 2021

Artificial intelligence has emerged as the core of the 4th industrial revolution, and large amounts of data processing, such as big data technology and rapid data analysis, are inevitable. The most fundamental and universal data interpretation technique is an analysis of information through regression, which is also the basis of machine learning. Ridge regression is a technique of regression that decreases sensitivity to unique or outlier information. The time-consuming calculation portion of the matrix computation, however, basically includes the introduction of an inverse matrix. As the size of the matrix expands, the matrix solution method becomes a major challenge. In this paper, a new algorithm is introduced to enhance the speed of ridge regression estimator calculation through series expansion and computation recycle without adopting an inverse matrix in the calculation process or other factorization methods. In addition, the performances of the proposed algorithm and the existing algorithm were compared according to the matrix size. Overall, excellent speed-up of the proposed algorithm with good accuracy was demonstrated.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.5
• /
• pp.606-613
• /
• 2003

As a technical method for controlling chaotic dynamics, this paper presents a predictive control for chaotic systems based on radial basis function networks(RBFNs). To control the chaotic systems, we employ an on-line identification unit and a nonlinear feedback controller, where the RBFN identifier is based on a suitable NARMA real-time modeling method and the controller is predictive control scheme. In our design method, the identifier and controller are most conveniently implemented using a gradient-descent procedure that represents a generalization of the least mean square(LMS) algorithm. Also, we introduce a projection matrix to determine the control input, which decreases the control performance function very rapidly. And the effectiveness and feasibility of the proposed control method is demonstrated with application to the continuous-time and discrete-time chaotic nonlinear system.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.777-786
• /
• 2014

We construct an orthonormal basis for the Bergman space associated to a simply connected domain. We use the or-thonormal basis for the Hardy space consisting of the Szegő kernel and the Riemann mapping function and rewrite their area integrals in terms of arc length integrals using the complex Green's identity. And we make a note about the matrix of a Toeplitz operator with respect to the orthonormal basis constructed in the paper.

• Journal of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.345-354
• /
• 1999

In this paper, we obtain a matrix theorem which will be widely used in several theory and give it's applications. In particular, we present a further improvement of the improved Stile's theorem.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.2
• /
• pp.333-339
• /
• 2013

This paper discusses a method for getting a basis set of estimable functions of less than full rank linear model. Since model parameters are not estimable estimable functions should be identified for making inferences proper about them. So, it suggests a method of using full rank factorization of model matrix to find estimable functions in easy way. Although they might be obtained in many different ways of using model matrix, the suggested full rank factorization technique could be one of much easier methods. It also discusses how to use projection matrix to identify estimable functions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3559-3571
• /
• 2015

This paper addresses the problem of signal acquisition with a sparse representation in a given orthonormal basis using fewer noisy measurements. The authors formulate the problem statement for randomly measuring with strong signal noise. The impact of white Gaussian signals noise on the recovery performance is analyzed to provide a theoretical basis for the reasonable design of the measurement matrix. With the idea that the measurement matrix can be adapted for noise suppression in the adaptive CS system, an adapted selective compressive sensing (ASCS) scheme is proposed whose measurement matrix can be updated according to the noise information fed back by the processing center. In terms of objective recovery quality, failure rate and mean-square error (MSE), a comparison is made with some nonadaptive methods and existing CS measurement approaches. Extensive numerical experiments show that the proposed scheme has better noise suppression performance and improves the support recovery of sparse signal. The proposed scheme should have a great potential and bright prospect of broadband signals such as biological signal measurement and radar signal detection.

• Journal of the Korean Data and Information Science Society
• /
• v.4
• /
• pp.31-44
• /
• 1993

Multivariate exponentially weighted moving average (EWMA) control charts for monitoring the variance-covariance matrix are investigated. A variable sampling interval (VSI) feature is considered in these charts. Multivariate EWMA control charts for monitoring the variance-covariance matrix are compared on the basis of their average time to signal (ATS) performances. The numerical results show that multivariate VSI EWMA control charts are more efficient than corrsponding multivariate fixed sampling interval (FSI) EWMA control charts.