• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.65-77
• /
• 2014

To address the problem of multi-target retrieval (MTR) of remote sensing images, this study proposes a new object-level feature representation model. The model provides an enhanced application image representation that improves the efficiency of MTR. Generating the model in our scheme includes processes, such as object-oriented image segmentation, feature parameter calculation, and symbolic image database construction. The proposed model uses the spatial representation method of the extended nine-direction lower-triangular (9DLT) matrix to combine spatial relationships among objects, and organizes the image features according to MPEG-7 standards. A similarity metric method is proposed that improves the precision of similarity retrieval. Our method provides a trade-off strategy that supports flexible matching on the target features, or the spatial relationship between the query target and the image database. We implement this retrieval framework on a dataset of remote sensing images. Experimental results show that the proposed model achieves competitive and high-retrieval precision.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.75-78
• /
• 2006

This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. Stacking received symbols from different symbol duration and applying QR decomposition result in the special format of upper triangular matrix R so that the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.2
• /
• pp.95-107
• /
• 1989

This paper proposes a realization method of multidimensional digital filters that has high modularity, regularity and parallelism enjoying the attributes for efficient VLSI implementation. The method shows that multidimensional transfer functions can be treated as two-dimensional transfer functions modifying the decomposition method of multidimensional transfer functions proposed by Venetsanopoulos etal, and then be displayed by multiplications and additions of one-dimensional transfer functions by applying the griangular decomposition theorem to the coefficient matrices of the two-dimensional transfer functions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.107-110
• /
• 2006

This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. By stacking received symbols from different received symbolduration and applying QR decomposition resulting the special format of upper triangular matrix R, the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

• Kyungpook Mathematical Journal
• /
• v.59 no.2
• /
• pp.225-231
• /
• 2019

In a previous paper, the authors of this paper studied $2{\times}2$ matrices in upper triangular form, whose entries are operators on Hilbert spaces, and in which the the (1, 1) entry has a nontrivial hyperinvariant subspace. We were able to show, in certain cases, that the $2{\times}2$ matrix itself has a nontrivial hyperinvariant subspace. This generalized two earlier nice theorems of H. J. Kim from 2011 and 2012, and made some progress toward a solution of a problem that has been open for 45 years. In this paper we continue our investigation of such $2{\times}2$ operator matrices, and we improve our earlier results, perhaps bringing us closer to the resolution of the long-standing open problem, as mentioned above.

• Communications of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.27-39
• /
• 2021

We discuss the condition that every nonzero right annihilator of an element contains a nonzero ideal, as a generalization of the insertion-of-factors-property. A ring with such condition is called right AP. We prove that a ring R is right AP if and only if Dn(R) is right AP for every n ≥ 2, where Dn(R) is the ring of n by n upper triangular matrices over R whose diagonals are equal. Properties of right AP rings are investigated in relation to nilradicals, prime factor rings and minimal order.

• East Asian mathematical journal
• /
• v.37 no.1
• /
• pp.33-40
• /
• 2021

We discuss the condition that if ab = 0 for elements a, b in a ring R then aIb = 0 for some essential ideal I of R. A ring with such condition is called IEIP. We prove that a ring R is IEIP if and only if Dn(R) is IEIP for every n ≥ 2, where Dn(R) is the ring of n by n upper triangular matrices over R whose diagonals are equal. We construct an IEIP ring that is not Abelian and show that a well-known Abelian ring is not IEIP, noting that rings with the insertion-of-factors-property are Abelian.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.681-691
• /
• 1986

To represent the relations of the data dependency and resource conflict among micro-operations(MOP's) in the compaction process of microprograms, we propose a DDM (data dependent matrix) representation method instead of the DAG (conventional directed acyclic graph). Also, we propose a global compaction algorithm of microprograms to prevent a kind of block copying by cutting the trace at a junction block. The DDM method and compaction algoristhm have been applied to the Lah's example. The results shows that the proposed algorithm is more efficient than the conventional algorithms in reducing in reducing the total execution time and control memory space.

• Korean Journal of Mathematics
• /
• v.31 no.4
• /
• pp.405-417
• /
• 2023

The RIP of rings was introduced by Kwak and Lee as a generalization of the one-sided idempotent-reflexivity property. In this study, we focus on rings in which all one-sided semicentral idempotents are central, and we refer to them as quasi-Abelian rings, extending the concept introduced by RIP. We establish that quasi-Abelianity extends to various types of rings, including polynomial rings, power series rings, Laurent series rings, matrices, and certain subrings of triangular matrix rings. Furthermore, we provide comprehensive proofs for several results that hold for RIP and are also satisfied by the quasi-Abelian property. Additionally, we investigate the structural properties of minimal non-Abelian quasi-Abelian rings.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.55-65
• /
• 1995

Existing multiple-row downdating algorithms have adopted a CFD(Cholesky Factor Downdating) that recursively downdates one row at a time. The CFD based algorithm requires 5/2p $n^{2}$ flops(floating point operations) downdating a p$\times$n observation matrix $Z^{T}$ . On the other hands, a HCFD(Hybrid CFD) based algorithm we propose in this paper, requires p $n^{2}$＋6/5 $n^{3}$ flops v hen p$\geq$n. Such a HCFD based algorithm factorizes $Z^{T}$ at first, such that $Z^{T}$ = $Q_{z}$ RT/Z, and then applies the CFD onto the upper triangular matrix Rt/z, so that the total number of floating point operations for downdating $Z^{T}$ would be significantly reduced compared with that of the CFD based algorithm. Benchmark tests on the Sun SPARC/2 and the Tolerant System also show that performance of the HCFD based algorithm is superior to that of the CFD based algorithm, especially when the number of rows of the observation matrix is large.rge.