Related papers: Algebra and Geometry of Camera Resectioning
We introduce an algebraic multiscale method for two--dimensional problems. The method uses the generalized multiscale finite element method based on the quadrilateral nonconforming finite element spaces. Differently from the…
We systematically compile an exhaustive catalogue of multiview varieties and anchored multiview varieties arising from projections of points and lines in 1, 2, and 3-dimensional projective space. We say that two such varieties are…
Visual localization is the task of accurate camera pose estimation in a known scene. It is a key problem in computer vision and robotics, with applications including self-driving cars, Structure-from-Motion, SLAM, and Mixed Reality.…
We present an algebraic study of line correspondences for pinhole cameras, in contrast to the thoroughly studied point correspondences. We define the line multiview variety as the Zariski closure of the image of the map projecting lines in…
We investigate the performance of algebraic multigrid methods for the solution of the linear system of equations arising from a Virtual Element discretization. We provide numerical experiments on very general polygonal meshes for a model…
In this paper, we study metric completions of triangulated categories in a representation-theoretic context. We provide a concrete description of completions of bounded derived categories of hereditary finite dimensional algebras of finite…
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…
The multi-image variety is a subvariety of Gr(1,P^3)^n that models taking pictures with n rational cameras. We compute its cohomology class in the cohomology of Gr(1,P^3)^n, and from there its multidegree as a subvariety of (P^5)^n under…
A fundamental problem in computer vision is that of inferring the intrinsic, 3D structure of the world from flat, 2D images of that world. Traditional methods for recovering scene properties such as shape, reflectance, or illumination rely…
Calibration in a multi camera network has widely been studied for over several years starting from the earlier days of photogrammetry. Many authors have presented several calibration algorithms with their relative advantages and…
We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…
A new strategy based on numerical homogenization and Bayesian techniques for solving multiscale inverse problems is introduced. We consider a class of elliptic problems which vary at a microscopic scale, and we aim at recovering the highly…
We present the Multilevel Bregman Proximal Gradient Descent (ML BPGD) method, a novel multilevel optimization framework tailored to constrained convex problems with relative Lipschitz smoothness. Our approach extends the classical…
We study computational and statistical consequences of problem geometry in stochastic and online optimization. By focusing on constraint set and gradient geometry, we characterize the problem families for which stochastic- and…
3D Gaussian Splatting is crucial for real-time novel view synthesis due to its efficiency and ability to render photorealistic images. However, building a 3D Gaussian is guided solely by photometric loss, which can result in inconsistencies…
We present a practical approach to solving distance-based optimization problems using optical computing hardware. The objective is to minimize an energy function defined as the weighted sum of squared differences between measured distances…
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…
This is a study of a problem in geodesy with methods from complex algebraic geometry: for a fixed number of measure points and target points at unknown position in the Euclidean plane, we study the problem of determining their relative…
Reconstructing the geometry and appearance of objects from photographs taken in different environments is difficult as the illumination and therefore the object appearance vary across captured images. This is particularly challenging for…
We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…