2016 24th European Signal Processing Conference (EUSIPCO) 2016
DOI: 10.1109/eusipco.2016.7760332
|View full text |Cite
|
Sign up to set email alerts
|

Mining the bilinear structure of data with approximate joint diagonalization

Abstract: Approximate Joint Diagonalization of a matrix set can solve the linear Blind Source Separation problem. If the data possesses a bilinear structure, for example a spatio-temporal structure, transformations such as tensor decomposition can be applied. In this paper we show how the linear and bilinear joint diagonalization can be applied for extracting sources according to a composite model where some of the sources have a linear structure and other a bilinear structure. This is the case of Event Related Potentia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
references
References 14 publications
(33 reference statements)
0
0
0
Order By: Relevance