Sampling and Reconstruction of Shapes with Algebraic Boundaries
Mitra Fatemi, Arash Amini, and Martin Vetterli

TL;DR
This paper develops a stable sampling and reconstruction method for binary images with algebraic boundaries, using generalized moments and sign information to improve robustness against noise and kernel limitations.
Contribution
It introduces generalized moments and sign-based techniques to enhance the stability and applicability of algebraic boundary image reconstruction.
Findings
Reconstruction is robust at moderate noise levels.
Generalized moments relax kernel requirements.
Method extends to images with unbounded boundaries.
Abstract
We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of to the image plane, where denotes the indicator function and is some real bivariate polynomial. This particularly means that the boundaries in the image form a subset of an algebraic curve with the implicit polynomial . We show that the image parameters --i.e., the polynomial coefficients-- satisfy a set of linear annihilation equations with the coefficients being the image moments. The inherent sensitivity of the moments to noise makes the reconstruction process numerically unstable and narrows the choice of the sampling kernels to polynomial reproducing kernels. As a remedy to these problems, we replace conventional moments with more stable \emph{generalized moments} that are adjusted to the given…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
