Speaker : Pau Montes Abstract: Efficient B-Spline based algorithms for the manipulation of regularly sampled continuous signals Polynomial splines have been widely used for interpolation and smoothing and in general to represent continuous signals from its samples. Typically the coefficient of the piecewise polynomials are calculated by using the continuity at the knots of the resulting functions and their n-1 first derivatives. In this talk it will be shown that, assuming that the samples lie in a regular grid, more efficient algorithms can be derived from the B-spline representation of splines. Applications to computation of derivatives, convolutions, interpolation and smoothing will be shown. This talk is based on M. Unser, A. Aldroubi, and M. Eden, "��B-spline signal processing: part II-efficient design and applications,"�� IEEE Transactions on Signal Processing, vol. 41, no. 2, pp. 834–848, February 1993.