Non-negative matrix factorization algorithm for the deconvolution of one dimensional chromatograms

DOI10.1016/J.AMC.2014.05.022zbMath1334.92216OpenAlexW1978700640MaRDI QIDQ279286

R. Ananda Natarajan, P. Rameshbabu, S. Anbumalar

Publication date: 27 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.05.022

zbMATH Keywords

resolutionML-nmfdiv algorithmmodified update for convergencemultivariate curve resolution-alternating least square (MCR-ALS)overlapped and embedded chromatogramsrobust, EFA and NNDSVD based initializations for uniqueness

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• Algorithms and applications for approximate nonnegative matrix factorization
• SVD based initialization: A head start for nonnegative matrix factorization
• An algorithm for overlapped chromatogram separation
• Algorithms for Sparse Nonnegative Tucker Decompositions
• Shifted Independent Component Analysis
• Learning the parts of objects by non-negative matrix factorization
• Independent Component Analysis and Blind Signal Separation

This page was built for publication: Non-negative matrix factorization algorithm for the deconvolution of one dimensional chromatograms