Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
From MaRDI portal
Publication:2299008
Recommendations
- Nonnegative matrix factorization with region sparsity learning for hyperspectral unmixing
- A Complexity Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing
- Nonlinear unmixing for hyperspectral imagery based on kernel nonnegative matrix factorization with constraints on abundances
- Hyperspectral unmixing via deep matrix factorization
- Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
Cites work
- A class of modified FR conjugate gradient method and applications to non-negative matrix factorization
- A new active set method for nonnegative matrix factorization
- A symmetric rank-one quasi-Newton method for nonnegative matrix factorization
- Algorithms and applications for approximate nonnegative matrix factorization
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set quasi-Newton method with projected search for bound constrained minimization
- An active set strategy based on the multiplier function or the gradient.
- An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
- Efficient nonnegative matrix factorization via projected Newton method
- Graph regularized nonnegative matrix factorization with sparse coding
- Graph sparse nonnegative matrix factorization algorithm based on the inertial projection neural network
- Incremental graph regulated nonnegative matrix factorization for face recognition
- Minimum Determinant Constraint for Non-negative Matrix Factorization
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- Non-negative matrix factorization with sparseness constraints
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Nonnegative matrix factorization for spectral data analysis
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
- Spectral Unmixing via Data-Guided Sparsity
Cited in
(11)- A bio-mathematical approach to control the \textit{Anopheles} mosquito using sterile males technology
- Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
- Nonnegative matrix factorization for spectral data analysis
- Hyperspectral unmixing via deep matrix factorization
- A Complexity Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
- SISAL revisited
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- Nonlinear unmixing for hyperspectral imagery based on kernel nonnegative matrix factorization with constraints on abundances
- Nonnegative matrix factorization with region sparsity learning for hyperspectral unmixing
- Unmixing of large-scale hyperspectral data based on projected mini-batch gradient descent
This page was built for publication: Active set type algorithms for nonnegative matrix factorization in hyperspectral unmixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299008)
