Boolean CP Decomposition of Binary Tensors: Uniqueness and Algorithm

Mamadou Diop; Sebastian Miron; Antoine Souloumiac; David Brie

ICASSP 2019accepted0 citations

Boolean CP Decomposition of Binary Tensors: Uniqueness and Algorithm

Mamadou Diop, Sebastian Miron, Antoine Souloumiac, David Brie

Abstract

We propose an algorithm to perform the low-rank Boolean Canonical Polyadic Decomposition (BCPD) of a binary tensor. The proposed approach is based on the AO-ADMM strategy introduced in [1] and uses a post-nonlinear mixture model for binary sources. We show that this new method is better suited for low-rank approximation of binary tensors compared to other similar methods. We also provide an easy-to-check uniqueness condition for the BCPD. This is the first time that such a condition is derived for Boolean decompositions.

BibTeX

@inproceedings{icassp2019_booleancpdecompo,
  title = {Boolean CP Decomposition of Binary Tensors: Uniqueness and Algorithm},
  author = {Mamadou Diop and Sebastian Miron and Antoine Souloumiac and David Brie},
  booktitle = {ICASSP 2019},
  year = {2019}
}