ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1312.7167
  4. Cited By
Near-separable Non-negative Matrix Factorization with $\ell_1$- and
  Bregman Loss Functions

Near-separable Non-negative Matrix Factorization with ℓ1\ell_1ℓ1​- and Bregman Loss Functions

27 December 2013
Abhishek Kumar
Vikas Sindhwani
ArXiv (abs)PDFHTML

Papers citing "Near-separable Non-negative Matrix Factorization with $\ell_1$- and Bregman Loss Functions"

4 / 4 papers shown
Title
Background Subtraction via Fast Robust Matrix Completion
Background Subtraction via Fast Robust Matrix Completion
B. Rezaei
Sarah Ostadabbas
137
21
0
03 Nov 2017
Introduction to Nonnegative Matrix Factorization
Introduction to Nonnegative Matrix Factorization
Nicolas Gillis
77
46
0
02 Mar 2017
Decomposition into Low-rank plus Additive Matrices for
  Background/Foreground Separation: A Review for a Comparative Evaluation with
  a Large-Scale Dataset
Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset
T. Bouwmans
A. Sobral
S. Javed
Soon Ki Jung
E. Zahzah
99
332
0
04 Nov 2015
The Why and How of Nonnegative Matrix Factorization
The Why and How of Nonnegative Matrix Factorization
Nicolas Gillis
149
365
0
21 Jan 2014
1