Affordable Access

Curve Registered Coupled Low Rank Factorization

Authors
  • Cohen, Jérémy E.
  • Cabral Farias, Rodrigo
  • Rivet, Bertrand
Publication Date
Feb 16, 2018
Source
Kaleidoscope Open Archive
Keywords
Language
English
License
Unknown
External links

Abstract

We propose an extension of the canonical polyadic (CP) tensor model where one of the latent factors is allowed to vary through data slices in a constrained way. The components of the latent factors, which we want to retrieve from data, can vary from one slice to another up to a diffeomorphism. We suppose that the diffeomorphisms are also unknown, thus merging curve registration and tensor decomposition in one model, which we call registered CP. We present an algorithm to retrieve both the latent factors and the diffeomorphism, which is assumed to be in a parametrized form. At the end of the paper, we show simulation results comparing registered CP with other models from the literature.

Report this publication

Statistics

Seen <100 times