Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
Free, publicly-accessible full text available June 1, 2024
This paper deals with polynomial Hermite splines. In the first part, we provide a simple and fast procedure to compute the refinement mask of the Hermite B-splines of any order and in the case of a general scaling factor. Our procedure is solely derived from the polynomial reproduction properties satisfied by Hermite splines and it does not require the explicit construction or evaluation of the basis functions. The second part of the paper discusses the factorization properties of the Hermite B-spline masks in terms of the augmented Taylor operator, which is shown to be the minimal annihilator for the space of discrete monomial Hermite sequences of a fixed degree. All our results can be of use, in particular, in the context of Hermite subdivision schemes and multi-wavelets.more » « less
null (Ed.)Abstract We present a new method for the stable reconstruction of a class of binary images from a small number of measurements. The images we consider are characteristic functions of algebraic domains, that is, domains defined as zero loci of bivariate polynomials, and we assume to know only a finite set of uniform samples for each image. The solution to such a problem can be set up in terms of linear equations associated to a set of image moments. However, the sensitivity of the moments to noise makes the numerical solution highly unstable. To derive a robust image recovery algorithm, we represent algebraic polynomials and the corresponding image moments in terms of bivariate Bernstein polynomials and apply polynomial-generating, refinable sampling kernels. This approach is robust to noise, computationally fast and simple to implement. We illustrate the performance of our reconstruction algorithm from noisy samples through extensive numerical experiments. Our code is released open source and freely available.more » « less