Related papers: A New Way to Factorize Linear Cameras
A new hybrid algorithm for LDU-factorization for large sparse matrix combining iterative solver, which can keep the same accuracy as the classical factorization, is proposed. The last Schur complement will be generated by iterative solver…
Clustering with incomplete views is a challenge in multi-view clustering. In this paper, we provide a novel and simple method to address this issue. Specifically, the proposed method simultaneously exploits the local information of each…
Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…
Working over an algebraically closed field $k$ of any characteristic, we determine the matrix factorizations for the --- suitably graded --- triangle singularities $f=x^a+y^b+z^c$ of domestic type, that is, we assume that $(a,b,c)$ are…
We study the class of those linear relations that can be factorized as products of idempotent relations. We provide several characterizations of this class, extending known factorization results for operators to the more general setting of…
Substantial progress has been made recently on developing provably accurate and efficient algorithms for low-rank matrix factorization via nonconvex optimization. While conventional wisdom often takes a dim view of nonconvex optimization…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
This paper demonstrates how to explicitly construct a bidiagonal factorization of the banded recurrence matrix that appears in mixed multiple orthogonality on the step-line in terms of the coeffcients of the mixed multiple orthogonal…
Despite the prominence of neural network approaches in the field of recommender systems, simple methods such as matrix factorization with quadratic loss are still used in industry for several reasons. These models can be trained with…
We present a matrix-factorization algorithm that scales to input matrices with both huge number of rows and columns. Learned factors may be sparse or dense and/or non-negative, which makes our algorithm suitable for dictionary learning,…
This paper proposes a method to compute camera 6Dof poses to achieve a user defined coverage. The camera placement problem is modeled as a combinatorial optimization where given the maximum number of cameras, a camera set is selected from a…
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a…
When we place a colored filter in front of a camera the effective camera response functions are equal to the given camera spectral sensitivities multiplied by the filter spectral transmittance. In this paper, we solve for the filter which…
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…
The Jacobi system with matrix-valued coefficients and with the spectral parameter depending on a matrix-valued weight factor is considered on the full-line lattice. The scattering from the full-line lattice is expressed in terms of the…
In high-dimensional classification problems, a commonly used approach is to first project the high-dimensional features into a lower dimensional space, and base the classification on the resulting lower dimensional projections. In this…
To each 4x4 matrix of reals another 4x4 matrix is constructed, the so-called associate matrix. This associate matrix is shown to have rank 1 and norm 1 (considered as a 16D vector) if and only if the original matrix is a 4D rotation matrix.…
We report a detailed analysis of the optical realization [1, 3, 2, 4] of the analogue algorithm described in the first paper of this series [5] for the simultaneous factorization of an exponential number of integers. Such an analogue…
The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization.…
Camera calibration is a necessity in various tasks including 3D reconstruction, hand-eye coordination for a robotic interaction, autonomous driving, etc. In this work we propose a novel method to predict extrinsic (baseline, pitch, and…