Evaluation of adaptive parafac alogorithms for tracking of simulated moving brain sources

Fotouhi, Ardeshir; Eqlimi, Ehsan; Makkiabadi, Bahador

doi:10.1109/embc.2015.7319226

Cited by 5 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Acar et al in [134] proposed to use the Parafac2 model for tracking the evolution of connectivity networks and compared its performance with ICA and IVA. For the problem of localizing dynamic brain sources over time, Ardeshir et al in [135] utilized the boundary element method (BEM) [136] and the adaptive PARAFAC-RLST tracker [46] with two operational windowing schemes. A variant using augmented complex statistics in [137] also has the ability to track moving EEG sources with time.…”

Section: Neurosciencementioning

confidence: 99%

A Contemporary and Comprehensive Survey on Streaming Tensor Decomposition

Thanh¹,

abed-meraim²,

Linh-Trung³

et al. 2022

Preprint

View full text Add to dashboard Cite

<p>Tensor decomposition has been demonstrated to be successful in a wide range of applications, from neuroscience and wireless communications to social networks. In an online setting, factorizing tensors derived from multidimensional data streams is however non-trivial due to several inherent problems of real-time stream processing. In recent years, many research efforts have been dedicated to developing online techniques for decomposing such tensors, resulting in significant advances in streaming tensor decomposition or tensor tracking. This topic is emerging and enriches the literature on tensor decomposition, particularly from the data stream analystics perspective. Thus, it is imperative to carry out an overview of tensor tracking to help researchers and practitioners understand its development and achievements, summarise the current trends and advances, and identify challenging problems. In this article, we provide a contemporary and comprehensive survey on different types of tensor tracking techniques. We particularly categorize the state-of-the-art methods into three main groups: streaming CP decompositions, streaming Tucker decompositions, and streaming decompositions under other tensor formats (i.e., tensor-train, t-SVD, and BTD). In each group, we further divide the existing algorithms into sub-categories based on their main optimization framework and model architectures. Finally, we present several research challenges, open problems, and potential directions of tensor tracking in the future.</p>

show abstract

Section: Neurosciencementioning

confidence: 99%

A Contemporary and Comprehensive Survey on Streaming Tensor Decomposition

Thanh¹,

abed-meraim²,

Linh-Trung³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Applications of OTF abound. They include unveiling the topology of evolving networks [70], spatio-temporal prediction or image in-painting [41], multiple-input multiple-output (MIMO) wireless communications [13], [71], brain imaging [72], monitoring heart-related features from wearable sensors for multi-lead electro-cardiography (ECG) [73], anomaly detection in networks and topic modeling [16], structural health monitoring (in an internet of things (IoT) context) [36], online cartography (spectrum map reconstruction in cognitive radio networks) [14], detection of anomalies in the process of 3D printing [74], data traffic monitoring in networks [10], [16], cardiac MRI [10], stream data compression (e.g., in power distribution systems [75] or in video [76]), and online completion [10], [77], [78], among others.…”

Section: Related Workmentioning

confidence: 99%

Online Rank-Revealing Block-Term Tensor Decomposition

Rontogiannis¹,

Kofidis²,

Giampouras³

2021

Preprint

View full text Add to dashboard Cite

The so-called block-term decomposition (BTD) tensor model, especially in its rank-(Lr, Lr, 1) version, has been recently receiving increasing attention due to its enhanced ability of representing systems and signals that are composed of block components of rank higher than one, a scenario encountered in numerous and diverse applications. Its uniqueness and approximation have thus been thoroughly studied. The challenging problem of estimating the BTD model structure, namely the number of block terms (rank) and their individual (block) ranks, is of crucial importance in practice and has only recently started to attract significant attention. In data-streaming scenarios and/or big data applications, where the tensor dimension in one of its modes grows in time or can only be processed incrementally, it is essential to be able to perform model selection and computation in a recursive (incremental/online) manner. To date there is only one such work in the literature concerning the (general rank-(L, M, N )) BTD model, which proposes an incremental method, however with the BTD rank and block ranks assumed to be a-priori known and time invariant. In this preprint, a novel approach to rank-(Lr, Lr, 1) BTD model selection and tracking is proposed, based on the idea of imposing column sparsity jointly on the factors and estimating the ranks as the numbers of factor columns of nonnegligible magnitude. An online method of the alternating iteratively reweighted least squares (IRLS) type is developed and shown to be computationally efficient and fast converging, also allowing the model ranks to change in time. Its time and memory efficiency are evaluated and favorably compared with those of the batch approach. Simulation results are reported that demonstrate the effectiveness of the proposed scheme in both selecting and tracking the correct BTD model.

show abstract