Gaussian Transform - Eusipco

نویسندگان

  • Teodor Iulian Alecu
  • Sviatoslav Voloshynovskiy
  • Thierry Pun
چکیده

This paper introduces the general purpose Gaussian Transform, which aims at representing a generic symmetric distribution as an infinite mixture of Gaussian distributions. We start by the mathematical formulation of the problem and continue with the investigation of the conditions of existence of such a transform. Our analysis leads to the derivation of analytical and numerical tools for the computation of the Gaussian Transform, mainly based on the Laplace and Fourier transforms, as well as of the afferent properties set (e.g. the transform of sums of independent variables). Finally, the Gaussian Transform is exemplified in analytical form for typical distributions (e.g. Gaussian, Laplacian), and in numerical form for the Generalized Gaussian and Generalized Cauchy distributions families.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Legendre Ramanujan Sums transform

In this paper, Legendre Ramanujan Sums transform(LRST) is proposed and derived by applying DFT to the complete generalized Legendre sequence (CGLS) matrices. The original matrix based Ramanujan Sums transform (RST) by truncating the Ramanujan Sums series is nonorthogonal and lack of fast algorithm, the proposed LRST has orthogonal property and O(Nlog2N) complexity fast algorithm. The LRST trans...

متن کامل

Colour spread transform data hiding capacity using complex wavelets

Information theoretic methods of calculating the capacity of data hiding schemes allow for objective comparisons of watermarking algorithms. This paper applies these methods to the case of colour image watermarking, using a dual tree complex wavelet transform and non redundant complex wavelet transform along with a spread transform data hiding algorithm to compare levels of capacity between the...

متن کامل

Online learning in L2 space with multiple Gaussian kernels

We present a novel online learning paradigm for nonlinear function estimation based on iterative orthogonal projections in an L space reflecting the stochastic property of input signals. An online algorithm is built upon the fact that any finite dimensional subspace has a reproducing kernel, which is given in terms of the Gram matrix of its basis. The basis used in the present study involves mu...

متن کامل

A generalization of the fixed point estimate

In this paper, the problem of proportional covariance matrices estimation for random Gaussian complex vectors is investigated. The maximum likelihood estimates of the matrix and the scale factors are derived, and their statistical performances are studied, through bias, consistency and asymptotic distribution. It is also shown that the problem treated here generalizes the covariance estimation ...

متن کامل

FAμST: Speeding up linear transforms for tractable inverse problems

In this paper, we propose a technique to factorize any matrix into multiple sparse factors. The resulting factorization, called Flexible Approximate MUlti-layer Sparse Transform (FAμST), yields reduced multiplication costs by the matrix and its adjoint. Such a desirable property can be used to speed up iterative algorithms commonly used to solve high dimensional linear inverse problems. The pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005