Related papers: The Rank of Trifocal Grassmann Tensors
Grassmann tensors arise from classical problems of scene reconstruction in computer vision. In particular, bifocal Grassmann tensors, related to a pair of projections from a projective space onto view-spaces of varying dimensions,…
Closed formulas for the multilinear rank of trifocal Grassmann tensors are obtained. An alternative process to the standard HOSVD is introduced for the computation of the core of trifocal Grassmann tensors. Both of these results are…
The article presents a survey of results in algebraic vision and multiview geometry. The starting points is the study of projective algebraic varieties critical for scene reconstruction. Initially studied for reconstructing static scenes in…
Multi-view Geometry is reviewed from an Algebraic Geometry perspective and multi-focal tensors are constructed as equivariant projections of the Grassmannian. A connection to the principal minor assignment problem is made by considering…
In this paper, we introduce the Grassmann tensor by tensor product of vectors and some basic terminology in tensor theory. Some basic properties of the Grassmann tensors are investigated and the tensor language is used to rewrite some…
We study tridimensional tensors on the complex field from the point of view of hypermatrices, taking into consideration the problem of determining whether they are degenerate or not, concise or not, what is their essential format if they…
The concept of tensor rank, introduced in the twenties, has been popularized at the beginning of the seventies. This has allowed to carry out Factor Analysis on arrays with more than two indices. The generic rank may be seen as an upper…
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…
The goal of tensor completion is to fill in missing entries of a partially known tensor under a low-rank constraint. In this paper, we mainly study low rank third-order tensor completion problems by using Riemannian optimization methods on…
Tensors play a central role in many modern machine learning and signal processing applications. In such applications, the target tensor is usually of low rank, i.e., can be expressed as a sum of a small number of rank one tensors. This…
The block tensor of trifocal tensors provides crucial geometric information on the three-view geometry of a scene. The underlying synchronization problem seeks to recover camera poses (locations and orientations up to a global…
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,…
Tensor time series, which is a time series consisting of tensorial observations, has become ubiquitous. It typically exhibits high dimensionality. One approach for dimension reduction is to use a factor model structure, in a form similar to…
This paper constructs the geometrically natural objects which are associated with any projection tensor field on a manifold with any affine connection. The approaches to projection tensor fields which have been used in general relativity…
We make a geometric study of the Geometric Rank of tensors recently introduced by Kopparty et al. Results include classification of tensors with degenerate geometric rank in $C^3\otimes C^3\otimes C^3$, classification of tensors with…
We present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor…
Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…
The subrank of tensors is a measure of how much a tensor can be ''diagonalized''. This parameter was introduced by Strassen to study fast matrix multiplication algorithms in algebraic complexity theory and is closely related to many central…
This paper investigates the low-rank tensor completion problem, which is about recovering a tensor from partially observed entries. We consider this problem in the tensor train format and extend the preconditioned metric from the matrix…
The purpose of this article is to introduce projective geometry over composition algebras : the equivalent of projective spaces and Grassmannians over them are defined. It will follow from this definition that the projective spaces are in…