منابع مشابه
Gaussian Kernel Smoothing
where K is the kernel of the integral. Given the input signal X , Y represents the output signal. The smoothness of the output depends on the smoothness of the kernel. We assume the kernel to be unimodal and isotropic. When the kernel is isotropic, it has radial symmetry and should be invariant under rotation. So it has the form K(t, s) = f(‖t− s‖) for some smooth function f . Since the kernel ...
متن کاملGaussian Smoothing and Asymptotic Convexity
Smoothing (say by a Guassian kernel) has been a very popular technique for optimizing a nonconvex objective function. The rationale behind smoothing is that the smoothed function has less spurious local minima than the original one. This technique has seen tremendous success in many real world tasks such as those arising in machine learning and computer vision. Despite its empirical success, th...
متن کاملBayesian Multiscale Smoothing of Gaussian Noised Images
We propose a multiscale model for Gaussian noised images under a Bayesian framework for both 2-dimensional (2D) and 3-dimensional (3D) images. We use a Chinese restaurant process prior to randomly generate ties among intensity valus of pixels in the neighboring image. The resulting Bayesian estimator enjoys some desirable asymptotic properties for identifying precise structures in the image. Th...
متن کاملAn Adaptive Fuzzy Image Smoothing Filter for Gaussian Noise
This paper presents a Gaussian noise filter that uses a sigmoid shaped membership function to model image information in the spatial domain. This function acts as a tunable smoothing intensification operator. With a proper choice of two sigmoid parameters ‘t’ and ‘a’, the filter strength can be tuned for removal of Gaussian noise in intensity images. An image information measure, Total Compatib...
متن کاملA Probabilistic Perspective on Gaussian Filtering and Smoothing
We present a general probabilistic perspective on Gaussian filtering and smoothing. This allows us to show that common approaches to Gaussian filtering/smoothing can be distinguished solely by their methods of computing/approximating the means and covariances of joint probabilities. This implies that novel filters and smoothers can be derived straightforwardly by providing methods for computing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2019
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2018.2828087