mlsanityData to 7 Oct 2026

Spatially Coherent Clustering Based on Orthogonal Nonnegative Matrix Factorization

arXiv 2104.12289 ↗First posted 25 Apr 2021math.NA cs.LG cs.NAcited by 1

Not on the map. Why?

Abstract (arXiv)

Classical approaches in cluster analysis are typically based on a feature space analysis. However, many applications lead to datasets with additional spatial information and a ground truth with spatially coherent classes, which will not necessarily be reconstructed well by standard clustering methods. Motivated by applications in hyperspectral imaging, we introduce in this work clustering models based on orthogonal nonnegative matrix factorization, which include an additional total variation (TV) regularization procedure on the cluster membership matrix to enforce the needed spatial coherence in the clusters. We propose several approaches with different optimization techniques, where the TV regularization is either performed as a subsequent postprocessing step or included into the clustering algorithm. Finally, we provide a numerical evaluation of all proposed methods on a hyperspectral dataset obtained from a matrix-assisted laser desorption/ionisation imaging measurement, which leads to significantly better clustering results compared to classical clustering models.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 70 references that are in the map. First posted on arXiv 25 Apr 2021.

Builds on

11 of 70 references.

References · 11

  1. 2017Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problemscited by 40
  2. 2019Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorizationcited by 7
  3. 2020A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorizationcited by 4
  4. 2017Deep Approximately Orthogonal Nonnegative Matrix Factorization for Clusteringcited by 3
  5. 2020Joint Reconstruction and Low-Rank Decomposition for Dynamic Inverse Problemscited by 3
  6. 2015A Review of Nonnegative Matrix Factorization Methods for Clusteringcited by 2
  7. 2020A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorizationcited by 2
  8. 2020Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problemcited by 2
  9. 2015Sequential Dimensionality Reduction for Extracting Localized Featurescited by 1
  10. 2018A Survey on Surrogate Approaches to Non-negative Matrix Factorizationcited by 1
  11. 2020SPRING: A fast stochastic proximal alternating method for non-smooth non-convex optimizationcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.