IDEAS home Printed from https://ideas.repec.org/a/spr/stpapr/v66y2025i4d10.1007_s00362-025-01714-w.html
   My bibliography  Save this article

Deflation properties in tensor-based eye blink removal algorithm

Author

Listed:
  • Zuzana Rošťáková

    (Slovak Academy of Sciences)

  • Roman Rosipal

    (Slovak Academy of Sciences
    Pacific Development and Technology, LLC)

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.

Suggested Citation

  • Zuzana Rošťáková & Roman Rosipal, 2025. "Deflation properties in tensor-based eye blink removal algorithm," Statistical Papers, Springer, vol. 66(4), pages 1-25, June.
  • Handle: RePEc:spr:stpapr:v:66:y:2025:i:4:d:10.1007_s00362-025-01714-w
    DOI: 10.1007/s00362-025-01714-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00362-025-01714-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00362-025-01714-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:stpapr:v:66:y:2025:i:4:d:10.1007_s00362-025-01714-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.