• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.109-117
• /
• 1997

A new relaxation algorithm based on distribution of matched errors and possibility is proposed to solve efficiently correspondence problem. This algorithm can be applied to various method, such as BMA, feature-, and region-based matching methods, by modifying its smoothness function. It consists of two stages which are transformation and iteration process. In transformation stage, the errors obtained by any matching algorithm are transformed to possibility values according to these statistical distribution. Each grade of possility is updated by some constraints which are defined as smoothness, uniqueness, and discontinuity factor in iteration stage. The discontinuity factor is used to reserve discontinuity of disparity. In conventional methods, it is difficult to find proper weights and stop condition, because only two factors, smoothness and uniqueness, have been used. However, in the proposed mthod, the more smoothing is not ocurred because of discontinuity factor. And it is efective to the various image, even if the image has a severe noise and repeating patterns. In addition, it is shown that the convergence rate and the quality of output are improved.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.270-273
• /
• 2007

In this paper, a SAR-despeck1ing approach of adaptive iteration based a Bayesian model using the lognormal distribution for image intensity and a Gibbs random field (GRF) for image texture is proposed for noise removal of the 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 types as states of molecules in a lattice-like physical system. The iterative approach based on MRF is very effective for the inner areas of regions in the observed scene, but may result in yielding false reconstruction around the boundaries due to using wrong information of adjacent regions with different characteristics. The proposed method suggests an adaptive approach using variable parameters depending on the location of reconstructed area, that is, how near to the boundary. The proximity of boundary is estimated by the statistics based on edge value, standard deviation, entropy, and the 4th moment of intensity distribution.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.306-312
• /
• 2000

In this paper, the efficient architecture of small Reed-solomon architecture is suggested. Here, 3-stage pipeline is adopted. In decoding, error-location polynomials are obtained by BMA using fast iteration method, and syndrome polynomials, where calculation complexity is required, are obtained by parallel calculation using ROM table, and the roots of error location polynomial are calculated by ROM table using Chein search algorithm. In the suggested decoder, it is confirmed that 3 symbol random errors can be corrected and 124Mbps decoding rate is obtained using 25 Mhz system clock.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.72-78
• /
• 1997

This paper presents a fuzzy relaxation algorithm, which is based on the possibility and FAM instead of he probability and compatibility coefficients used in most of existing probabilistic relaxation algorithms, Because of eliminating stages for estimating of compatibility coefficients and normalization of the probability estimates, the proposed fuzzy relaxation algorithms increases the parallelism and has a simple iteration scheme. The construction of fuzzy relaxation scheme consists of the following three tasks: (1) definition of in/output linguistic variables, their term sets, and possibility. (2) Definition of FAM rule bases for relaxation using fuzzy compound relations. (3) Construction of the iteration scheme for calculating the new possibility estimate. Applications to region segmentation an ege detectiojn algorithms show that he proposed method can be used for not only reducing the image ambiguity and segmentation errors, but also enhancing the raw edge iteratively.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.218-223
• /
• 2008

A new Pareto-optimal design algorithm, requiring least computational work, is proposed for a single phase AC solenoid actuator with multi-design-objectives: maximizing holding force and minimizing eddy current loss simultaneously. In the algorithm, the design space is successively reduced by a suitable factor, as iteration repeats, with the center of pseudo-optimal point. At each iteration, the objective functions are approximated to a simple second-order response surface with the CCD sampling points generated within the reduced design space, and Pareto-optimal solutions are obtained by applying($1+{\lambda}$) evolution strategy with the fitness values of Pareto strength.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.76-78
• /
• 1993

This paper describes an efficient method of computing any desired number of the most unstable eigenvalues and eigenvectors of a large scale multi-machine power system. Approximate eigenvalues obtained by Hessenberg process are refined using Rayleigh quotient iteration with cubic convergence property. If further eigenvalues and eigenvectors are needed, the procedure described above are repeated with deflation. The proposed algorithm can cover all the model types of synchronous machines, exciters, speed governing system and PSS defined in AESOPS. The proposed algorithm applied to New England test system with 10 machines and 39 buses produced the results same with AESOPS in faster computation time. Also eigenvectors computed in Rayleigh quotient iteration makes it possible to make eigen-analysis for improving unstable modes.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.3
• /
• pp.164-168
• /
• 2012

LDPC decoder architectures are generally classified into serial, parallel and partially parallel architectures. Conventional method of LDPC decoding in general give rise to a large number of computation operations, mass power consumption, and decoding delay. It is necessary to reduce the iteration numbers and computation operations without performance degradation. This paper studies Horizontal Shuffle Scheduling (HSS) algorithm. In the result, number of iteration is half than conventional algorithm without performance degradation. Finally, this paper present design methodology of high-speed LDPC decoder and confirmed its throughput is up to about 600Mbps.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.5
• /
• pp.409-412
• /
• 2004

This paper shows that the proposed Turbo TCM(Turbo Trellis Coded Modulation) has a good performance with a little complexity of decoder. The encoder structure, which is connected with Turbo Codes, is the proposed modulation technique for an efficient bandwidth, This method is used symbol by symbol MAP decoder of iteration similar to binary Turbo Codes in the receiver. The result shows that the BER performance according to iteration is improved about 2,5dB at $BER=10^{-2}$ compared to Turbo Codes with Gray mapping.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1999.10a
• /
• pp.147-154
• /
• 1999

This paper presents a procedure for the frequency-domain analysis of a non-proportionally damped structure subjected to stationary seismic loads and for the finding of proper damper locations through simple analysis procedure without iteration. The shear areas of the dampers are decided in proportion to the magnitude of the components of the primary mode shape vector and to the root mean square values of the story drifts, The root-mean-squear responses are obtained using a power spectral density function for the ground acceleration. the results are compared with those obtained from damper placement decided in sequency based on the maximum story drift. According to the results the reliability of the proposed method turns out to be satisfactory compared to the methods which required iteration.

• Transactions of The Korea Fluid Power Systems Society
• /
• v.5 no.3
• /
• pp.15-22
• /
• 2008

The road simulators have become common tools within the automotive industry for evaluation of vehicle and vehicle system durability performance. These simulators need appropriate input signal generation algorithms to realize the actual driving conditions due to non-linear vehicle and test rig behaviour. Although somewhat unconventional from a control standpoint, the iteration approach has proven to be a very effective method for control of complex, multiple degree-of-freedom systems where the tracking parameter is known a priori. In this paper, the road profile replication algorithm is verified by applying Belgian road to the developed road simulator. The simulation and experimental results are included to evaluate the performance of this simulator. This road simulator provides considerable savings in cost, development time, and testing risk during developing automotive components.