Quantized nonnegative matrix factorization

Even though Nonnegative Matrix Factorization (NMF) in its original form performs rank reduction and signal compaction implicitly, it does not explicitly consider storage or transmission constraints. We propose a Frobenius-norm Quantized Nonnegative Matrix Factorization algorithm that is 1) almost as...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Conference on Digital Signal Processing proceedings S. 377 - 382
1. Verfasser: de Frein, Ruairi
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.08.2014
Schlagworte:
ISSN:1546-1874
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Even though Nonnegative Matrix Factorization (NMF) in its original form performs rank reduction and signal compaction implicitly, it does not explicitly consider storage or transmission constraints. We propose a Frobenius-norm Quantized Nonnegative Matrix Factorization algorithm that is 1) almost as precise as traditional NMF for decomposition ranks of interest (with in 1-4dB), 2) admits to practical encoding techniques by learning a factorization which is simpler than NMF's (by a factor of 20-70) and 3) exhibits a complexity which is comparable with state-of-the-art NMF methods. These properties are achieved by considering the quantization residual via an outer quantization optimization step, in an extended NMF iteration, namely QNMF. This approach comes in two forms: QNMF with 1) quasi-fixed and 2) adaptive quantization levels. Quantized NMF considers element-wise quantization constraints in the learning algorithm to eliminate defects due to post factorization quantization. We demonstrate significant reduction in the cardinality of the factor signal values set for comparable Signal-to-Noise-Ratios in a matrix decomposition task.
ISSN:1546-1874
DOI:10.1109/ICDSP.2014.6900690