Issue No. 04 - April (1993 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.206956
<p>The authors are concerned with the derivation of general methods for the L/sub 2/ approximation of signals by polynomial splines. The main result is that the expansion coefficients of the approximation are obtained by linear filtering and sampling. The authors apply those results to construct a L/sub 2/ polynomial spline pyramid that is a parametric multiresolution representation of a signal. This hierarchical data structure is generated by repeated application of a REDUCE function (prefilter and down-sampler). A complementary EXPAND function (up-sampler and post-filter) allows a finer resolution mapping of any coarser level of the pyramid. Four equivalent representations of this pyramid are considered, and the corresponding REDUCE and EXPAND filters are determined explicitly for polynomial splines of any order n (odd). Some image processing examples are presented. It is demonstrated that the performance of the Laplacian pyramid can be improved significantly by using a modified EXPAND function associated with the dual representation of a cubic spline pyramid.</p>
signal processing; signal approximation; parametric multiresolution signal representation; L/sub 2/-polynomial spline pyramid; linear filtering; hierarchical data structure; REDUCE function; prefilter; down-sampler; EXPAND function; up-sampler; post-filter; image processing; Laplacian pyramid; cubic spline pyramid; filtering and prediction theory; signal processing; splines (mathematics)
M. Eden, A. Aldroubi and M. Unser, "The L/sub 2/-Polynomial Spline Pyramid," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, no. , pp. 364-379, 1993.