Stable recovery of planar regions with algebraic boundaries in Bernstein form
نویسندگان
چکیده
Abstract We present a new method for the stable reconstruction of class binary images from small number measurements. The we consider are characteristic functions algebraic domains, that is, domains defined as zero loci bivariate polynomials, and assume to know only finite set uniform samples each image. solution such problem can be up in terms linear equations associated image moments. However, sensitivity moments noise makes numerical highly unstable. To derive robust recovery algorithm, represent polynomials corresponding Bernstein apply polynomial-generating, refinable sampling kernels. This approach is noise, computationally fast simple implement. illustrate performance our algorithm noisy through extensive experiments. Our code released open source freely available.
منابع مشابه
Algebraic manipulation in the Bernstein form made simple via convolutions
Traditional methods for algebraic manipulation of polynomials in Bernstein form try to obtain an explicit formula for each coefficient of the result of a given procedure, such us multiplication, arbitrarily high degree elevation, composition, or differentiation of rational functions. Whereas this strategy often furnishes involved expressions, these operations become trivial in terms of convolut...
متن کاملBernstein Sets with Algebraic Properties
We construct Bernstein sets in R having some additional algebraic properties. In particular, solving a problem of Kraszewski, RaÃlowski, Szczepaniak and Żeberski, we construct a Bernstein set which is a < c-covering and improve some other results of RaÃlowski, Szczepaniak and Żeberski on nonmea-
متن کاملJacobi polynomials in Bernstein form
The paper describes a method to compute a basis of mutually orthogonal polynomials with respect to an arbitrary Jacobi weight on the simplex. This construction takes place entirely in terms of the coefficients with respect to the so–called Bernstein–Bézier form of a polynomial.
متن کاملAlgebraic boundaries of convex semi-algebraic sets
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalise the correspondence of facets of a polytope with the vertices of the dual polytope to general semi-algebraic convex sets. In this case, exceptional families of extreme points might exist and we characterise them semi-algebraically. We also give a strategy for computing a com...
متن کاملBijections for Planar Maps with Boundaries
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized formula obtained by Krikun using a (technically involved) generating function approach. The analogous formula for quadrangulations is new. We also obtain a fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2021
ISSN: ['1019-7168', '1572-9044']
DOI: https://doi.org/10.1007/s10444-021-09843-0