We deal with Oberwolfach factorizations of the complete graphs Kn and K n *, which admit a regular group of automorphisms. We show that the existence of such a factorization is equivalent to the existence of a certain difference sequence defined on the elements of the automorphism group, or to a certain sequencing of the elements of that group. In the particular case of a hamiltonian factorizat...

A novel robust method for outlier detection in structure and motion recovery for afJine cameras is presented. It is an extension of the well-known Tomasi-Kanade factorization technique designed to handle outliers. It can also be seen as an importation of the LMedS technique or W S A C into the factorization framework. Based on the computation of distances between subspaces, it relates closely w...

This paper presents a unified approach to solve different bilinear factorization problems in Computer Vision in the presence of missing data in the measurements. The problem is formulated as a constrained optimization problem where one of the factors is constrained to lie on a specific manifold. To achieve this, we introduce an equivalent reformulation of the bilinear factorization problem. Thi...

Nonnegative matrix factorization (NMF) is one of the most frequently-used matrix factorization models in data analysis. A significant reason to the popularity of NMF is its interpretability and the ‘parts of whole’ interpretation of its components. Recently, max-times, or subtropical, matrix factorization (SMF) has been introduced as an alternative model with equally interpretable ‘winner takes...

Weak factorization systems Weak factorization systems are of paramount importance to homotopical algebra. This connection is best illustrated by the following definition, due to Joyal and Tierney [JT07]. Definition 1. A Quillen model structure on a category M, with a class of maps W called weak equivalences satisfying the 2-of-3 property, consists of two classes of maps C and F so that (C ∩W,F)...

A family of structure from motion algorithms called the factorization method has been recently developed from the orthographic projection model to the afJine camera model [23, i6, 181, All these algorithms are limited to handling only point features of the image stream. W e propose in this paper an algorithm for the recovery of shape and motion from line correspondences by the factorization met...

A family of structure from motion algorithms called the factorization method has been recently developed from the orthographic projection model to the a ne camera model [23, 16, 18]. All these algorithms are limited to handling only point features of the image stream. We propose in this paper an algorithm for the recovery of shape and motion from line correspondences by the factorization method...

We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equations associated with elliptic partial differential equations in two and three dimensions (and other matrices with similar hierarchical rank structure). Unlike previous skeletonizationbased factorizat...

We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equations associated with elliptic partial differential equations in two and three dimensions (and other matrices with similar hierarchical rank structure). Unlike previous skeletonizationbased factorizat...

Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF factorization. Empirically, the running time of pMMF scales linearly in the dimension for sparse matrices. We argue that this makes pMMF a valuable new computational prim...