• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3E
• /
• pp.118-135
• /
• 2009

The level set based approach is one of active methods for contour extraction in image segmentation. Since Osher and Sethian introduced the level set framework in 1988, the method has made the great impact on image segmentation. However, there are some problems to be solved; such as multi-objects segmentation, noise filtering and much calculation amount. In this paper we address the drawbacks of the previous level set methods and propose an extension of the traditional fast level set to cope with the limitations. We introduce a relationship matrix, a new split-and-merge criterion, a modified Chan-Vese criterion and a novel filtering criterion into the traditional fast level set approach. With the segmentation experiments we evaluate the proposed method and show the promising results of the proposed method.

• 전기의세계
• /
• v.22 no.4
• /
• pp.25-29
• /
• 1973

The computation of transmittances between arbitrary input and output nodes is of particular interest in the signal flow graph theory imput. The signal flow matrix [T] can be defined by [X]=-[T][X] where [X] and [Y] are input nose and output node matrices, respectively. In this paper, the followings are discussed; 1) Reduction of nodes by reforming the signal flow matrix., 2) Solution of input-output relationships by means of Gauss-Jordan reduction method, 3) Extension of the above method to the matrix signal flow graph.

• Journal of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.641-653
• /
• 2020

To extend the well-known extremal characterization of the geometric mean of two n × n positive definite matrices A and B, we solve the following problem: $${\max}\{X:X=X^*,\;\(\array{A&V&X\\V&B&W\\X&W&C}\){\geq}0\}$$. We find an explicit expression of the maximum value with respect to the matrix geometric mean of Schur complements.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.509-517
• /
• 2006

In this Paper We Study some Operators With the single valued extension property. In particular, we investigate the Helton class of an operator and an $n{\times}n$ triangular operator matrix T.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.21-29
• /
• 2017

This paper addresses the problem of unsupervised speech separation based on robust non-negative matrix factorization (RNMF) with ${\beta}$-divergence, when neither speech nor noise training data is available beforehand. We propose a robust version of non-negative matrix factorization, inspired by the recently developed sparse and low-rank decomposition, in which the data matrix is decomposed into the sum of a low-rank matrix and a sparse matrix. Efficient multiplicative update rules to minimize the ${\beta}$-divergence-based cost function are derived. A convolutional extension of the proposed algorithm is also proposed, which considers the time dependency of the non-negative noise bases. Experimental speech separation results show that the proposed convolutional RNMF successfully separates the repeating time-varying spectral structures from the magnitude spectrum of the mixture, and does so without any prior training.

• Communications of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.917-925
• /
• 2020

It has been shown that the geometric mean A#B of positive definite Hermitian matrices A and B is the maximal element X of Hermitian matrices such that $$\(\array{A&X\\X&B}\)$$ is positive semi-definite. As an extension of this result for the 2 × 2 block matrix, we consider in this article the block matrix [[A#w_ijB]] whose (i, j) block is given by the Riemannian geodesics of positive definite Hermitian matrices A and B, where w_ij ∈ ℝ for all 1 ≤ i, j ≤ m. Under certain assumption of the Loewner order for A and B, we establish the equivalent condition for the parameter matrix ω = [w_ij] such that the block matrix [[A#w_ijB]] is positive semi-definite.

• Structural Engineering and Mechanics
• /
• v.22 no.2
• /
• pp.131-150
• /
• 2006

Exact analytical solutions for in-plane static problems of planar curved beams with variable curvatures and variable cross-sections are derived by using the initial value method. The governing equations include the axial extension and shear deformation effects. The fundamental matrix required by the initial value method is obtained analytically. Then, the displacements, slopes and stress resultants are found analytically along the beam axis by using the fundamental matrix. The results are given in analytical forms. In order to show the advantages of the method, some examples are solved and the results are compared with the existing results in the literature. One of the advantages of the proposed method is that the high degree of statically indeterminacy adds no extra difficulty to the solution. For some examples, the deformed shape along the beam axis is determined and plotted and also the slope and stress resultants are given in tables.

• Korean Journal of Mathematics
• /
• v.31 no.2
• /
• pp.145-152
• /
• 2023

Let $P(z):=\sum\limits^{n}_{j=0}A_jz^j$, A_j ∈ ℂ^m×m, 0 ≤ j ≤ n be a matrix polynomial of degree n, such that A_n ≥ A_n-1 ≥ . . . ≥ A₀ ≥ 0, A_n > 0. Then the eigenvalues of P(z) lie in the closed unit disk. This theorem proved by Dirr and Wimmer [IEEE Trans. Automat. Control 52(2007), 2151-2153] is infact a matrix extension of a famous and elegant result on the distribution of zeros of polynomials known as Eneström-Kakeya theorem. In this paper, we prove a more general result which inter alia includes the above result as a special case. We also prove an improvement of a result due to Lê, Du, Nguyên [Oper. Matrices, 13(2019), 937-954] besides a matrix extention of a result proved by Mohammad [Amer. Math. Monthly, vol.74, No.3, March 1967].

• Communications of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.137-149
• /
• 2020

Let γ⁽ⁿ⁾ ≡ {γ_ij} (0 ≤ i+j ≤ 2n, |i-j| ≤ n) be a sequence in the complex number set ℂ and let E (n) be the Embry truncated moment matrices corresponding from γ⁽ⁿ⁾. For an odd number n, it is known that γ⁽ⁿ⁾ has a rank E (n)-atomic representing measure if and only if E(n) ≥ 0 and E(n) admits a flat extension E(n + 1). In this paper we suggest a related problem: if E(n) is positive and nonsingular, does E(n) have a flat extension E(n + 1)? and give a negative answer in the case of E(3). And we obtain some necessary conditions for positive and nonsingular matrix E (3), and also its sufficient conditions.

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.179-183
• /
• 2001

This paper presents a simple current control strategy for matrix converters based on the extension of PWM method for inverters. A novel and efficient PWM algorithm is developed. The algorithm is verified through simulation and experiments employing a 2-kVA prototype. The results of simulation and experiment prove the instantaneous control capability of the output current with the sinusoidal input current.