Related papers: Average degree of the essential variety
In algebraic statistics, the maximum likelihood degree of a statistical model is the number of complex critical points of its log-likelihood function. A priori knowledge of this number is useful for applying techniques of numerical…
The Chow form of the essential variety in computer vision is calculated. Our derivation uses secant varieties, Ulrich sheaves and representation theory. Numerical experiments show that our formula can detect noisy point correspondences…
An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…
Incidence varieties are spaces of $n$-tuples of points in the projective plane that satisfy a given set of collinearity conditions. We classify the components of incidence varieties and realization moduli spaces associated to configurations…
A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective…
In Computer Vision, edge detection is one of the favored approaches for feature and object detection in images since it provides information about their objects boundaries. Other region-based approaches use probabilistic analysis such as…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
Low-dimensional embedding, manifold learning, clustering, classification, and anomaly detection are among the most important problems in machine learning. The existing methods usually consider the case when each instance has a fixed,…
The ratio between the probability that two distributions $R$ and $P$ give to points $x$ are known as importance weights or propensity scores and play a fundamental role in many different fields, most notably, statistics and machine…
We consider the problem of learning a target probability distribution over a set of $N$ binary variables from the knowledge of the expectation values (with this target distribution) of $M$ observables, drawn uniformly at random. The space…
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…
We compute the expectation of the number of linear spaces on a random complete intersection in $p$-adic projective space. Here "random" means that the coefficients of the polynomials defining the complete intersections are sampled uniformly…
Let P be a set of points in R^d, and let M be a function that maps any subset of P to a positive real number. We examine the problem of computing the exact mean and variance of M when a subset of points in P is selected according to a…
The multiview variety from computer vision is generalized to images by $n$ cameras of points linked by a distance constraint. The resulting five-dimensional variety lives in a product of $2n$ projective planes. We determine defining…
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…
A natural oriented (2k+2)-chain in CP^{2k+1} with boundary twice RP^{2k+1}, its complex shade, is constructed. Via intersection numbers with the shade, a new invariant, the shade number of k-dimensional subvarieties with normal vector…
In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…
Motivated by a $2$-dimensional (unsupervised) image segmentation task whereby local regions of pixels are clustered via edge detection methods, a more general probabilistic mathematical framework is devised. Critical thresholds are…
In [3] Borzellino and Brunsden started to develop an elementary differential topology theory for orbifolds. In this paper we carry on their project by defining a mapping degree for proper maps between orbifolds, which counts preimages of…
Let $X$ be a real algebraic variety with set of complex points $X_{\mathbb C}$ and set of real points $X_{\mathbb R}$. A complex slice of $X$ is a transverse intersection of $X_{\mathbb R}$ with a complex subvariety $V$ of $X_{\mathbb C}$.…