• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.18-20
• /
• 2006

The statistics for the neighbor differences between the particular pixels and their neighbors are introduced. They are incorporated into the filter to remove additive Gaussian noise contaminating images. The derived denoising method corresponds to the maximum likelihood estimator for the heavy-tailed Gaussian distribution. The error norm corresponding to our estimator from the robust statistics is equivalent to Huber's minimax norm. Our estimator is also optimal in the respect of maximizing the efficacy under the above noise environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.6
• /
• pp.93-99
• /
• 2007

Robust nonlinear image denoising algorithms for the class of ${\alpha}$-stable distribution are introduced. The proposed amplitude-limited sample average filter(ALSAF) proves to be the maximum likelihood estimator under the heavy-tailed Gaussian noise environments. The error norm for this estimator is equivalent to Huber#s minimax norm. It is optimal in the respect of maximizing the efficacy under the above noise environment. It is mired with the myriad filter to propose an amplitude-limited myriad filter(ALMF). The behavior and performance of the ALSAF and ALMF in ${\alpha}$-stable noise environment are illustrated and analyzed through simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.151-156
• /
• 2012

In this paper robust nonlinear image denoising algorithms are introduced for the distribution which is Gaussian in the center and Laplacian in the tails. The distribution is known as the least favorable ${\epsilon}$-contaminated normal distribution that maximizes the asymptotic variance. The proposed filter proves to be the maximum likelihood estimator under the heavy-tailed Gaussian noise environments. It is optimal in the respect of maximizing the efficacy under the above noise environment. Another filter for reducing impulsive noise is proposed by mixing with the myriad filter to propose an amplitude-limited myriad filter. Extensive experiment is conducted with images corrupted with ${\alpha}$-stable noise to analyze the behavior and performance of the proposed filters.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.26-29
• /
• 2001

In a target tracking problem the radar glint noise has non-Gaussian heavy-tailed distribution and will seriously affect the target tracking performance. In most nonlinear situations an Extended Robust Kalman Filter(ERKF) can yield acceptable performance as long as the noises are white Gaussian. However, an Extended Robust $H_{\infty}$ Filter (ERHF) can yield acceptable performance when the noises are Laplacian. In this paper, we use the Interacting Multiple Model(IMM) estimator for the problem of target tracking with glint noise. In the IMM method, two filters(ERKF and ERHF) are used in parallel to estimate the state. Computer simulations of a real target tracking shows that hybrid filter used the IMM algorithm has superior performance than a single type filter.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.1961-1963
• /
• 2001

In a target tracking problem, the radar glint noise has non-Gaussian heavy-tailed distribution and will seriously affect the target tracking performance. In this study, an extended robust $H_{\infty}$ was developed which can significantly improve the tracking performance when glint noise is present. Through the computer simulations, the proposed filter showed superior and robust tracking performance compared with other extended Kalman filters.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.301-310
• /
• 2006

In mobile communications, a class of variable-complexity algorithms for convolutional decoding known as sequential decoding algorithms is of interest since they have a computational time that could vary with changing channel conditions. The Fano algorithm is one well-known version of a sequential decoding algorithm. Since the decoding time of a Fano decoder follows the Pareto distribution, which is a heavy-tailed distribution parameterized by the channel signal-to-noise ratio (SNR), buffers are required to absorb the variable decoding delays of Fano decoders. Furthermore, since the decoding time drawn by a certain Pareto distribution can become unbounded, a maximum limit is often employed by a practical decoder to limit the worst-case decoding time. In this paper, we investigate the relations between buffer occupancy, decoding time, and channel conditions in a system where the Fano decoder is not allowed to run with unbounded decoding time. A timeout limit is thus imposed so that the decoding will be terminated if the decoding time reaches the limit. We use discrete-time semi-Markov models to describe such a Fano decoding system with timeout limits. Our queuing analysis provides expressions characterizing the average buffer occupancy as a function of channel conditions and timeout limits. Both numerical and simulation results are provided to validate the analytical results.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1210-1216
• /
• 2009

In this paper we analyze the convergence behavior of the recursive least rank (RLR) L-filter. The RLR L-filter is an order statistics filter, filter coefficients of which are the weights according to the order of magnitude of inputs. And RLR L-filter is a non-linear adaptive filter, that uses RLR algorithm for coefficient updating. The RLR algorithm is a non-linear adaptive algorithm based on rank estimates in Robust statistics. The mean and mean-squared convergence behavior of the RLR L-filter is examined with variable step-sizes. The RLR L-filter adapts the median filter type to the heavy-tailed distribution function of impulse noise, and adapts the average filter type to Gaussian noises.