Related papers: Sets Reconstructable with Medial Axis
A new line of research on the lasso exploits the beautiful geometric fact that the lasso fit is the residual from projecting the response vector $y$ onto a certain convex polytope. This geometric picture also allows an exact geometric…
High resolution reconstruction of complicated objects from incomplete and noisy data can be achieved by solving modulation equations iteratively under physical constraints. This direct demodulation method is a powerful technique for dealing…
In recent years, structured matrix recovery problems have gained considerable attention for its real world applications, such as recommender systems and computer vision. Much of the existing work has focused on matrices with low-rank…
We investigate and quantify the distinction between rectifiable and purely unrectifiable 1-sets in the plane. That is, given that purely unrectifiable 1-sets always have null intersections with Lipschitz images, we ask whether these sets…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
This chapter explores the notion of "dimension" of a set. Various power laws by which an Euclidean space can be characterized are used to define dimensions, which then explore different aspects of the set. Also discussed are the…
The reconstruction problem of voxels with individual weightings can be modeled a position- and angle- dependent function in the forward-projection. This changes the system matrix and prohibits to use standard filtered backprojection. In…
We give an example of a dense o-minimal structure in which there is a definable quotient that cannot be eliminated, even after naming parameters. Equivalently, there is an interpretable set which cannot be put in parametrically definable…
We present some work relating to fractal transformations on masked iterated function systems and demonstrate how well known algorithms for generating fractal transformations can be modifed for these systems. We also demonstrate that these…
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…
The density matrix of a qudit may be reconstructed with optimal efficiency if the expectation values of a specific set of observables are known. In dimension six, the required observables only exist if it is possible to identify six…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
Medial quandles are represented using a heterogeneous affine structure. As a consequence, we obtain numerous structural properties, including enumeration of isomorphism classes of medial quandles up to 13 elements.
Object reconstruction from a single image -- in the wild -- is a problem where we can make progress and get meaningful results today. This is the main message of this paper, which introduces an automated pipeline with pixels as inputs and…
This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz…
A multidimensional basis of p-adic wavelets is constructed. The relation of the constructed basis to a system of coherent states (i.e. orbit of action) for some $p$-adic group of linear transformations is discussed. We show that the set of…
We show that any open set in $\R^n$ is a union of an ascending sequence of bounded open sets with analytic boundary. This is just a technical result, which is probably known. We believe, however, that it can be useful for studing BVPs on…
We introduce Structured 3D Features, a model based on a novel implicit 3D representation that pools pixel-aligned image features onto dense 3D points sampled from a parametric, statistical human mesh surface. The 3D points have associated…
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas…
Statistical learning in high-dimensional spaces is challenging without a strong underlying data structure. Recent advances with foundational models suggest that text and image data contain such hidden structures, which help mitigate the…