Abstract
This paper presents a fast algorithm for calculating box splines sampled at regular intervals. This algorithm is based on the representation by directional summations, while splines are often represented by convolutions. The summation-based representation leads less computational complexity: the proposed algorithm requires fewer additions and much fewer multiplications than the algorithm based on convolutions. The proposed algorithm is evaluated in the sense of the number of additions and multiplications for three- and four-directional box splines to see how much those operations are reduced. Furthermore, this method is applied to the reconstruction of enlarged digital images. Although similar results are obtained for images with low frequency components, a better visual result is obtained for images containing text characters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
