• Korean Journal of Remote Sensing
• /
• v.21 no.5
• /
• pp.417-423
• /
• 2005

A fuzzy approach using an EM algorithm for image classification is presented. In this study, a double compound stochastic image process is assumed to combine a discrete-valued field for region-class processes and a continuous random field for observed intensity processes. The Markov random field is employed to characterize the geophysical connectedness of a digital image structure. The fuzzy classification is an EM iterative approach based on mixture probability distribution. Under the assumption of the double compound process, given an initial class map, this approach iteratively computes the fuzzy membership vectors in the E-step and the estimates of class-related parameters in the M-step. In the experiments with remotely sensed data, the MRF-based method yielded a spatially smooth class-map with more distinctive configuration of the classes than the non-MRF approach.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.10a
• /
• pp.75-80
• /
• 1999

This paper presents a new method to find a optimal solution for stochastic system. This method uses Genetic Algorithm(GA) and simulation. GA is used to search for new alternative and simulation is used to evaluate alternative. The stochastic system has one or more random variables as inputs. Random inputs lead to random outputs. Since the outputs are random, they can be considered only as estimates of the true characteristics of they system. These estimates could greatly differ from the corresponding real characteristics for the system. We need multiple replications to get reliable information on the system. And we have to analyze output data to get a optimal solution. It requires too much computation to be practical. We address the problem of reducing computation. The procedure on this paper use GA character, an iterative process, to reduce the number of replications. The same chromosomes could exit in post and present generation. Computation can be reduced by using the information of the same chromosomes which exist in post and present current generation.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.505-508
• /
• 2000

The success of target reconstruction in SAR(Synthetic Aperture Radar) imaging system is greatly dependent on the coherent detection. Primary causes of incoherent detection are uncompensated target or sensor motion, random turbulence in propagation media, wrong path in radar platform, and etc. And these appear as multiplicative phase error to the echoed signal, which consequently, causes fatal degradations such as fading or dislocation of target image. In this paper, we present iterative phase error estimation scheme which uses echoed data in all temporal frequencies. We started with analyzing wave equation for one point target and extend to overall echoed data from the target scene - The two wave equations governing the SAR signal at two temporal frequencies of the radar signal are combined to derive a method to reconstruct the complex phase error function. Eventually, this operation attains phase error correction algorithm from the total received SAR signal. We verify the success of the proposed algorithm by applying it to the simulated spotlight-mode SAR data.

• Communications for Statistical Applications and Methods
• /
• v.31 no.1
• /
• pp.65-85
• /
• 2024

The tail probability of a function of a multivariate random variable is not easy to estimate by the crude Monte Carlo simulation. When the occurrence of the function value over a threshold is rare, the accurate estimation of the corresponding probability requires a huge number of samples. When the explicit form of the cumulative distribution function of each component of the variable is known, the inverse transform likelihood ratio method is directly applicable scheme to estimate the tail probability efficiently. The method is a type of the importance sampling and its efficiency depends on the selection of the importance sampling distribution. When the cumulative distribution of the multivariate random variable is represented by a copula and its marginal distributions, we develop an iterative algorithm to find the optimal importance sampling distribution, and show the convergence of the algorithm. The performance of the proposed scheme is compared with the crude Monte Carlo simulation numerically.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.451-461
• /
• 2009

The Adaptive Random Testing(ART) aims to improve the performance of traditional Random Testing(RT) by reducing the number of test cases to find the failure region which is located in the input domain. Such enhancement can be obtained by efficient selection algorithms of test cases. The ART through Iterative Partitioning(IP-ART) is one of ART techniques and it uses an iterative input domain partitioning method to improve the performance of early-versions of ART which have significant drawbacks in computation time. And the IP-ART with Enlarged Input Domain(EIP-ART), an improved version of IP-ART, is known to make additional performance improvement with scalability by expanding to virtual test space beyond real input domain of IP-ART. The EIP-ART algorithm, however, have the drawback of heavy cost of computation time to generate test cases mainly due to the virtual input domain enlargement. For this reason, two algorithms are proposed in this paper to mitigate the computation overhead of the EIP-ART. In the experiments by simulations, the tiling technique of input domain, one of two proposed algorithms, showed significant improvements in terms of computation time and testing performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4567-4583
• /
• 2021

