Related papers: Projective Variety Recovery from Unknown Linear Pr…
We study how an irreducible closed algebraic curve X embedded in CP^3 can be recovered using its projections from points onto embedded projective planes. The different embeddings are unknown. The only input is the defining equation of each…
The problem of recovering a vector from the absolute values of its inner products against a family of measurement vectors has been well studied in mathematics and engineering. A generalization of this phase retrieval problem also exists in…
In the planted partition problem, the $n$ vertices of a random graph are partitioned into $k$ "clusters," and edges between vertices in the same cluster and different clusters are included with constant probability $p$ and $q$, respectively…
We characterize collections of orthogonal projections for which it is possible to reconstruct a vector from the magnitudes of the corresponding projections. As a result we are able to show that in an $M$-dimensional real vector space a…
We expand the existing arsenal of methods for exploring the irreducible components of the varieties $Rep(A,\bold d)$ which parametrize the representations with dimension vector $\bold d$ of a finite dimensional algebra $A$. To do so, we…
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…
Weighted projective space arises when we consider the usual geometric definition for projective space and allow for non-trivial weights. On its own, this extra freedom gives rise to more than enough interesting phenomena, but it is the fact…
Random projection has been widely used in data classification. It maps high-dimensional data into a low-dimensional subspace in order to reduce the computational cost in solving the related optimization problem. While previous studies are…
We consider the problem of recovering a unitary eigendecomposition of a complex unitary matrix from that of its embedded real-valued formulation. Such formulations arise naturally in scientific computing workflows that employ…
In this work we consider the problem of recovering non-uniform splines from their projection onto spaces of algebraic polynomials. We show that under a certain Chebyshev-type separation condition on its knots, a spline whose inner-products…
Castelnuovo-Mumford regularity is an important invariant of projective algebraic varieties. A well known conjecture due to Eisenbud and Goto gives a bound for regularity in terms of the codimension and degree,i.e., Castelnuovo-Mumford…
In this paper, we study the problem of reconstructing a 3D point source model from a set of 2D projections at unknown view angles. Our method obviates the need to recover the projection angles by extracting a set of rotation-invariant…
A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.
In this paper, we study a 2D tomography problem for point source models with random unknown view angles. Rather than recovering the projection angles, we reconstruct the model through a set of rotation-invariant features that are estimated…
We study the problem of classifying the irreducible projective varieties $X$ of dimension $n\ge 2$ in $\Bbb P^N$ which contain an algebraic family $\Cal F$ of dimension $h+1$ ($h<n$) of subvarieties $Y$ of dimension $n-h$, each one…
The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
Majority of the current dimensionality reduction or retrieval techniques rely on embedding the learned feature representations onto a computable metric space. Once the learned features are mapped, a distance metric aids the bridging of gaps…
We analyze human poses and motion by introducing three sequences of easily calculated surface descriptors that are invariant under reparametrizations and Euclidean transformations. These descriptors are obtained by associating to each…
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…