Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering

DOI10.1109/TSP.2016.2602800MaRDI QIDQ4621081zbMATH OpenFDO

Authors Xiao Fu, Kejun Huang, Bo Yang, Wing-Kin Ma, Nicholas D. Sidiropoulos

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.04290

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: This paper considers emph{volume minimization} (VolMin)-based structured matrix factorization (SMF). VolMin is a factorization criterion that decomposes a given data matrix into a basis matrix times a structured coefficient matrix via finding the minimum-volume simplex that encloses all the columns of the data matrix. Recent work showed that VolMin guarantees the identifiability of the factor matrices under mild conditions that are realistic in a wide variety of applications. This paper focuses on both theoretical and practical aspects of VolMin. On the theory side, exact equivalence of two independently developed sufficient conditions for VolMin identifiability is proven here, thereby providing a more comprehensive understanding of this aspect of VolMin. On the algorithm side, computational complexity and sensitivity to outliers are two key challenges associated with real-world applications of VolMin. These are addressed here via a new VolMin algorithm that handles volume regularization in a computationally simple way, and automatically detects and {iteratively downweights} outliers, simultaneously. Simulations and real-data experiments using a remotely sensed hyperspectral image and the Reuters document corpus are employed to showcase the effectiveness of the proposed algorithm.

Cited in

(8)

• Tensor train rank minimization with nonlocal self-similarity for tensor completion
• Low-rank tensor train for tensor robust principal component analysis
• Accelerating nonnegative matrix factorization algorithms using extrapolation
• Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
• Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
• SISAL revisited
• Coseparable Nonnegative Matrix Factorization
• Key-frame detection and super-resolution of hyperspectral video via sparse-based cumulative tensor factorization

This page was built for publication: Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621081)