Abstract
This paper proposes a Generalized Multilevel B-spline Approximation (GMBA) method, which addresses scattered data interpolation problems in image processing. Mathematically, the GMBA provides a better solution for the B-spline control lattice by superimposing identical level B-splines compared with traditional Multilevel B-spline Approximation (MBA). Specifically, the GMBA allows the spacing of next control lattice to be subdivided arbitrarily or remained unchanged, which is determined by a predefined spacing set or the current error level. These improvements bring higher approximation accuracy and more flexibility for algorithm design to avoid over-fitting. In this paper, basic GMBA algorithm and its refined algorithm are compiled for image processing. Finally, six relevant cases are involved to test the GMBA, including surface approximation, image enlargement, image completion, and Salt-and-Pepper (SAP) noise removal. The experimental results show that the GMBA has better performance than the MBA in surface approximation and image processing, performs comparatively fast with the best performance on more than half of the standard test images compared with traditional algorithms, and has partially better performance even than deep learning algorithms. The GMBA can effectively recover meaningful details in images contaminated with even extremely high SAP noise level (up to 99%).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have