sss08
trait
wa
 


Research Interests - Summative Kernels

Summative kernels in signal processing

A wide range of digital analysis and signal processing procedures inherently rely on methods for reconstructing a continuous underlying signal from a set of sampled corrupted values. These values are usually uniformly sampled, since the measures come from systematic observations. Kernels are essential tools in this context, since they are used in many digital signal processing applications: reconstruction, resampling, interpolation, linear or non-linear transformations, stochastic or band-pass filtering, derivation, edge detection... Actually, kernels are mainly used to derive discrete algorithms from a continuous representation of the acquired (unavoidably sampled) signal.

Within most applications, a kernel can be seen as a weighted neighborhood, i.e. a positive function, ensuring a smooth interplay between continuous and discrete domains. They can be visualized as bumps that can be shifted to any location of the signal domain, so as to absorb or spread the information contained in the signal. They are said to be summative when their integral is equal to one. They are often bounded, monomodal and symmetric. In this context of digital signal processing, the sampling process or the signal acquisition modeling plays a fundamental role in these methods, since it is their first step.

kernel

Fig: summative kernel

Signal sampling or signal acquisition modelling

Signal acquisition is just obtaining a value of the signal at a given location x, known as the position of the sensor. This can be rudely modeled by the convolution of the underlying signal with the Dirac distribution at the location x. In order to move nearer the modeling to the reality of the sensor acquisition, integrating the signal over a neighborhood (an interval) of x seems to be more appropriate. Actually this 2nd modeling is performed by the convolution of the underlying signal with the characteristic function of the neighborhood of x. A 3rd modeling proposal is to integrate the signal over a weighted neighborhood, i.e. convolving the underlying signal with a summative kernel representing a weighted neighborhood of x. In that case, the chosen summative kernel is nothing else than the impulse response of the sensor. The acquired value is subject to uncertainty, the sensor is not perfect. As already mentionned, the acquisition is modeled by the convolution of the real physical signal with the summative kernel modeling the sensor. This model is nothing else than the expected value of the underlying signal in the translated neighborhood

Summative kernels and uncertainty

It is worth noting that the definition of a summative kernel coincides with the definition of a probability distribution of a random variable. Interpreting a summative kernel, used in signal sampling or acquisition modeling, as being a model of an uncertain phenomenon is sensible. Indeed, the value acquired by the sensor can be interpreted as a realization of a random variable whose probability distribution is the impulse response of the sensor. However, this approach does not incorporate imprecision. It is supposed that we have a perfect knowledge of the sensor behavior. After a thorough survey of uncertainty theories taking into account imprecision, I decided to replace summative kernels by another kind of neighborhood : the maxitive kernels.

   
Last Update : February 15th, 2008
 
Kevin Loquin homepage