• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.91-100
• /
• 1994

The lapped orthogonal transform(LOT) has been recently proposed to alleviate the blocking effects in transform coding. The LOT is known to provide an improved coding gain than the conventional transform. In this paper, we propose a prefilter approach to design the LOT bases with the view of maximizing the transform coding gain. Since the nonlinear phase basis is inappropriate to the image coding only the linear phase basis is considered in this paper. Our approach is mainly based on decomposing the transform matrix into the orthogonal matrix and the prefilter matrix. And by assuming that the input is the 1st order Markov source we design the prefilter matrix and the orthogonal matirx maximizing the transform coding gain. The computer simulation results show that the proposed LOT provides about 0.6~0.8 dB PSNR gain over the DCT and about 0.2~0.3 dB PSNR gain over the conventional LOT [7]. Also, the subjective test reveals that the proposed LOT shows less blocking effect than the DCT.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.25-40
• /
• 2021

In this article we introduce tribonacci sequence spaces c0(T) and c(T) derived by the domain of a newly defined regular tribonacci matrix T. We give some topological properties, inclusion relations, obtain the Schauder basis and determine ��-, ��- and ��- duals of the spaces c0(T) and c(T). We characterize certain matrix classes (c0(T), Y) and (c(T), Y), where Y is any of the spaces c0, c or ℓ∞. Finally, using Hausdorff measure of non-compactness we characterize certain class of compact operators on the space c0(T).

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1135-1143
• /
• 2019

The matrix representation of the Toeplitz operator on the Hardy space with respect to a generalized orthonormal basis for the space of square integrable functions associated to a bounded simply connected region in the complex plane is completely computed in terms of only the Szegő kernel and the Garabedian kernels.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1119-1129
• /
• 2022

We formulate the matrix representation of a composition operator on the Hardy space of the unit disc with the symbol which is a Riemann map of the unit disc, with respect to a special orthonormal basis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6028-6042
• /
• 2019

Since Sparse Nonnegative Matrix Factorization (SNMF) method can control the sparsity of the decomposed matrix, and then it can be adopted to control the sparsity of facial feature extraction and recognition. In order to improve the accuracy of SNMF method for facial feature recognition, new additive iterative rules based on the improved iterative step sizes are proposed to improve the SNMF method, and then the traditional multiplicative iterative rules of SNMF are transformed to additive iterative rules. Meanwhile, to further increase the sparsity of the basis matrix decomposed by the improved SNMF method, a threshold-sparse constraint is adopted to make the basis matrix to a zero-one matrix, which can further improve the accuracy of facial feature recognition. The improved SNMF method based on the additive iterative rules and threshold-sparse constraint is abbreviated as ASNMF, which is adopted to recognize the ORL and CK+ facial datasets, and achieved recognition rate of 96% and 100%, respectively. Meanwhile, from the results of the contrast experiments, it can be found that the recognition rate achieved by the ASNMF method is obviously higher than the basic NMF, traditional SNMF, convex nonnegative matrix factorization (CNMF) and Deep NMF.

• Honam Mathematical Journal
• /
• v.46 no.1
• /
• pp.60-69
• /
• 2024

We consider a special orthonormal basis for the Hardy space of the unit disc to compute the matrix representations of the composition operators with respect to the basis particulary associated to two symbols which are the inverse and the origin symmetry of the Riemann self map in the unit disc, and then we find a certain symmetry of the matrices.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.49-62
• /
• 1998

The purpose of this paper is to develope a large-scale simplex method program LPAKO. Various up-to-date techniques are argued and implemented. In LPAKO, basis matrices are stored in a LU factorized form, and Reid's method is used to update LU maintaining high sparsity and numerical stability, and further Markowitz's ordering is used in factorizing a basis matrix into a sparse LU form. As the data structures of basis matrix, Gustavson's data structure and row-column linked list structure are considered. The various criteria for reinversion are also discussed. The dynamic steepest-edge simplex algorithm is used for selection of an entering variable, and a new variation of the MINOS' perturbation technique is suggested for the resolution of degeneracy. Many preprocessing and scaling techniques are implemented. In addition, a new, effective initial basis construction method are suggested, and the criteria for optimality and infeasibility are suggested respectively. Finally, LPAKO is compared with MINOS by test results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.7
• /
• pp.615-623
• /
• 2008

This paper proposes an $H_{\infty}$ controller design method for Takagi-Sugeno (T-S) fuzzy systems using a fuzzy basis-function-dependent Lyapunov function. Sufficient conditions for the guaranteed $H_{\infty}$ performance of the T-S fuzzy control system are given in terms of linear matrix inequalities (LMIs). These LMI conditions are further used for a convex optimization problem in which the $H_{\infty}-norm$ of the closed-loop system is to be minimized. To facilitate the basis-function-dependent Lyapunov function approach and thus improve the closed-loop system performance, additional decision variables are introduced in the optimization problem, which provide an additional degree-of-freedom and thus can enlarge the solution space of the problem. Numerical examples show the effectiveness of the proposed method.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.303-308
• /
• 2004

The Gabor cosine and sine transform can be applied to image and video compression algorithm by representing image frequency components locally The computational complexity of forward and inverse matrix transforms used in the compression and decompression requires O($N^3$)operations. In this paper, the length of basis functions is truncated to produce a sparse basis matrix, and the computational burden of transforms reduces to deal with image compression and reconstruction in a real-time processing. As the length of basis functions is decreased, the truncation effects to the energy of basis functions are examined and the change in various Qualify measures is evaluated. Experiment results show that 11 times fewer multiplication/addition operations are achieved with less than 1% performance change.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.605-614
• /
• 2008

In this paper, we find the matrix representation of multi-degree reduction by $L_{\infty}$ of $B{\acute{e}}zier$ curves with constraints of endpoints continuity. Using the basis transformation between Chebyshev polynomials and Bernstein polynomials we can derive the matrix representation of multi-degree reduction of $B{\acute{e}}zier$ with respect to $L_{\infty}$ norm.