This study proposes an analytical approximation algorithm based on extreme value theory (EVT) for the inverse of the power of the incomplete Gamma function. First, the Gumbel function is used to approximate the power of the incomplete Gamma function, and the corresponding inverse problem is transformed into the inversion of an exponential function. Then, using the tail equivalence theorem, the normalized coefficient of the general Weibull distribution function is employed to replace the normalized coefficient of the random variable following a Gamma distribution, and the approximate closed form solution is obtained. The effects of equation parameters on the algorithm performance are evaluated through simulation analysis under various conditions, and the performance of this algorithm is compared to those of the Newton iterative algorithm and other existing approximate analytical algorithms. The proposed algorithm exhibits good approximation performance under appropriate parameter settings. Finally, the performance of this method is evaluated by calculating the thresholds of space-time block coding and space-frequency block coding pattern recognition in multiple-input and multiple-output orthogonal frequency division multiplexing. The analytical approximation method can be applied to other related situations involving the maximum statistics of independent and identically distributed random variables following Gamma distributions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.64-76
• /
• 2009

Adaptive Random Testing through Iterative Partitioning(IP-ART) is one of Adaptive Random Testing(ART) techniques. IP-ART uses an iterative partitioning method for input domain to improve the performances of early-versions of ART that have significant drawbacks in computation time. Another version of IP-ART, named with EIP-ART(IP-ART with Enlarged Input Domain), uses virtually enlarged input domain to remove the unevenly distributed parts near the boundary of the domain. EIP-ART could mitigate non-uniform test case distribution of IP-ART and achieve relatively high performances in a variety of input domain environments. The EIP-ART algorithm, however, have the drawback of higher computation time to generate test cases mainly due to the additional workload from enlarged input domain. For this reason, a revised version of IP-ART without input domain enlargement needs to improve the distribution of test cases to remove the additional time cost. We explore three smoothing algorithms which influence the distribution of test cases, and analyze to check if any performance improvements take place by them. The simulation results show that the algorithm of a restriction area management achieves better performance than other ones.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.14 no.4
• /
• pp.365-375
• /
• 2014

This paper proposes an abnormal V-shaped-error-free non-blind deconvolution technique featuring an adaptively segmented forward-problem based iterative deconvolution (ASDCN) process. Unlike the algebraic based inverse operations, this eliminates any operations of differential and division by zero to successfully circumvent the issue on the abnormal V-shaped error. This effectiveness has been demonstrated for the first time with applying to a real analysis for the effects of the Random Telegraph Noise (RTN) and/or Random Dopant Fluctuation (RDF) on the overall SRAM margin variations. It has been shown that the proposed ASDCN technique can reduce its relative errors of RTN deconvolution by $10^{13}$ to $10^{15}$ fold, which are good enough for avoiding the abnormal ringing errors in the RTN deconvolution process. This enables to suppress the cdf error of the convolution of the RTN with the RDF (i.e., fail-bit-count error) to $1/10^{10}$ error for the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.611-617
• /
• 2010

In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.

• Nuclear Engineering and Technology
• /
• v.33 no.1
• /
• pp.25-33
• /
• 2001

To determine the pin power distribution without disassembling, HANARO fuel assemblies are gamma-scanned and then the distribution is reconstructed tv using the tomography method. The iterative least squares method (ILSM and the wavelet singular value decomposition method (WSVD) are chosen to solve the problem. An optimal convergence criterion is used to stop the iteration algorithm to overcome the potential divergence in ILSM. WSVD gives better results than ILSM , and the average values from the two methods give the best results. The RMSE (root mean square errors) to the reference data are 5.1, 6.6, 5.0, 6.5, and 6.4% and the maximum relative errors are 10.2, 13.7, 12.2, 13.6, and 14.3%, respectively. It is found that the effect of random positions of the pins is important. Although the effect can be accommodated by the iterative calculations simulating the random positions, the use of experimental equipment with a slit covering the whole range of the assembly horizontally is recommended to obtain more accurate results. We made a new apparatus using the results of this study and are conducting an experiment in order to obtain more accurate results.