Sequential coordinate-wise algorithm for the non-negative least squares problem

Authors:
Vojtěch Franc;Václav Hlaváč;Mirko Navara
Affiliations:
Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University;Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University;Center for Machine Perception, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University
Venue:
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Year:
2005

Citing 4
Cited 3

Practical methods of optimization; (2nd ed.)

Practical methods of optimization; (2nd ed.)
Lambertian Reflectance and Linear Subspaces

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation

AFPAC '00 Proceedings of the Second International Workshop on Algebraic Frames for the Perception-Action Cycle
Evaluation of statistical and multiple-hypothesis tracking for video traffic surveillance

Machine Vision and Applications

Fast nonnegative matrix factorization algorithms using projected gradient approaches for large-scale problems

Computational Intelligence and Neuroscience - Advances in Nonnegative Matrix and Tensor Factorization
Sequential coordinate-wise DNMF for face recognition

ICAISC'10 Proceedings of the 10th international conference on Artificial intelligence and soft computing: Part I
Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper contributes to the solution of the non-negative least squares problem (NNLS). The NNLS problem constitutes a substantial part of many computer vision methods and methods in other fields, too. We propose a novel sequential coordinate-wise algorithm which is easy to implement and it is able to cope with large scale problems. We also derive stopping conditions which allow to control the distance of the solution found to the optimal one in terms of the optimized objective function. The proposed algorithm showed promising performance in comparison to the projected Landweber method.