Deflation properties in tensor-based eye blink removal algorithm

Abstract Blind source separation refers to a set of techniques designed to uncover latent (i.e. directly unobservable) structures in data. Depending on user preferences and the chosen algorithm, latent components can be estimated either simultaneously or iteratively, one at a time. The latter approach is typically performed using component deflation. However, Camacho et al. (Chemom Intell Lab Syst 208:104212, 2021) showed that deflation can introduce spurious artefacts into the data, particularly when the latent components are estimated under constraints. This study explored the theoretical properties of deflation in the context of higher-order arrays and tensor decomposition. In certain cases, the tensor latent components may represent noise and must be removed before further decomposition to accurately reveal the underlying structure of the data. Building on the ideas presented in Camacho et al. (Chemom Intell Lab Syst 208:104212, 2021), we investigated whether specific forms of deflation can generate spurious artefacts in electroencephalogram (EEG) tensor data, particularly under nonnegativity or unimodality constraints, where orthogonality may lack a natural interpretation. Our results are demonstrated using two real EEG datasets and one simulated dataset.

Authors

Institutions

Publication Details

Journal
Statistical Papers
Published
2025-05-08
DOI
https://doi.org/10.1007/s00362-025-01714-w
Citations
2
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
3.07

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deflation properties in tensor-based eye blink removal algorithm

Roman Rosipal, Zuzana Rošťáková
2 citations
Statistical Papers
Tensor decomposition and applications
3.07
article

Deflation properties in tensor-based eye blink removal algorithm

Roman Rosipal, Zuzana Rošťáková
article en
2 citations

Abstract

Abstract Blind source separation refers to a set of techniques designed to uncover latent (i.e. directly unobservable) structures in data. Depending on user preferences and the chosen algorithm, latent components can be estimated either simultaneously or iteratively, one at a time. The latter approach is typically performed using component deflation. However, Camacho et al. (Chemom Intell Lab Syst 208:104212, 2021) showed that deflation can introduce spurious artefacts into the data, particularly when the latent components are estimated under constraints. This study explored the theoretical properties of deflation in the context of higher-order arrays and tensor decomposition. In certain cases, the tensor latent components may represent noise and must be removed before further decomposition to accurately reveal the underlying structure of the data. Building on the ideas presented in Camacho et al. (Chemom Intell Lab Syst 208:104212, 2021), we investigated whether specific forms of deflation can generate spurious artefacts in electroencephalogram (EEG) tensor data, particularly under nonnegativity or unimodality constraints, where orthogonality may lack a natural interpretation. Our results are demonstrated using two real EEG datasets and one simulated dataset.

Statistical PapersVol. 66(4)
Pacific Environment (US), Institute of Measurement Science of the Slovak Academy of Sciences (SK)
Slovenská Akadémia Vied
Openalex Percentile: Top 9%
Tensor decomposition and applications
3.07
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Deflation properties in tensor-based eye blink removal algorithm — Roman Rosipal, Zuzana Rošťáková · Statistical Papers (2025) | TGRS Research Map | TGRS