• Wind and Structures
• /
• v.5 no.5
• /
• pp.423-440
• /
• 2002

The effects of the nonlinear (quadratic) term in wind pressure have been analyzed in many papers with reference to linear structural models. The present paper addresses the problem of the response of nonlinear structures to stochastic nonlinear wind pressure. Adopting a single-degree-of-freedom structural model with polynomial nonlinearity, the solution is obtained by means of the moment equation approach in the context of It$\hat{o}$'s stochastic differential calculus. To do so, wind turbulence is idealized as the output of a linear filter excited by a Gaussian white noise. Response statistical moments are computed for both the equivalent linear system and the actual nonlinear one. In the second case, since the moment equations form an infinite hierarchy, a suitable iterative procedure is used to close it. The numerical analyses regard a Duffing oscillator, and the results compare well with Monte Carlo simulation.

• Proceedings of the CALSEC Conference
• /
• 2005.03a
• /
• pp.207-211
• /
• 2005

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.14-30
• /
• 1985

Recently, multiple criteria decision making has been well established as a practical approach to seek a satisfactory solution to a decision making problem. Goal programming is one of the most powerful MCDM tools with satisfying operational assumptions that reflect the actual decision making process in real-world situations. In this paper we propose an efficient method implemented on a microcomputer for solving linear goal programming problems. It is an iterative revised goal simplex method using the sparsity technique. We design as interactive software package for microcomputers based on this method. From some computational experiences, we can state that the revised iterative goal simplex method using the sparsity technique is the most efficient one for microcomputer for solving goal programming problems.

• Proceedings of the KSRS Conference
• /
• 2007.03a
• /
• pp.126-129
• /
• 2007

In this paper, an iterative MAP approach using a Bayesian model based on the lognormal distribution for image intensity and a GRF for image texture is proposed for despeckling the SAR images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel type s as states of molecules in a lattice-like physical system defined on a GRF. Because of the MRFGRF equivalence, the assignment of an energy function to the physical system determines its Gibbs measure, which is used to model molecular mteractions. The proposed adaptive iterative method was evaluated using simulation data generated by the Monte Carlo method. In the extensive experiments of this study, the proposed method demonstrated the capability to relax speckle noise and estimate noise-free intensity.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.247-250
• /
• 2008

The paper presents the advanced radiometric calibration method, called the lRCM (Iterative Radiometric Calibration Method), in order to avoid an operational constraint (solar source) for calibration. The IRCM assumes that an optical instrument is equipped with a filter assembly which consists of same band filters with different transmission ratios. Given all the noise sources (including the artificial one caused by the filters) of an image sensor, the noncentral ${\chi}^2$ distribution of the output result is induced by the approach of a noise PDF (Power Density Function). Finally, the radiometric calibration problem is transformed into equating two independent relations for the image sensor gains through the specified distribution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.743-747
• /
• 2010

This paper presents an iterative adaptive hybrid image restoration algorithm for fast convergence. The local variance, mean, and maximum value are used to constrain the solution space. These parameters are computed at each iteration step using partially restored image at each iteration, and they are used to impose the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed and better performance than typical regularized constrained least squares (RCLS) approach.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1251-1258
• /
• 2015

We investigate an image recovery method for sparse-view computed tomography (CT) using an iterative shrinkage algorithm based on a second-order approach. The two-step iterative shrinkage-thresholding (TwIST) algorithm including a total variation regularization technique is elucidated to be more robust than other first-order methods; it enables a perfect restoration of an original image even if given only a few projection views of a parallel-beam geometry. We find that the incoherency of a projection system matrix in CT geometry sufficiently satisfies the exact reconstruction principle even when the matrix itself has a large condition number. Image reconstruction from fan-beam CT can be well carried out, but the retrieval performance is very low when compared to a parallel-beam geometry. This is considered to be due to the matrix complexity of the projection geometry. We also evaluate the image retrieval performance of the TwIST algorithm -sing measured projection data.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.1
• /
• pp.227-237
• /
• 2004

In this paper we presented a Bayesian inference approach for estimating the location and scale parameters of the lognormal distribution using iterative Gibbs sampling algorithm. We also presented estimation of location parameter by two non iterative methods, importance sampling and weighted bootstrap assuming scale parameter as known. The estimates by non iterative techniques do not depend on the specification of hyper parameters which is optimal from the Bayesian point of view. The estimates obtained by more sophisticated Gibbs sampler vary slightly with the choices of hyper parameters. The objective of this paper is to illustrate these tools in a simpler setup which may be essential in more complicated situations.

• Coupled systems mechanics
• /
• v.6 no.4
• /
• pp.501-522
• /
• 2017

This paper introduces a numerical procedure to incorporate elasto-plastic local deformation effects in the dynamic analysis of beams. The appealing feature is that simple beam type finite elements can be used for the global model which needs not to be altered by the localized elasto-plastic deformations. An overlapping local sophisticated 2D membrane model replaces the internal forces of the beam elements in the predefined region where the localized deformations take place. An iterative coupling technique is used to perform this replacement. Comparisons with full membrane analysis are provided in order to illustrate the accuracy and efficiency of the method developed herein. In this study, the membrane formulation is able to capture the elasto-plastic material behaviour based on the von Misses yield criterion and the associated flow rule for plane stress. The Newmark time integration method is adopted for the step-by-step dynamic analysis.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.40-49
• /
• 2016

In this paper, we present a symbol-level iterative source-channel decoding (ISCD) algorithm for reliable transmission of variable-length codes (VLCs). Firstly, an improved source a posteriori probability (APP) decoding approach is proposed for packetized variable-length encoded Markov sources. Also proposed is a recursive implementation based on a three-dimensional joint trellis for symbol decoding of binary convolutional codes. APP channel decoding on this joint trellis is realized by modification of the Bahl-Cocke-Jelinek-Raviv algorithm and adaptation to the non-stationary VLC trellis. Simulation results indicate that the proposed ISCD scheme allows to exchange between its constituent decoders the symbol-level extrinsic information and achieves high robustness against channel noises.