Title
Fast L1-NMF for Multiple Parametric Model Estimation.
Abstract
In this work we introduce a comprehensive algorithmic pipeline for multiple parametric model estimation. The proposed approach analyzes the information produced by a random sampling algorithm (e.g., RANSAC) from a machine learning/optimization perspective, using a textit{parameterless} biclustering algorithm based on L1 nonnegative matrix factorization (L1-NMF). The proposed framework exploits consistent patterns that naturally arise during the RANSAC execution, while explicitly avoiding spurious inconsistencies. Contrarily to the main trends in the literature, the proposed technique does not impose non-intersecting parametric models. A new accelerated algorithm to compute L1-NMFs allows to handle medium-sized problems faster while also extending the usability of the algorithm to much larger datasets. This accelerated algorithm has applications in any other context where an L1-NMF is needed, beyond the biclustering approach to parameter estimation here addressed. We accompany the algorithmic presentation with theoretical foundations and numerous and diverse examples.
Year
Venue
Field
2016
arXiv: Computer Vision and Pattern Recognition
Parametric model,Pattern recognition,RANSAC,Computer science,Usability,Non-negative matrix factorization,Artificial intelligence,Sampling (statistics),Biclustering,Estimation theory,Spurious relationship,Machine learning
DocType
Volume
Citations 
Journal
abs/1610.05712
0
PageRank 
References 
Authors
0.34
1
2
Name
Order
Citations
PageRank
Mariano Tepper16812.80
Guillermo Sapiro2148131051.92