• ETRI Journal
• /
• 제36권1호
• /
• pp.167-170
• /
• 2014

In this letter, we propose an unsupervised framework for speech noise reduction based on the recent development of low-rank and sparse matrix decomposition. The proposed framework directly separates the speech signal from noisy speech by decomposing the noisy speech spectrogram into three submatrices: the noise structure matrix, the clean speech structure matrix, and the residual noise matrix. Evaluations on the Noisex-92 dataset show that the proposed method achieves a signal-to-distortion ratio approximately 2.48 dB and 3.23 dB higher than that of the robust principal component analysis method and the non-negative matrix factorization method, respectively, when the input SNR is -5 dB.

• Journal of the Optical Society of Korea
• /
• 제16권4호
• /
• pp.443-448
• /
• 2012

A polarimetric experimental method was developed to determine the Jones matrix elements of transparent optical materials without sign ambiguity. A set of polarization dependent transmittance data of the samples was measured with polarizer - sample - analyzer system and another set of data was measured with polarizer - sample - quarter-wave plate - analyzer. Two data sets were compared and mathematically analyzed to obtain the correct signs of the elements of the matrix. The Jones matrix elements of a quarter-wave plate were determined to check the validity of the method. The experimentally obtained matrix elements of the quarter-wave plate were consistent with the theoretical expectations. The same method was applied to obtain the Jones matrix elements of a twisted nematic liquid crystal panel.

• 한국정보통신학회논문지
• /
• 제7권3호
• /
• pp.437-447
• /
• 2003

Circulant Matrix Factorization (CMF)는 covariance 행렬의 spectral factorization된 결과를 얻을 수 있다. 우리는 얻어진 결과를 가지고 일반적으로 잘 알려진 방법인 Schur algorithm을 이용하여 finite impulse response(FIR)와 infinite impulse response (IIR) lattice 필터를 설계하는 방법을 제안하였다. CMF는 기존에 많이 사용되는 root finding을 사용하지 않고 covariance polynomial로부터 minimum phase 특성을 가지는 polynomial을 얻는데 유용한 방법이다. 그리고 Schur algorithm은 toeplitz matrix를 빠르게 Cholesky factorization하기 위한 방법으로 이 방법을 이용하면 FIR/IIR lattice 필터의 계수를 쉽게 찾아낼 수 있다. 본 논문에서는 이러한 방법들을 이용하여 FIR과 IIR lattice 필터의 설계의 계산적인 예제를 제시했으며, 제안된 방법과 다른 기존에 제시되었던 방법 (polynomial root finding과 cepstral deconvolution)들과 성능을 비교 평가하였다.

• 한국소음진동공학회논문집
• /
• 제26권2호
• /
• pp.179-186
• /
• 2016

This paper presents a numerical method that can evaluate the effect of crack for the in-plane bending vibration of Timoshenko beam. The method is a transfer matrix method that the element transfer matrix is deduced from the element dynamic stiffness matrix. An edge crack is expressed as a rotational spring, and then is formulated as an independent transfer matrix. To demonstrate the accuracy of this theory, the results computed from the present are compared with those obtained from the commercial finite element analysis program. Based on these comparison results, a parametric study is performed to analyze the effects for the size and locations of crack.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제49권2호
• /
• pp.161-174
• /
• 2010

The purpose of the study is to analyze various types of errors appeared in true-false proof problems of matrix and to find out correction method. In order to achieve this purpose, error test was conducted to the subject of 87 second grade students who were chosen from D high schoool. It was shown from this test that the most frequent error type was caused by the lack of understanding about concepts and essential facts of matrix(35.3%), and then caused by the invalid logically reasoning (27.4%), and then caused by the misusing conditions(18.7%). Through three hours of correction lessons with 5 students, the following correction teaching method was proposed. First, it is stressed that the operation rules and properties satisfied in real number system can not be applied in matrix. Second, it is taught that the analytical proof method and the reductio ad absurdum method are useful in the proof problem of matrix. Third, it is explained that the counter example of E=$\begin{pmatrix}1\;0\\0\;1 \end{pmatrix}$, -E should be found in proof of the false statement. Fourth, it is taught that the determinant condition should be checked for the existence of the inverse matrix.

• Current Optics and Photonics
• /
• 제5권3호
• /
• pp.322-328
• /
• 2021

In this paper, a pretreatment method for a matrix in convex optimization is proposed to optimize the spectral reconstruction process of a disordered dispersion spectrometer. Unlike the reconstruction process of traditional spectrometers using Fourier transforms, the reconstruction process of disordered dispersion spectrometers involves solving a large-scale matrix equation. However, since the matrices in the matrix equation are obtained through measurement, they contain uncertainties due to out of band signals, background noise, rounding errors, temperature variations and so on. It is difficult to solve such a matrix equation by using ordinary nonstationary iterative methods, owing to instability problems. Although the smoothing Tikhonov regularization approach has the ability to approximatively solve the matrix equation and reconstruct most simple spectral shapes, it still suffers the limitations of reconstructing complex and irregular spectral shapes that are commonly used to distinguish different elements of detected targets with mixed substances by characteristic spectral peaks. Therefore, we propose a special pretreatment method for a matrix in convex optimization, which has been proved to be useful for reducing the condition number of matrices in the equation. In comparison with the reconstructed spectra gotten by the previous ordinary iterative method, the spectra obtained by the pretreatment method show obvious accuracy.

• 대한수학회지
• /
• 제45권2호
• /
• pp.479-491
• /
• 2008

In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.

• Kyungpook Mathematical Journal
• /
• 제47권2호
• /
• pp.239-251
• /
• 2007

We show how the minimization can be used to solve the quadratic matrix equation and then compare two different types of conjugate gradient method which are Polak and Ribi$\acute{e}$re version and Fletcher and Reeves version. Finally, some results of the global and local convergence are shown.

• Journal of information and communication convergence engineering
• /
• 제3권3호
• /
• pp.115-118
• /
• 2005

In this study, the proposed algorithm is a correlativity signal in a mobile wireless channel that has estimated the direction of arrival. The proposed algorithm applied the space average method in a MUSIC algorithm. The diagonal matrix of the space average method was changed to inverse the matrix and to obtain a new signal correlation matrix. The existing algorithm was analyzed and compared by applying a proposed signal correlation matrix to estimate the direction of arrival in a MUSIC algorithm. The experiment resulted in a proposed algorithm with a min-norm method resolution at more than $5^{\circ}$. It improved more than $2^{\circ}$ in a MUSIC algorithm.

• Journal of Power Electronics
• /
• 제8권1호
• /
• pp.74-80
• /
• 2008

This paper develops a direct torque control method (DTC) using a matrix converter fed induction motor. The advantages of matrix converters are combined with the advantages of the DTC technique; under the constraint of the unity input power factor, the required voltage vectors are generated to implement the conventional DTC method of induction motor. The proposed DTC algorithm is applied to induction motors and the experimental results are given in steady-state and transient conditions, while the discussion about the trend of the DTC method using the MC is also carried out. Furthermore, the entire system of the matrix converter configuration using 7.5kW IGBT module is explained in detail.