• 대한원격탐사학회지
• /
• 제23권5호
• /
• pp.455-464
• /
• 2007

Lee(2007) suggested the Point-Jacobian iteration MAP estimation(PJIMAP) for noise removal of the images that are corrupted by multiplicative speckle noise. It is to find a MAP estimation of noisy-free imagery based on a Bayesian model using the lognormal distribution for image intensity and an MRF for image texture. 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. In this study, the MAP estimation is computed by the Point-Jacobian iteration using adaptive parameters. At each iteration, the parameters related to the Bayesian model are adaptively estimated using the updated information. The results of the proposed scheme were compared to them of PJIMAP with SAR simulation data generated by the Monte Carlo method. The experiments demonstrated an improvement in relaxing speckle noise and estimating noise-free intensity by using the adaptive parameters for the Ponit-Jacobian iteration.

• Journal of information and communication convergence engineering
• /
• 제8권2호
• /
• pp.228-233
• /
• 2010

In this paper, the iteration localization algorithm that NLOS signal is iteratively removed to get the exact location in the wireless sensor network is proposed. To evaluate the performance of the proposed algorithm, TDOA location estimation method is used, and readers are located on every 150m intervals with rectangular shape in $300m{\times}300m$ searching field. In that searching field, the error distance is analyzed according to increasing the number of iteration, sub-blink and the estimated sensor node locations which are located in the iteration range. From simulation results, the error distance is diminished according to increasing the number of the sub-blink and iteration with the proposed location estimation algorithm in NLOS environment. Therefore, to get more accurate location information in wireless sensor network in NLOS environments, the proposed location estimation algorithm removing NLOS signal effects through iteration scheme is suitable.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1990년도 추계학술대회 논문집 학회본부
• /
• pp.421-424
• /
• 1990

An iterative learning control scheme for exact-tracking control and parameter estimation of uncertain robotic systems is presented. In the learning control structure, tracking and feedforward input converge globally and asymptotically as iteration increases. Since convergence of parameter errors depends only on the persistent exciting condition of system trajectories along the iteration independently of length of trajectories, it may be achieved with only system trajectories of small duration. In addition, these learning control schemes are expected to be effectively applicable to time-varying parametric systems as well as time-invariant systems, for the parameter estimation is performed at each fixed time along the iteration. Finally, no usage of acceleration signal and no in version of estimated inertia matrix in the parameter estimator makes these learning control schemes more feasible.

• 대한전기학회논문지
• /
• 제40권4호
• /
• pp.427-438
• /
• 1991

An iterative learning control scheme for exact-tracking control and parameter estimation of uncertain robotic system is preented. In the learning control structure, the control input converges globally and asymtotically to the desired input as iteration increases. Since convergence of parameter errors depends only on the persistent exciting condition of system trajectories along the iteration independently of the time-duration of trajectories, it may be achieved with system trajectories with small duration. In addition, the proposd learning control schemes are applicable to time-varying parametric systems as well as time-invariant systems, because the parameter estimation is performed at each fixed time along the iteration. In the parameter estimator, the acceleration information as well as the inversion of estimated inertia matrix are not used at all, which makes the proposed learning control schemes more feasible.

• 한국항공우주학회지
• /
• 제41권7호
• /
• pp.532-538
• /
• 2013

본 논문은 편대비헹에서 영상만을 이용하여 선도기의 자세를 예측 하는 알고리즘 개발에 대해 논하고 있다. X-PLANE 시뮬레이터를 이용하여 획득한 영상에 SURF(Speed Up Robust Features)알고리즘을 이용하여 특징점을 추출 하였다. 그리고 자세예측 방법은 POSIT(Pose from Orthography and Scaling with Iteration) 알고리즘을 사용하였다. 결론적으로 우리는 영상만을 이용한 자세추정법이 $1.1{\sim}1.76^{\circ}$의 작은 추정오차 결과를 나타냄을 확인할 수 있었다.

