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

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.119-130
• /
• 2023

We propose a quantized gradient search algorithm that can achieve global optimization by monotonically reducing the quantization step with respect to time when quantization is composed of integer or fixed-point fractional values applied to an optimization algorithm. According to the white noise hypothesis states, a quantization step is sufficiently small and the quantization is well defined, the round-off error caused by quantization can be regarded as a random variable with identically independent distribution. Thus, we rewrite the searching equation based on a gradient descent as a stochastic differential equation and obtain the monotonically decreasing rate of the quantization step, enabling the global optimization by stochastic analysis for deriving an objective function. Consequently, when the search equation is quantized by a monotonically decreasing quantization step, which suitably reduces the round-off error, we can derive the searching algorithm evolving from an optimization algorithm. Numerical simulations indicate that due to the property of quantization-based global optimization, the proposed algorithm shows better optimization performance on a search space to each iteration than the conventional algorithm with a higher success rate and fewer iterations.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.361-369
• /
• 2001

This thesis describes the design of a stabilized algorithm for shipboard satellite antenna systems which can enhance the tracking performance. In order to overcome some drawbacks of the conventional step tracking algorithm, the proposed algorithm searches for the best tracking angles using gradient-based formulae and signal intensities measured according to a search pattern. The effectiveness of the proposed algorithm is demonstrated through simulation using real-world data.

• Journal of Advanced Marine Engineering and Technology
• /
• v.25 no.5
• /
• pp.1115-1121
• /
• 2001

This paper presents the development of a tracking algorithm for shipborad satellite antenna systems which can enhance the tracking performance. In order to overcome some drawbacks of the conventional step tracking algorithm a new tracking algorithm is proposed. The proposed algorithm searches for the best tracking angles using gradient-based formulae and signal intensities measured according to a search pattern. The effectiveness of the proposed algorithm is demonstrated through simulation using real data.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2001.05a
• /
• pp.219-224
• /
• 2001

This paper presents the development of a tracking algorithm for shipboard satellite antenna systems which can enhance the tracking performance. In order to overcome some drawbacks of the conventional step tracking algorithm, the proposed algorithm searches for the best tracking angles using gradient-based formulae and signal intensities measured according to a search pattern. The effectiveness of the proposed algorithm is demonstrated through simulation using real-world data.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.408-410
• /
• 2003

In this paper, an improved gradient direction assisted linking algorithm is proposed. This algorithm begins with initial seeds satisfying some local criteria. Then it will search along the direction provided by the initial point. A window will be generated in the gradient direction of the current point. Instead of the conventional method which only considers the value of the local salient structure, an improved mathematical model is proposed to describe the desired linear features. This model not only considers the value of the salient structure but also the direction of it. Furthermore, the linking problem under this model can be efficiently solved by dynamic programming method. This algorithm is tested for linear features detection in IKONOS images. The result demonstrates this algorithm is quite promising.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• Atmosphere
• /
• v.26 no.3
• /
• pp.461-471
• /
• 2016

A quality check algorithm for the Weather Information Service Engine pulsed Doppler wind lidar is developed from a view point of spatial and temporal consistencies of observed wind speed. Threshold values for quality check are determined by statistical analysis on the standard deviation of 3-component of wind speed obtained by a wind lidar, and the vertical gradient of horizontal wind speed obtained by a radiosonde system. The algorithm includes carrier-to-noise ratio (CNR) check, data availability check, and vertical gradient of horizontal wind speed check. That is, data sets whose CNR is less than -29 dB, data availability is less than 90%, or vertical gradient of horizontal wind speed is less than $-0.028s^{-1}$ or larger than $0.032s^{-1}$ are classified as 'doubtful', and flagged. The developed quality check algorithm is applied to data obtained at Bucheon station for the period from 1 to 30 September 2015. It is found that the number of 'doubtful' data shows maxima around 2000 m high, but the ratio of 'doubtful' to height-total data increases with increasing height due to atmospheric boundary height, cloud, or rainfall, etc. It is also found that the quality check by data availability is more effective than those by carrier to noise ratio or vertical gradient of horizontal wind speed to remove an erroneous noise data.

• Journal of the Korean earth science society
• /
• v.32 no.6
• /
• pp.595-601
• /
• 2011

In this paper, I propose the algorithm that the location of a magnetic dipole can be detected from the magnetic gradient tensor. I induce the location vector of a vertically magnetizated dipole from the magnetic gradient tensor. Deficit of magnetic moment of magnetic dipole makes the induced location information incomplete. However, if the observation of magnetic gradient tensor would be collected on more points, the algorithm is able to catch the location of the magnetic dipole by clustering the solution of the proposed algorithm. For example, I show that the synthetic case of borehole observation of magnetic gradient tensor can find the source location successively by picking common solution area.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.373-373
• /
• 2000

In this paper, we propose a fuzzy modeling algorithm which divides the input space more efficiently than convention methods by taking into consideration correlations between components of sample data. The proposed fuzzy modeling algorithm consists of two steps: coarse tuning, which determines consequent parameters approximately using FCRM clustering method, and fine tuning, which adjusts the premise and consequent parameters more precisely by gradient descent algorithm. To evaluate the performance of the proposed fuzzy mode, we use the numerical data of nonlinear function.