• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3655-3671
• /
• 2015

In this paper, we develop a novel object tracking method based on sparse representation. First, we propose a relaxed sparse representation model, based on which the tracking problem is casted as an inverse sparse representation process. In this process, the target template is able to be sparsely approximated by all candidate samples. Second, we present an objective function that combines the sparse representation process of different fragments, the relaxed representation scheme and a weight reference prior. Based on some propositions, the proposed objective function can be solved by using an iteration algorithm. In addition, we design a tracking framework based on the proposed representation model and a simple online update manner. Finally, numerous experiments are conducted on some challenging sequences to compare our tracking method with some state-of-the-art ones. Both qualitative and quantitative results demonstrate that the proposed tracking method performs better than other competing algorithms.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.430-439
• /
• 2007

In this paper, we use non-negative matrix factorization (NMF) to refine the document clustering results. NMF is a dimensional reduction method and effective for document clustering, because a term-document matrix is high-dimensional and sparse. The initial matrix of the NMF algorithm is regarded as a clustering result, therefore we can use NMF as a refinement method. First we perform min-max cut (Mcut), which is a powerful spectral clustering method, and then refine the result via NMF. Finally we should obtain an accurate clustering result. However, NMF often fails to improve the given clustering result. To overcome this problem, we use the Mcut object function to stop the iteration of NMF.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.122-124
• /
• 1987

This paper presents a new algorithm in formulating a performance index for contingency selection method considering voltage security. Security limits defined-in terms of real power line flows and voltage magnitudes are considered in normalized subspaces where in critical contingencies are identified by a filtering algorithm using the infinite norm. Two types of limits, warning limit and emergency limit, are introduced for voltage and line flow. Usually performance indices have been constructed for real power line flows and voltages with each different criterion. This paper, however, presents a method that constructs them with the same criterion in use of the norm properties, so that we can assess security considering both of them. Rapid contingency simulation is performed using one iteration of fast decoupled load flows with LMML(Inverse Matrix Modification Lemma).

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.10a
• /
• pp.1-8
• /
• 1995

This work presents a new method to deal with buckling constraints. The mathematical optimization process of truss structures proposed earlier by the author has been proved to be the most rigorous method. The inclusion of buckling constraints, however, gives rise to a new problem The allowable compression stress of a member changes from one design iteration to another. This changing stress limit creates a good deal of noise in selecting active constraints and makes the solution process unstable. This problem can be overcome by introducing relaxation parameters. This work, however, aims at establishing a more rigorous method by containing the allowable compression stress in the left hand side of the associated constraint.

• The Pure and Applied Mathematics
• /
• v.6 no.2
• /
• pp.113-120
• /
• 1999

This paper studies the problem of an infinite confined aquifer which at time t ＜ 0 is assumed motionless. At time t = 0 crude oil seeps into the aquifer, thereby contaminating the valuable drinking water. Since the crude oil and water are im-miscible, the problem is posed as a one-dimensional two-phase unsteady moving boundary problem. A similarity solution is developed in which the moving front parameter is obtained by Newton-Ralphson iteration. A numerical scheme, involving the front tracking method, is devised employing the fourth order Runge-Kutta method. Comparison of the exact and numerical schemes shows an error of only 3%. Thus the developed numerical scheme is quite accurate in tackling more realistic problems where exact solutions are not possible.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.3
• /
• pp.33-46
• /
• 2007

This study deals with the adaptive multiuser OFDM (Orthogonal Frequency Division Multiplexing) system which adjusts the resource allocation according to the environmental changes in such as wireless and quality of service required by users. The resource allocation includes subcarrier assignment to users, modulation method and power used for subcarriers. We first develop a general optimization model which maximizes data throughput while satisfying data rates required by users and total power constraints. Based on the property that this problem has the 0 duality gap, we apply the subgradient dual optimization method which obtains the solution of the dual problem by iteration of simple calculations. Extensive experiments with realistic data have shown that the subgradient dual method is applicable to the real world system, and can be used as a dynamic resource allocation mechanism.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.571-577
• /
• 2003

This research proposes a finite element method to determine the natural vibration characteristics of the spinning disk-spindle system in a HDD including the flexibility of supporting structure. Finite element equations of each substructure are derived with the introduction of consistent variables to satisfy the geometric compatibility at the internal boundaries. The natural frequencies and modes from the global asymmetric matrix equations of motion are determined by using the implicit restarted Arnoldi iteration method. The validity of the proposed method is verified by the experimental modal testing. It also shows that the flexibility of base plate plays an important role to determine the natural frequencies of the spinning disk-spindle system in a HDD.

• International Journal of Contents
• /
• v.4 no.4
• /
• pp.1-6
• /
• 2008

In this paper, we propose improved loop splitting method for maximizing parallelism of single loops with non-constant dependence distances. By using the iteration and distance for the source of the first dependence, and by our defined theorems, we present generalized and optimal algorithms for single loops with non-uniform dependences (MPSL). By the extension of the MPSL method, we also apply to exploit parallelism from nested loops with simple subscripts, based on cycle shrinking and loop interchanging method. The algorithms generalize how to transform general single loops with non-uniform dependences as well as nested loops with simple subscripts into parallel loops.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.6
• /
• pp.267-273
• /
• 2005

This paper proposes a line-to-ground fault location algorithm for underground cable system. A feature of the proposed method is a new algorithm based on the analytic research which has not been tried until now. The proposed method firstly makes voltage and current equations using analysis of distributed parameter circuit for each of cores and sheathes respectively, and then establishes an equation of the fault distance according to the analysis of the fault conditions. Finally the solution of this equation is calculated by Newton-Raphson iteration method. The effectiveness of this proposed algorithm has been proven through PSCAD/EMTDC(Ver. 4.1) simulations.