• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.2
• /
• pp.32-38
• /
• 2000

One of the most popular algorithm in adaptive signal processing is the least mean square(LMS) algorithm. The majority of these papers examine the LMS algorithm with a constant step size. The choice of the step size reflects a tradeoff between misadjustment and the speed of adaptation. Subsequent works have discussed the issue of optimization of the step size or methods of varying the step size to improve performance. However there is as yet no detailed analysis of a variable step size algorithm that is capable of giving both the adaptation speed and the convergence. In this paper we propose a new variable step size algorithm where the step size adjustment is controlled by the gradient of error square. The proposed algorithm is performed in the Walsh-Hadamard domain in real-valued orthogonal transform because of fast convergence. The simulation results using the new algorithm for noise canceller system is described. They are compared to the results obtained by other algorithms. It is shown that the proposed algorithm produces good results compared with conventional algorithms.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.7 no.1
• /
• pp.9-21
• /
• 1998

This paper a new solution approach to moving obstacle avoidance problem of a mobile robot. A new concept avoidability measure (AVM) is defined to describe the state of a pair of a robot and an obstacle regarding the collision between them. As an AVM, virtual distance function (VDF), is derived as a function of the distance from the obstacle to the robot and outward speed of the obstacle relative to the robot. By keeping the virtual distance above some positive limit value, the robot avoids the obstacle. In terms of the VDF ,an artificial potential field is constructed to repel the robot away from the obstacle and to attract the robot toward a goal location. At every sampling time, the artificial potential field is updated and the force driving the robot is derived from the gradient of the artificial potential field. The suggested algorithm drives the robot to avoid moving obstacles in real time. Since the algorithm considers the mobility of the obstacle as well as the distance, it is effective for moving obstacle avoidance. Some simulation studies show the effectiveness of the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.137-140
• /
• 1996

Finding line segments in an intensity image has been one of the most fundamental issues in computer vision. In complex scenes, it is hard to detect the locations of point features. Line features are more robust in providing greater positional accuracy. In this paper we present a robust "line features extraction" algorithm which extracts line feature in a single pass without using any assumptions and constraints. Our algorithm consists of five steps: (1) edge scanning, (2) edge normalization, (3) line-blob extraction, (4) line-feature computation, and (5) line linking. By using edge scanning, the computational complexity due to too many edge pixels is drastically reduced. Edge normalization improves the local quantization error induced from the gradient space partitioning and minimizes perturbations on edge orientation. We also analyze the effects of edge processing, and the least squares-based method and the principal axis-based method on the computation of line orientation. We show its efficiency with some real images.al images.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2E
• /
• pp.50-59
• /
• 1996

In this paper, an adaptive precompensator, which can reduce the distortion of a Wiener system effectively, is proposed. The previous techniques for adaptive precompensation, based on the Volterra series modeling to compensate the distortion of a nonlinear system, are not suitable for real-time implementation due to high computational burden and slow convergence burden and slow convergence rate. This paper presents an adaptive precompensation technique for the class of nonlinear subsystem, referred to as Wiener system. An adaptive algorithm for adjusting the parameters of a precompensator, structured by a hammerstein model, is derived using the stochastic gradient method. Also, an adaptive precompensatin technique which can effectively reduce nonlinear distortion in μ-law type of saturation characteristics is proposed. The validity of the proposed algorithm is confirmed through simulation by applying it to known Wiener systmes and a typical loudspeaker model.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.153-156
• /
• 2005

This paper concerns an efficient iterative approach for eliminating coherent interference signals in linearly constrained adaptive arrays. The Alternate Mainbeam Nulling Algorithm[1] is implemented iteratively to find an optimum weight vector. The convergence parameters in the unit gain and null constraints are calculated using steepest descent method with gradient estimation. The nulling performance of the proposed method is compared with that of conventional ones. It is shown that the proposed method performs better than conventional ones when the power of the coherent signals is large compared with a desired signal. Also, it performs consistently well for more number of interferences.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.83-90
• /
• 2004

Substructuring methods are usually used in finite element structural analyses. In this study a multi-level substructuring algorithm is developed and proposed as a possible candidate for incompressible fluid solves. Finite element formulation for incompressible flow has been stabilized by a modified residual procedure proposed by Ilinca et.al.[5]. The present algorithm consists of four stages such as a gathering stage, a condensing stage, a solving stage and a scattering stage. At each level, a predetermined number of elements are gathered and condensed to form an element of higher level. At highest level, each subdomain consists of only one super-element. Thus, the inversion process of a stiffness matrix associated with internal degrees of freedom of each subdomain has been replaced by a sequential static condensation. The global algebraic system arising feom the assembly of each subdomains is solved using Conjugate Gradient Squared(CGS) method. In this case, pre-conditioning techniques usually accompanied by iterative solvers are not needed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3384-3390
• /
• 2011

This paper describes a domain decomposition method of parallel finite element analysis for elasto-plastic structural problems. As a parallel numeral algorithm for the finite element analysis, the authors have utilized the domain decomposition method combined with an iterative solver such as the conjugate gradient method. Here the domain decomposition method algorithm was applied directly to elasto-plastic problem. The present system was successfully applied to three-dimensional elasto-plastic structural problems.

• Journal of Korean Society for Quality Management
• /
• v.31 no.2
• /
• pp.117-130
• /
• 2003

This paper investigates the economic design of synthetic control charts. The synthetic control chart has been proven to be statistically superior to the $\bar{X}$-control chart, but its economic characteristics have not been known. We develop an economic model of the synthetic control chart, based on Duncan's model. The synthetic chart has one more decision variable, the lower control limit for the conforming run length. In addition to this, the significance level and the power of the synthetic chart are more complicated than those of the $\bar{X}$-chart. These features make the optimization problem more difficult. We propose an optimization algorithm by adapting the congruent gradient algorithm. We compare the optimal cost of the synthetic chart with that of (equation omitted)-control chart, under the same input parameter set of Duncan’s. For all cases investigated, the synthetic chart shows superior to the $\bar{X}$-chart. The synthetic control chart is easy to implement, and it has better characteristics than the $\bar{X}$-chart in economical sense as well as in statistical sense, so it will be a good alternative to the traditional control charts.

• Communications for Statistical Applications and Methods
• /
• v.21 no.5
• /
• pp.423-433
• /
• 2014

Test statistics using cumulative sums of residuals have been widely used in various regression models including generalized linear models(GLM). Recently, Pan and Lin (2005) extended this testing procedure to the generalized linear mixed models(GLMM) having random effects, in which we encounter difficulties in computing the marginal likelihood that is expressed as an integral of random effects distribution. The Gaussian quadrature algorithm is commonly used to approximate the marginal likelihood. Many commercial statistical packages provide an option to apply this type of goodness-of-fit test in GLMs but available programs are very rare for GLMMs. We suggest a computational algorithm to implement the testing procedure in GLMMs by a freely accessible R package, and also illustrate through practical examples.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.146-152
• /
• 2000

Two and Three dimensional dynamic adaptation code is developed for transient computations. This code involves mesh refinement and coarsening to either add points in high gradient regions of flow or remove points where they are not needed, for high spatial accuracy. Temporary cell algorithm is used to maintain the original grid quality. To show the assessment of the accuracy and efficiency, two dimensional study and unsteady flows are computed. Also, three dimensional steady computations are made to assess the refinement using temporary cell algorithm. The result shows the high spatial accuracy primarily in discontinuity regions in steady and unsteady computation.