• International Journal of Precision Engineering and Manufacturing
• /
• v.1 no.2
• /
• pp.76-83
• /
• 2000

A study on the robust control of a composite beam with a distributed PVDF sensor and piezo-ceramic actuator is presented in this paper. $1^{st}$ and $2^{nd}$ natural frequencies are considered in the modeling, because robust control theory which has robustness to structured uncertainty is adopted to suppress the vibration. If the controllers designed by $H_{\infty}$ theory do not satisfy control performance, it is improved by $\mu$-synthesis method with D-K iteration so that the $\mu$-controller based on the structured singular value satisfies the nominal performance and robust performance. Simulation and experiment were carried out with the designed controller and the verification of the robust control properties was presented by results.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2088-2091
• /
• 2003

We presents a new algorithm for tracking person in video sequence that integrates the meanshift iteration procedure into the particle filtering. Utilizing the nice property of convergence to the modes in the meanshift iteration we show that only a few sample points are sufficient, while in general the particle filtering requires a large number of sample points. Multi-parts of a person is tracked independently of each other based on the color Then, the similarity against the reference model color and the geometric constraints between multi-parts are reflected as the sample weights. Also presented is the computer simulation results, which show successful tracking even for complex background clutter.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.109-117
• /
• 1997

A new relaxation algorithm based on distribution of matched errors and possibility is proposed to solve efficiently correspondence problem. This algorithm can be applied to various method, such as BMA, feature-, and region-based matching methods, by modifying its smoothness function. It consists of two stages which are transformation and iteration process. In transformation stage, the errors obtained by any matching algorithm are transformed to possibility values according to these statistical distribution. Each grade of possility is updated by some constraints which are defined as smoothness, uniqueness, and discontinuity factor in iteration stage. The discontinuity factor is used to reserve discontinuity of disparity. In conventional methods, it is difficult to find proper weights and stop condition, because only two factors, smoothness and uniqueness, have been used. However, in the proposed mthod, the more smoothing is not ocurred because of discontinuity factor. And it is efective to the various image, even if the image has a severe noise and repeating patterns. In addition, it is shown that the convergence rate and the quality of output are improved.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.1
• /
• pp.25-31
• /
• 1984

An algorithm on time limited signal extrapolation technique is presented where the total extrapolation process of iteration method is achieved by a single matrix operation. The proposed technique and its implementation has many advantages over iteration method in terms of computational saving and accuracy of the results. As an examples in this paper, appling the proposed technique to ultrasonic diagnosis-device, we prove the excellence of the proposed technique.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.123-136
• /
• 2004

In this paper, a combining trust region and line search algorithm for equality constrained optimization is proposed. At each iteration, we only need to solve the trust region subproblem once, when the trust region trial step can not be accepted, we switch to line search to obtain the next iteration. Hence, the difficulty of repeated solving trust region subproblem in an iterate is avoided. In order to allow the direction of negative curvature, we add second correction step in trust region step and employ nonmonotone technique in line search. The global convergence and local superlinearly rate are established under certain assumptions. Some numerical examples are given to illustrate the efficiency of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.293-309
• /
• 2011

The purpose of this article is to prove strong convergence theorems for weak relatively nonexpansive mapping which is firstly presented in this article. In order to get the strong convergence theorems for weak relatively nonexpansive mapping, the monotone CQ iteration method is presented and is used to approximate the fixed point of weak relatively nonexpansive mapping, therefore this article apply above results to prove the strong convergence theorems of zero point for maximal monotone operators in Banach spaces. Noting that, the CQ iteration method can be used for relatively nonexpansive mapping but it can not be used for weak relatively nonexpansive mapping. However, the monotone CQ method can be used for weak relatively nonexpansive mapping. The results of this paper modify and improve the results of S.Matsushita and W.Takahashi, and some others.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1343-1359
• /
• 2009

In this paper, we implement a relatively new analytical technique by combining the traditional variational iteration method and the decomposition method which is called as the variational decomposition method (VDM) for solving the sixth-order boundary value problems. The proposed technique is in fact the modification of variatioanal iteration method by coupling it with the so-called Adomian's polynomials. The analytical results of the equations have been obtained in terms of convergent series with easily computable components. Comparisons are made to verify the reliability and accuracy of the proposed algorithm. Several examples are given to check the efficiency of the proposed algorithm. We have also considered an example where the VDM is not reliable.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.571-581
• /
• 2010

Some convergence theorems for approximating to a common fixed point of an infinite family of strictly pseudocontractive mappings of Browder-Petryshyn type are proved in the setting of Banach spaces by using a new composite implicit iterative process with errors. The results presented in the paper generalize and improve the main results of Bai and Kim [1], Gu [4], Osilike [5], Su and Li [7], and Xu and Ori [8].

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1527-1538
• /
• 2014

The purpose of this paper is to address the multiple split common fixed point problem. We present two different methods to approximate a solution of the problem. One is cyclic iteration method; the other is simultaneous iteration method. Under appropriate assumptions on the operators and iterative parameters, we prove both the proposed algorithms converge to the solution of the multiple split common fixed point problem. Our results generalize and improve some known results in the literatures.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1275-1295
• /
• 2008

In this paper, we consider an impulsive nonlinear second order ordinary differential equation with nonlinear three-point boundary conditions and develop a monotone iteration scheme by relaxing the convexity assumption on the function involved in the differential equation and the concavity assumption on nonlinearities in the boundary conditions. In fact, we obtain monotone sequences of iterates (approximate solutions) converging quadratically to the unique solution of the impulsive three-point boundary value problem.