Signal Processing 2020 DOI: 10.1016/j.sigpro.2020.107472 View full text
|
|
Share
Marouane Nazih, Khalid Minaoui, Pierre Comon

Abstract: Canonical Polyadic (CP) tensor decomposition is useful in many real-world applications due to its uniqueness, and the ease of interpretation of its factor matrices. This work addresses the problem of calculating the CP decomposition of tensors in difficult cases where the factor matrices in one or all modes are almost collinear-i.e. bottleneck or swamp problems arise. This is done by introducing a constraint on the coherences of the factor matrices that ensures the existence of a best low-rank approximation, w…

expand abstract