• Nuclear Engineering and Technology
• /
• 제50권6호
• /
• pp.854-859
• /
• 2018

Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculated or if the accuracy of the quantification result is in doubt, the Monte Carlo method can provide an alternative for fault tree quantification. The Monte Carlo method for fault tree quantification tends to take a long time because it repeats the calculation for a large number of samples. Herein, proposal is made to improve the quantification algorithm of a fault tree with circular logic. We developed a top-down iteration algorithm that combines the characteristics of the top-down approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
• /
• pp.165-168
• /
• 2000

The bit error rate(BER)of the data passed through Wideband-Code Division Multiple Access (W-CDMA) system with turbo-codes structure is presented. The performance of turbo-codes under W-CDMA system is estimated for various users and iteration numbers of decoding. The channel model is Additive White Gaussian Noise(AWGN) and Rayleigh fading channel. When iteration number increases, bit error probability of turbo-codes decreases. and when the number of users increase, bit error probability of turbo-codes increases.

• 대한원격탐사학회지
• /
• 제25권3호
• /
• pp.295-309
• /
• 2009

In this study, an iterative maximum a posteriori (MAP) approach using a Bayesian model of Markovrandom field (MRF) was proposed for despeckling images that contains speckle. Image process is assumed to combine the random fields associated with the observed intensity process and the image texture process respectively. The objective measure for determining the optimal restoration of this "double compound stochastic" image process is based on Bayes' theorem, and the MAP estimation employs the Point-Jacobian iteration to obtain the optimal solution. In the proposed algorithm, MRF is used to quantify the spatial interaction probabilistically, that is, to provide a type of prior information on the image texture and the neighbor window of any size is defined for contextual information on a local region. However, the window of a certain size would result in using wrong information for the estimation from adjacent regions with different characteristics at the pixels close to or on boundary. To overcome this problem, the new method is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The proximity to boundary is estimated using a non-uniformity measurement based on standard deviation of local region. The new scheme has been extensively evaluated using simulation data, and the experimental results show a considerable improvement in despeckling the images that contain speckle.

• Communications for Statistical Applications and Methods
• /
• 제12권2호
• /
• pp.285-294
• /
• 2005

This paper deals with the comparison of parameter estimation methods in a 3-parameter Kappa distribution which is sometimes used in flood frequency analysis. Method of moment estimation(MME), L-moment estimation(L-ME), and maximum likelihood estimation(MLE) are applied to estimate three parameters. The performance of these methods are compared by Monte-carlo simulations. Especially for computing MME and L-ME, three dimensional nonlinear equations are simplified to one dimensional equation which is calculated by the Newton-Raphson iteration under constraint. Based on the criterion of the mean squared error, L-ME (or MME) is recommended to use for small sample size( n$\le$100) while MLE is good for large sample size.

• 인터넷정보학회논문지
• /
• 제15권4호
• /
• pp.119-124
• /
• 2014

송신 심볼점과 동일한 확률분포 모양을 갖도록 수신단에서 무작위로 발생시킨 N개의 랜덤 샘플에 대한 확률밀도함수와, 시스템 출력샘플들에 대한 확률밀도함수 사이의 ED 를 기반으로 설계된 블라인드 적응 시스템은 수렴에 이르렀는지 평가하거나 최소 ED 평가를 위해 매 샘플시간 마다 ED 값을 계산한다. 그런데 이 ED 값 추정은 블록 데이터 계산방식으로서 계산량이 많다는 문제점을 지니고 있다. 이 논문에서는 과도한 계산량을 줄일 수 있는 방법으로서 현재 샘플 시간의 ED 값과 다음 샘플 시간의 ED 값 사이의 관계와 다음 샘플시간의 ED 값 계산에 현재 계산된 ED 값을 활용할 수 있는 반복적 ED 추정방법을 제안하였다. 기존의 블록 처리 ED 방법은 계산량 $O(N^2)$을 가지는데 반해 반복적 ED 방법은 계산량 O(N)을 가지며, 시뮬레이션 결과에서 두 방식이 정확히 일치하는 추정결과를 산출하였다.