Fast B-spline Transforms for Continuous Image Representation and Interpolation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Bivariate splines on hexagonal lattice for digital image processing
Journal of Computational and Applied Mathematics - Selected papers of the international symposium on applied mathematics, August 2000, Dalian, China
Morphological modeling of cardiac signals based on signal decomposition
Computers in Biology and Medicine
Hi-index | 0.14 |
It is proved that the Toeplitz binary value matrix inversion associated with mth-order B-spline interpolation can be implemented using only 2(m+1) additions. Pipelined architectures are developed for real-time B-spline interpolation based on simple running average filters. It is shown that an ideal interpolating function, which is approximated by a truncated sinc function with M half cycles, can be implemented using B-splines with M+2 multiplies. With insignificant loss of performance, the coefficients at the knots of the truncated sinc function can be approximated using coefficients which are powers of two. The resulting implementation requires only M+4m+6 additions. It is believed that the truncated sinc function approximated by zero-order B-spline functions actually achieves the best visual performance.