• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.12
• /
• pp.985-992
• /
• 2001

This paper proposes a self-organizing fuzzy modeling(SOFUM)which an create a new hyperplane shaped cluster and adjust parameters of the fuzzy model in repetition. The suggested algorithm SOFUM is composed of four steps: coarse tuning. fine tuning cluster creation and optimization of learning rates. In the coarse tuning fuzzy C-regression model(FCRM) clustering and weighted recursive least squared (WRLS) algorithm are used and in the fine tuning gradient descent algorithm is used to adjust parameters of the fuzzy model precisely. In the cluster creation, a new hyperplane shaped cluster is created by applying multiple regression to input/output data with relatively large fuzzy entropy based on parameter tunings of fuzzy model. And learning rates are optimized by utilizing meiosis-genetic algorithm in the optimization of learning rates To check the effectiveness of the suggested algorithm two examples are examined and the performance of the identified fuzzy model is demonstrated via computer simulation.

• Journal of Biomedical Engineering Research
• /
• v.23 no.2
• /
• pp.101-107
• /
• 2002

This paper presents a segmentation algorithm to extract endocardial contour and epicardial contour of left ventricle in MR Cardiac images. The algorithm is based on a generalized gradient vector flow(GGVF) snake and a prediction of initial contour(PIC). Especially. the proposed algorithm uses physical characteristics of endocardial and epicardial contours, cross profile correlation matching(CPCM), and a mixed interpolation model. In the experiment, the proposed method is applied to short axis MR cardiac image set, which are obtained by Siemens, Medinus, and GE MRI Systems. The experimental results show that the proposed algorithm can extract acceptable epicardial and endocardial walls. We calculate quantitative parameters from the segmented results, which are displayed graphically. The segmented left vents role is visualized volumetrically by surface rendering. The proposed algorithm is implemented on Windows environment using Visual C ++.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.156-169
• /
• 1997

This paper proposes an image segmentation technique using watershed algorithm followed by region merging method. A gradient image is obtained by applying multiscale gradient algorithm to the image simplified by morphological filters. Since the watershed algorithm produces the oversegmented image. it is necessary to merge small segmented regions as wel]' as region having similar characteristics. For region merging. we utilize the merging criteria based on both the mean value of the pixels of each region and the edge intensities between regions obtained by the contour following process. Experimental results show that the proposed method produces meaningful image segmentation results.

• Smart Structures and Systems
• /
• v.22 no.3
• /
• pp.359-368
• /
• 2018

A method is proposed for the identification of instantaneous frequencies (IFs) in time-varying structures. The proposed method combines a maximum gradient algorithm and a smoothing operation. The maximum gradient algorithm is designed to extract the wavelet ridges of response signals. The smoothing operation, based on a polynomial curve fitting algorithm and a threshold method, is employed to reduce the effects of random noises. To verify the effectiveness and accuracy of the proposed method, a numerical example of a signal with two frequency modulated components is investigated and an experimental test on a steel cable with time-varying tensions is also conducted. The results demonstrate that the proposed method can extract IFs from the noisy multi-component signals and practical response signals successfully. In addition, the proposed method can provide a better IF identification results than the standard synchrosqueezing wavelet transform.

• Journal of the Optical Society of Korea
• /
• v.16 no.4
• /
• pp.372-380
• /
• 2012

The optical method Digital Speckle Correlation Measurement (DSCM) has been extensively applied due its capability to measure the entire displacement field over a body surface. A formula of displacement measurement errors by the gradient-based DSCM method was derived. The errors were found to explicitly relate to the image grayscale errors consisting of sub-pixel interpolation algorithm errors, image noise, and subset deformation mismatch at each point of the subset. A power-law dependence of the standard deviation of displacement measurement errors on the subset size was established when the subset deformation was rigid body translation and random image noise was dominant and it was confirmed by both the numerical and experimental results. In a gradient-based algorithm the basic assumption is rigid body translation of the interrogated subsets, however, this is in contradiction to the real circumstances where strains exist. Numerical and experimental results also indicated that, subset shape function mismatch was dominant when the order of the assumed subset shape function was lower than that of the actual subset deformation field and the power-law dependence clearly broke down. The power-law relationship further leads to a simple criterion for choosing a suitable subset size, image quality, sub-pixel algorithm, and subset shape function for DSCM.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.3
• /
• pp.535-544
• /
• 2023

In this paper, we study the effect of gradient vector calculation method(analytical method, central finite difference method) on adaptive beamforming to control weight distribution during iterated calculation when LMS algorithm (repeating method) is used to realize desired beam pattern. To this end, a quasi-ideal beam having an arbitrarily set beam width, a rotating beam, and a multi-beam were reviewed as examples. Numerical experiments applied the step parameters of the appropriate values to the adaptive beamforming system through trial and error equally to the two calculations, and compared the convergence characteristics of objective functions that evaluate adaptability and error using two methods for calculating gradient vectors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1141-1162
• /
• 2024

Humidity is an important parameter in meteorology and is closely related to weather, human health, and the environment. Due to the limitations of the number of observation stations and other factors, humidity data are often not as good as expected, so high-resolution humidity fields are of great interest and have been the object of desire in the research field and industry. This study presents a novel super-resolution algorithm for humidity fields based on the Wasserstein generative adversarial network(WGAN) framework, with the objective of enhancing the resolution of low-resolution humidity field information. WGAN is a more stable generative adversarial networks(GANs) with Wasserstein metric, and to make the training more stable and simple, the gradient cropping is replaced with gradient penalty, and the network feature representation is improved by sub-pixel convolution, residual block combined with convolutional block attention module(CBAM) and other techniques. We evaluate the proposed algorithm using ERA5 relative humidity data with an hourly resolution of 0.25°×0.25°. Experimental results demonstrate that our approach outperforms not only conventional interpolation techniques, but also the super-resolution generative adversarial network(SRGAN) algorithm.

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.63-70
• /
• 2010

In this paper, we develop a nonmonotone spectral memory gradient method for unconstrained optimization, where the spectral stepsize and a class of memory gradient direction are combined efficiently. The global convergence is obtained by using a nonmonotone line search strategy and the numerical tests are also given to show the efficiency of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.11-17
• /
• 1983

In this paper, the application of the explicit M.R.A.C. algorithms to the D.C. motor speed control using the microprocessor is studied. The adaptation algorithms are derived from the gradient method and the exponentially weighted least square [E.W.L.S.] method. In order to minimize the computational instability of the E.W.L.S. method, the adaptation algorithm of UDUt factorization method is developed, and because of the characteristics of the D.C. motor (dead-aone phenomenon) , the SM. gra-dient type algorithm is also improved from the gradient type algorithm. Computer simulations and experiments show that these algorithms adapt well to the rapid change of the reference input and the load.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.1
• /
• pp.67-73
• /
• 2002

This paper presents the development of development of stabilization and tracking algorithms for a shipboard satellite antenna system. In order to stabilize the satellite antenna system designed in the previous work, a model for each control axis is derived and its parameters are estimated using a genetic algorithm, and the state feedback controller is designed based on the linearized model. Then a tracking algorithm is derived to overcome some drawbacks of the step tracking. The proposed algorithm searches for the best position using gradient-based formulae and signal intensities measured according to a search pattern. The effectiveness of both the stabilization and tracking algorithms is demonstrated through experiment using real-world data.