By Topic

B-spline signal processing. II. Efficiency design and applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Unser ; Nat. Inst. of Health, Bethesda, MD, USA ; A. Aldroubi ; M. Eden

For pt.I see ibid., vol.41, no.2, p.821-33 (1993). A class of recursive filtering algorithms for the efficient implementation of B-spline interpolation and approximation techniques is described. In terms of simplicity of realization and reduction of computational complexity, these algorithms compare favorably with conventional matrix approaches. A filtering interpretation (low-pass filter followed by an exact polynomial spline interpolator) of smoothing spline and least-squares approximation methods is proposed. These techniques are applied to the design of digital filters for cubic spline signal processing. An efficient implementation of a smoothing spline edge detector is proposed. It is also shown how to construct a cubic spline image pyramid that minimizes the loss of information in passage from one resolution level to the next. In terms of common measures of fidelity, this data structure appears to be superior to the Gaussian/Laplacian pyramid

Published in:

IEEE Transactions on Signal Processing  (Volume:41 ,  Issue: 2 )