Issue No. 02 - March (1988 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.3889
<p>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.</p>
picture processing; pipelined architecture; B-spline interpolation; filters; truncated sinc function; visual performance; interpolation; parallel architectures; picture processing; splines (mathematics)
L. Ferrari and P. Sankar, "Simple Algorithms and Architectures for B-spline Interpolation," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 10, no. , pp. 271-276, 1988.