Enhanced Solutions for the Block-Term Decomposition in Rank-$(L_{r},L_{r},1)$ Terms

نویسندگان

چکیده

The block-term decompositions (BTD) represent tensors as a linear combination of low multilinear rank terms and can be explicitly related to the Canonical Polyadic decomposition (CPD). In this paper, we introduce SECSI-BTD framework, which exploits connection between two estimate block-terms rank- $(L_{r},L_{r},1)$ BTD. proposed algorithm includes initial calculation factor estimates using SE mi-algebraic framework for approximate polyadic via SI multaneous Matrix Diagonalizations (SECSI), followed by clustering refinement procedures that return appropriate BTD terms. Moreover, new approach structure tensor based on HOSVD notation="LaTeX">$k$ -means clustering. Since does not require known but still take advantage ranks when available, it is more flexible than existing techniques in literature. Additionally, our multiple initializations, simulation results show provides accurate better convergence behavior an extensive range SNRs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coupled rank-(Lm, Ln, •) block term decomposition by coupled block simultaneous generalized Schur decomposition

Coupled decompositions of multiple tensors are fundamental tools for multi-set data fusion. In this paper, we introduce a coupled version of the rank-(Lm, Ln, ·) block term decomposition (BTD), applicable to joint independent subspace analysis. We propose two algorithms for its computation based on a coupled block simultaneous generalized Schur decomposition scheme. Numerical results are given ...

متن کامل

Block term decomposition for modelling epileptic seizures

Recordings of neural activity, such as EEG, are an inherent mixture of different ongoing brain processes as well as artefacts and are typically characterised by low signal-to-noise ratio. Moreover, EEG datasets are often inherently multidimensional, comprising information in time, along different channels, subjects, trials, etc. Additional information may be conveyed by expanding the signal int...

متن کامل

Block-Decoupling Multivariate Polynomials Using the Tensor Block-Term Decomposition

We present a tensor-based method to decompose a given set of multivariate functions into linear combinations of a set of multivariate functions of linear forms of the input variables. The method proceeds by forming a three-way array (tensor) by stacking Jacobian matrix evaluations of the function behind each other. It is shown that a blockterm decomposition of this tensor provides the necessary...

متن کامل

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...

15 صفحه اول

Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(Lr, Lr, 1) Terms, and a New Generalization

The canonical polyadic and rank-(Lr , Lr , 1) block term decomposition (CPD and BTD, respectively) are two closely related tensor decompositions. The CPD and, recently, BTD are important tools in psychometrics, chemometrics, neuroscience, and signal processing. We present a decomposition that generalizes these two and develop algorithms for its computation. Among these algorithms are alternatin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2023

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2023.3289730