Prewhitening high-dimensional fMRI data sets without eigendecomposition
From MaRDI portal
Publication:5378349
DOI10.1162/NECO_A_00578zbMATH Open1415.92109DBLPjournals/neco/SeghouaneS14OpenAlexW2129825861WikidataQ35098678 ScholiaQ35098678MaRDI QIDQ5378349FDOQ5378349
Authors: Abd-Krim Seghouane, Y. Saad 
Publication date: 12 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00578
Recommendations
- MMSE whitening and subspace whitening
- Blind unitary prewhitening with a real-valued eigendecomposition
- Application of the sequential matrix diagonalization algorithm to high-dimensional functional MRI data
- Whitening of background brain activity via parametric modeling
- Rank-deficient prewhitening with quotient SVD and ULV decompositions
Lanczos vectorshigh-dimensional fMRI data setslinear whitening algorithmtruncated eigendecomposition
Cites Work
- Principal component analysis.
- Title not available (Why is that?)
- The rate of convergence of conjugate gradients
- Numerical methods for large eigenvalue problems
- The statistical analysis of functional MRI data
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- A Small Sample Model Selection Criterion Based on Kullback's Symmetric Divergence
- MMSE whitening and subspace whitening
- Bayesian estimation of the number of principal components
Cited In (5)
- Whitening of background brain activity via parametric modeling
- Blind unitary prewhitening with a real-valued eigendecomposition
- Graph-based normalization and whitening for non-linear data analysis
- Novel whitening approaches in functional settings
- Application of the sequential matrix diagonalization algorithm to high-dimensional functional MRI data
This page was built for publication: Prewhitening high-dimensional fMRI data sets without eigendecomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378349)
