Multiprojective Geometry of Compatible Triples of Fundamental and Essential Matrices

• URL: http://arxiv.org/abs/2602.23450v1
• Date: Thu, 26 Feb 2026 19:14:16 GMT
• Title: Multiprojective Geometry of Compatible Triples of Fundamental and Essential Matrices
• Abstract summary: We characterize the variety of compatible fundamental matrix triples by computing its multidegree and multihomogeneous vanishing ideal.<n>One of our key new discoveries is a simple set of quartic constraints vanishing on compatible fundamental matrix triples.
• Score: 7.799711162530712
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We characterize the variety of compatible fundamental matrix triples by computing its multidegree and multihomogeneous vanishing ideal. This answers the first interesting case of a question recently posed by Bråtelund and Rydell. Our result improves upon previously discovered sets of algebraic constraints in the geometric computer vision literature, which are all incomplete (as they do \emph{not} generate the vanishing ideal) and sometimes make restrictive assumptions about how a matrix triple should be scaled. Our discussion touches more broadly on generalized compatibility varieties, whose multihomogeneous vanishing ideals are much less well understood. One of our key new discoveries is a simple set of quartic constraints vanishing on compatible fundamental matrix triples. These quartics are also significant in the setting of essential matrices: together with some previously known constraints, we show that they locally cut out the variety of compatible essential matrix triples.

Related papers

• A Complete Classification of Complex Hadamard Matrices of Order Six [0.0]
  Complex Hadamard matrices encode perfectly balanced unitary transformations.<n>Their classification is complete through order five, but order six has remained open for decades.<n>Our work resolves the classification problem and provides a rigorous framework for further investigating order-six Hadamards.
  arXiv  Detail & Related papers  (2026-08-18T17:46:58Z)
• Compact Lifted Relaxations for Low-Rank Optimization [2.0052993723676895]
  We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n times m$ matrices.<n>We derive lifted semidefinite relaxations that do not require such spectral terms.<n>Overall, we obtain scalable semidefinite bounds for a broad class of low-rank quadratic problems.
  arXiv  Detail & Related papers  (2026-03-05T17:05:18Z)
• Spiky Rank and Its Applications to Rigidity and Circuits [0.0]
  spiky rank is a new matrix parameter that enhances blocky rank by combining the structure of the latter with linear-algebraic flexibility.<n>We show that large spiky rank implies high matrix rigidity, and that spiky rank lower bounds yield lower bounds for depth-2 ReLU circuits.
  arXiv  Detail & Related papers  (2026-02-26T21:20:00Z)
• Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming [0.0]
  We consider the densest submatrix problem, which seeks the submatrix of fixed size of a given binary matrix that contains the most nonzero entries.<n>Much recent research has focused on the development of sufficient conditions for exact solution of the densest submatrix problem.<n>We extend these results to the more realistic setting where the input matrix may contain emphmany large dense subgraphs.
  arXiv  Detail & Related papers  (2026-01-07T14:02:25Z)
• Online Stability Improvement of Groebner Basis Solvers using Deep Learning [29.805408457645886]
  We show that different variable or monomial orderings lead to different elimination templates. We then prove that the original set of coefficients may contain sufficient information to train a selection of a good solver.
  arXiv  Detail & Related papers  (2024-01-17T16:51:28Z)
• Mutually-orthogonal unitary and orthogonal matrices [6.9607365816307]
  We show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively. As an application in quantum information theory, we show that the minimum and maximum numbers of an unextendible maximally entangled bases within a real two-qutrit system are three and four, respectively.
  arXiv  Detail & Related papers  (2023-09-20T08:20:57Z)
• Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
  We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-21T01:47:17Z)
• Relative Pose from SIFT Features [50.81749304115036]
  We derive a new linear constraint relating the unknown elements of the fundamental matrix and the orientation and scale. The proposed constraint is tested on a number of problems in a synthetic environment and on publicly available real-world datasets on more than 80000 image pairs.
  arXiv  Detail & Related papers  (2022-03-15T14:16:39Z)
• Identifiability in Exact Two-Layer Sparse Matrix Factorization [0.0]
  Sparse matrix factorization is the problem of approximating a matrix Z by a product of L sparse factors X(L) X(L--1). This paper focuses on identifiability issues that appear in this problem, in view of better understanding under which sparsity constraints the problem is well-posed.
  arXiv  Detail & Related papers  (2021-10-04T07:56:37Z)
• Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation [71.27989298860481]
  We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function. We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
  arXiv  Detail & Related papers  (2021-09-30T19:17:35Z)
• Non-PSD Matrix Sketching with Applications to Regression and Optimization [56.730993511802865]
  We present dimensionality reduction methods for non-PSD and square-roots" matrices. We show how these techniques can be used for multiple downstream tasks.
  arXiv  Detail & Related papers  (2021-06-16T04:07:48Z)
• A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups [115.58550697886987]
  We provide a completely general algorithm for solving for the equivariant layers of matrix groups. In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before. Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
  arXiv  Detail & Related papers  (2021-04-19T17:21:54Z)
• Multi-Objective Matrix Normalization for Fine-grained Visual Recognition [153.49014114484424]
  Bilinear pooling achieves great success in fine-grained visual recognition (FGVC) Recent methods have shown that the matrix power normalization can stabilize the second-order information in bilinear features. We propose an efficient Multi-Objective Matrix Normalization (MOMN) method that can simultaneously normalize a bilinear representation.
  arXiv  Detail & Related papers  (2020-03-30T08:40:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.