• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1302-1309
• /
• 2008

Traditional clustering methods, like k-means or fuzzy clustering, are prototype-based methods which are applicable only to convex clusters. On the other hand, spectral clustering tries to find clusters only using local similarity information. Its ability to handle concave clusters has gained the popularity recent years together with support vector machine (SVM) which is a kernel-based classification method. However, as is in SVM, the kernel width plays an important role and has a great impact on the result. Several methods are proposed to decide it automatically, it is still determined based on heuristics. In this paper, we proposed an adaptive method deciding the kernel width based on distance histogram. The proposed method is motivated by the fact that the affinity matrix should be formed into a block diagonal matrix to generate the best result. We use the tradition Euclidean distance together with the random walk distance, which make it possible to form a more apparent block diagonal affinity matrix. Experimental results show that the proposed method generates more clear block structured affinity matrix than the existing one does.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.53 no.4
• /
• pp.175-182
• /
• 2004

This paper presents a new method for finding the Block Pulse series coefficients, deriving the Block Pulse integration operational matrices and generalizing the integration operational matrices which are necessary for the control fields using the Block Pulse functions. In order to apply the Block Pulse function technique to the problems of state estimation or parameter identification more efficiently, it is necessary to find the more exact value of the Block Pulse series coefficients and integral operational matrices. This paper presents the method for improving the accuracy of the Block Pulse series coefficients and derives generalized integration operational matrix and applied the matrix to the analysis of linear time-invariant system.

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.28-34
• /
• 2007

In this paper, we present a quasi-Jacket block matrices over binary matrices which all are belong to a class of cocyclic matrices is the same as the Hadamard case and are useful in digital signal processing, CDMA, and coded modulation. Based on circular permutation matrix(CPM) cocyclic quasi block low-density matrix is introduced in this paper which is useful in coding theory. Additionally, we show that the fast algorithm of quasi-Jacket block matrix.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.3
• /
• pp.267-282
• /
• 2019

This paper examines how one can build a block tridiagonal structure for k-almost normal matrices and also for k-almost conjugate normal matrices. We shall see that these representations are created by unitary similarity and unitary congruance transformations, respectively. It shall be proven that the orders of diagonal blocks are 1, k + 2, 2k + 3, ${\ldots}$, in both cases. Then these block tridiagonal structures shall be reviewed for the cases where the mentioned matrices satisfy in a second-degree polynomial. Finally, for these processes, algorithms are presented.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.198-204
• /
• 2003

In this paper, we presented a new algebraic iterative algorithm for the optimal control of the nonlinear systems. The algorithm is based on two steps. The first step transforms nonlinear optimal control problem into a sequence of linear optimal control problem using the quasilinearization method. In the second step, TPBCP(two point boundary condition problem) is solved by algebraic equations instead of differential equations using the new integral operational matrix of BPF(block pulse functions). The proposed algorithm is simple and efficient in computation for the optimal control of nonlinear systems and is less error value than that by the conventional matrix. In computer simulation, the algorithm was verified through the optimal control design of synchronous machine connected to an infinite bus.

• The Korean Journal of Applied Statistics
• /
• v.7 no.2
• /
• pp.289-297
• /
• 1994

A block design will be said to have Property C if the concordance matrix can be expressed as a linear combination of Kronecker product of permutation matrices. No matrix inversions are necessary for the intrablock analysis of the block designs which possesses the Property C(Paik, 1985). In this paper, in order to show the Li type PBIB designs possesses the Property C, we suggest the structure of the concordance matrices of Li type PBIB designs are multi-nested block circulant pattern.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.240-245
• /
• 2010

Jacket matrices, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.178-180
• /
• 2004

In this work, we propose new method of sigma filtering for efficient filtering and preserving edge regions in DCT Domain. In block-based image compression technique, the image is first divided into non-overlapping $8{\times}8$ blocks. Then, the two-dimensional DCT is computed for each $8{\times}8$ block. Once the DCT coefficients are obtained, they are quantized using a specific quantization table. Quantization of the DCT coefficients is a lossy process, and in this step, noise is added. In this work, we combine IDCT matrix and filter matrix to a new matrix to simplify filtering process to remove noise after IDCT in spatial domain, for each $8{\times}8$ DCT coefficient block, we determine whether this block is edge or homogeneous region. If this block is edge region, we divide this $8{\times}8$ block into four $4{\times}4$ sub-blocks, and do filtering process for sub-blocks which is homogeneous region. By this process, we can remove blocking artifacts efficiently preserving edge regions at the same time.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.681-698
• /
• 2016

In this paper, we investigate relative essential spectra of $2{\times}2$ block operator matrix using the Fredholm perturbation theory. Furthermore, an example for two-group transport equations is presented to illustrate the validity of the main results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1033-1036
• /
• 2003

최근 인터넷의 급격한 발전의 결과로서 전산 시스템의 대규모화와 복잡화가 증가함에 따라 시스템의 전문적인 관리를 위한 솔루션에 대한 요구가 증가하고 있다. 서비스를 수행중인 시스템에 있어서 성능 관리는 전산 자원의 가동 성능을 유지하고 향상시키는 일련을 작업을 의미하며 모니터링, 진단, 제어의 사이클로 관리자와 상호작용을 수행한다. 본 논문에서는 차세대 인터넷 서버의 관리를 위한 시스템 관리 솔루션인 MATRlx (MATRIx's Advanced Technology of Resource Information extraction / eXploitation / eXploration / eXchange) 시스템을 소개하며 MATRIx 시스템의 성능 관리 블록인 MATRIx-PFMB의 설계 및 구현에 대한 이슈들을 다룬다. MATRIx-PFMB(PerFormance Management Block)는 관리 서버와 에어젼트 및 관리자 콘솔로 구성되며 능동적인 시스템 관리를 위한 진단 도구 및 제어 기능을 제공하고 기능 확장의 용이성을 제공하기 위한 프레임워크 구조를 갖는다.