Related papers: Critical Points for Two-view Triangulation

A LG-WKB and Turning point theory is developed for three term recurrence formulas associated with monotonic recurrence coefficients. This is used to find strong asymptotics for certain classical orthogonal polynomials including Wilson…

Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…

Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

We study point particles in 2+1 dimensional first order gravity using a triangulation to fix the connection and frame-field. The Hamiltonian is reduced to a boundary term which yields the total mass. The triangulation is dynamical with…

We derive the deflection angle of light rays passing near a black hole with mass m and tidal charge q, confined to a generalized Randall-Sundrum brane with codimension one. We employ the weak lensing approach, up to the second order in…

This paper studies bilevel polynomial optimization in which lower-level constraint functions depend linearly on lower-level variables. We show that such bilevel program can be reformulated as a disjunctive program by using…

The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…

We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…

We consider mixed model of traffic flow distribution in large networks (BMW model, 1954 & Stable Dynamic model, 1999). We build dual problem and consider primal-dual mirror descent method for the dual problem. There are two ways to recover…

We give a new algorithmic solution to the well-known five-point relative pose problem. Our approach does not deal with the famous cubic constraint on an essential matrix. Instead, we use the Cayley representation of rotations in order to…

Skew critical problems occur in continuous and discrete nonholonomic Lagrangian systems. They are analogues of constrained optimization problems, where the objective is differentiated in directions given by an apriori distribution, instead…

The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the original problem with an implicit compact…

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…

A critical value of a function is the value of this function at one of its critical points. Each critical point of a differentiable multivariate function is described by the equations which consist in equating to zero all of its partial…

We study the critical points over an algebraic variety of an optimization problem defined by a quadratic objective that is degenerate. This scenario arises in machine learning when the dataset size is small with respect to the model, and is…

In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…

We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…

In this note, we show that the L2 optimal solutions to most real multiple view L2 triangulation problems can be efficiently obtained by two-stage Newton-like iterative methods, while the difficulty of such problems mainly lies in how to…

Finding the intersection of two conics is a commonly occurring problem. For example, it occurs when identifying patterns of craters on the lunar surface, detecting the orientation of a face from a single image, or estimating the attitude of…