Related papers: On the Existence of Epipolar Matrices
Given a set of point correspondences in two images, the existence of a fundamental matrix is a necessary condition for the points to be the images of a 3-dimensional scene imaged with two pinhole cameras. If the camera calibration is known…
In this note we study the connection between the existence of a projective reconstruction and the existence of a fundamental matrix satisfying the epipolar constraints.
This paper studies the problem of recovering cameras from a set of fundamental matrices. A set of fundamental matrices is said to be compatible if a set of cameras exists for which they are the fundamental matrices. We focus on the complete…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
A real $n$-by-$n$ idempotent matrix $A$ with all entries having the same absolute value is called {\it absolutely flat}. We consider the possible ranks of such matrices and herein characterize the triples: size, constant, and rank for which…
We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…
We prove that if a $7\times 7$ matrix is potentially stable, then it has at least 11 non-zero entries. The results for $n\times n$ matrix with $n$ up to 6 are known previously. We prove the result by making a list of possible associated…
We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…
In two-view geometry, the essential matrix describes the relative position and orientation of two calibrated images. In three views, a similar role is assigned to the calibrated trifocal tensor. It is a particular case of the (uncalibrated)…
We present a novel approach for RANSAC-based computation of the fundamental matrix based on epipolar homography decomposition. We analyze the geometrical meaning of the decomposition-based representation and show that it directly induces a…
In recent work, algebraic computational software was used to provide the exact algebraic conditions under which a sixtuple $\{F^{ij}\}$ of fundamental matrices, corresponding to $4$ images, will be compatible, i.e. there will exist cameras…
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
We consider the following questions: when do there exist quaternionic frames with given frame spectrum and given frame vector norms? When such frames exist, is it always possible to interpolate between any two while fixing their spectra and…
We classify the matrices M which correspond to finite categories
We generalize the notion of essential closures which is used in formulating a geometric necessary condition for a set to be the support of a multivariate copula. Furthermore, in some special cases, we derive an explicit formula of the…
In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…
A fundamental theorem of linear algebra asserts that every basis for the vector space $\mathbb{R}^n$ has $n$ elements. In this expository note we present a theorem of W. G. Leavitt describing one way in which this invariant basis number…
The fundamental matrix and trifocal tensor are convenient algebraic representations of the epipolar geometry of two and three view configurations, respectively. The estimation of these entities is central to most reconstruction algorithms,…
We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…
The complete eigenstructure, or structural data, of a rational matrix $R(s)$ is comprised by its invariant rational functions, both finite and at infinity, which in turn determine its finite and infinite pole and zero structures,…