Nonnegative Matrix Underapproximation for Robust Multiple Model Fitting
Preprint
Abstract
In this work, we introduce a highly efficient algorithm to address the nonnegative matrix underapproximation (NMU) problem, i.e., nonnegative matrix factorization (NMF) with an additional underapproximation constraint. NMU results are interesting as, compared to traditional NMF, they present additional sparsity and part-based behavior, explaining unique data features. To show these features in practice, we first present an application to the analysis of climate data. We then present an NMU-based algorithm to robustly fit multiple parametric models to a dataset. The proposed approach delivers state-of-the-art results for the estimation of multiple fundamental matrices and homographies, outperforming other alternatives in the literature and exemplifying the use of efficient NMU computations.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Multiple Structure Recovery via Probabilistic Biclustering2016
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysisLinear Algebra and its Applications, 2013
- An alternating direction algorithm for matrix completion with nonnegative factorsFrontiers of Mathematics in China, 2012
- Using underapproximations for sparse nonnegative matrix factorizationPattern Recognition, 2010
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysisBiostatistics, 2009
- Robust Multiple Structures Estimation with J-Linkage2008
- From Gestalt Theory to Image Analysis2008
- Positive matrix factorization: A non‐negative factor model with optimal utilization of error estimates of data valuesEnvironmetrics, 1994
- A new curve detection method: Randomized Hough transform (RHT)Pattern Recognition Letters, 1990
- Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography1987