All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

The use of self-adaptive principal components in PCA-based denoising

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10508734" target="_blank" >RIV/00216208:11320/25:10508734 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=yrzwXTCDwx" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=yrzwXTCDwx</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.jmr.2024.107824" target="_blank" >10.1016/j.jmr.2024.107824</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    The use of self-adaptive principal components in PCA-based denoising

  • Original language description

    PCA-based denoising usually implies either discarding a number of high-index principal components (PCs) of a data matrix or their attenuation according to a regularization model. This work introduces an alternative, model- free, approach to high-index PC attenuation that seeks to average values of PC vectors as if they were expected from noise perturbation of data. According to the perturbation theory, the average PCs are attenuated versions of the clean PCs of noiseless data - the higher the noise-related content in a PC vector, the lower is its average&apos;s norm. This enables a regularization of the PC expansion of data where the PC terms are self-adapted to their noise content. To approximate the average PC vectors, the data matrix is randomly sampled several times to obtain numerous pseudo-random PC sets. The PCs of same ranks are then used to reconstruct the full-data PCs of that rank. A numerical algorithm of the reconstruction and its implementation in Python are provided. The proposed automatic adaptation to data offers a convenient solution for those who face with a problem of scaling or discarding PCs in PCA-based denoising. Questions of optimal sampling schedule and sampling amount remain issues that future work must address.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10302 - Condensed matter physics (including formerly solid state physics, supercond.)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Journal of Magnetic Resonance

  • ISSN

    1090-7807

  • e-ISSN

    1096-0856

  • Volume of the periodical

    371

  • Issue of the periodical within the volume

    FEB

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    6

  • Pages from-to

    107824

  • UT code for WoS article

    001412331800001

  • EID of the result in the Scopus database

    2-s2.0-85213251972