Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization

DOI10.1007/s11045-011-0147-2zbMath1337.65038OpenAlexW1981885934WikidataQ114224597 ScholiaQ114224597MaRDI QIDQ490274

Haiqing Yin, Lingling Jiang

Publication date: 22 January 2015

Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11045-011-0147-2

zbMATH Keywords

wavelet transformnonnegative matrix factorizationsparsenessBregman iteration

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Computational methods for sparse matrices (65F50) Application of orthogonal and other special functions (94A11)

Related Items (5)

Image decomposition combining a total variational filter and a Tikhonov quadratic filter ⋮ Split Bregman algorithms for sparse group lasso with application to MRI reconstruction ⋮ Split Bregman algorithms for multiple measurement vector problem ⋮ Neighbors isometric embedding nonnegative matrix factorization for image representation ⋮ A coupled variational model for image denoising using a duality strategy and split Bregman

Cites Work

• Unnamed Item
• Unnamed Item
• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• Independent component analysis, a new concept?
• Nonnegative matrix factorization for spectral data analysis
• Linearized Bregman iterations for compressed sensing
• Linearized Bregman Iterations for Frame-Based Image Deblurring
• Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
• Local feature analysis: a general statistical theory for object representation
• Introducing a weighted non-negative matrix factorization for image classification
• Learning the parts of objects by non-negative matrix factorization
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements
• An Iterative Regularization Method for Total Variation-Based Image Restoration

This page was built for publication: Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization