Related papers: Projections and Phase retrieval

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

Vectors are universal mathematical objects that can represent text, images, speech, or a mix of these data modalities. That happens regardless of whether data is represented by hand-crafted features or learnt embeddings. Collect a large…

We show that a central linear mapping of a projectively embedded Euclidean $n$-space onto a projectively embedded Euclidean $m$-space is decomposable into a central projection followed by a similarity if, and only if, the least singular…

The graph projection of a hypergraph is a simple graph with the same vertex set and with an edge between each pair of vertices that appear in a hyperedge. We consider the problem of reconstructing a random $d$-uniform hypergraph from its…

We show that a vector field in $\mathbb{R}^n$ can be reconstructed uniquely from the knowledge of restricted Doppler and first integral moment transforms. The line complex we consider consists of all lines passing through a fixed curve…

The phase retrieval problem in the classical setting is to reconstruct real/complex functions from the magnitudes of their Fourier/frame measurements. In this paper, we consider a new phase retrieval paradigm in the…

Phase retrieval has become a very active area of research. We will classify when phase retrieval by Parseval frames passes to the Naimark complement and when phase retrieval by projections passes to the orthogonal complements. We introduce…

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

For any rigid presentation $e$, we construct an orthogonal projection functor to ${\rm rep}(e^\perp)$ left adjoint to the natural embedding. We establish a bijection between presentations in ${\rm rep}(e^\perp)$ and presentations compatible…

Suppose we wish to recover a signal x in C^n from m intensity measurements of the form |<x,z_i>|^2, i = 1, 2,..., m; that is, from data in which phase information is missing. We prove that if the vectors z_i are sampled independently and…

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real or complex Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We present new…

By suitably generalizing the Fourier constraint projection in the difference map phasing algorithm, an object can be reconstructed from its diffraction pattern even when the latter has been incoherently averaged over a discrete group of…

We present algorithms for reconstructing, up to unavoidable projective automorphisms, surfaces with ordinary singularities in three dimensional space starting from their silhouette, or "apparent contour" - namely the branching locus of a…

We prove an inversion formula for the exterior $k$-plane transform. As a consequence, we show that if $m < k$ then an $m$-current in $\mathbf R^n$ can be reconstructed from its projections onto $\mathbf R^k$, which proves a conjecture of…

We show that if no $m$-plane contains almost all of an $m$-rectifiable set $E \subset \R^{n}$, then there exists a single $(m - 1)$-plane $V$ such that the radial projection of $E$ has positive $m$-dimensional measure from every point…

Obtaining complete information about the shape of an object by looking at it from a single direction is impossible in general. In this paper, we theoretically study obtaining differential geometric information of an object from orthogonal…

We introduce a new method for the reconstruction of a function from linear measurements by means of oblique projections. The space spanned by the measurement vectors may be different from the subspace in which the function is reconstructed.…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

This paper considers phase retrieval from the magnitude of 1D over-sampled Fourier measurements, a classical problem that has challenged researchers in various fields of science and engineering. We show that an optimal vector in a…

An important theme in modern inverse problems is the reconstruction of time-dependent data from only finitely many measurements. To obtain satisfactory reconstruction results in this setting it is essential to strongly exploit temporal…