http://www.nitrc.org/forum/forum.php?forum_id=7405 <table border="0" width="100%"><tr><td align="left"/><td align="right"><a href="https://www.ncbi.nlm.nih.gov/sites/entrez?db=pubmed&amp;cmd=Link&amp;LinkName=pubmed_pubmed&amp;from_uid=28463189">Related Articles</a></td></tr></table> <p><b>Basis Expansions Approaches for Regularized Sequential Dictionary Learning Algorithms with Enforced Sparsity for fMRI Data Analysis.</b></p> <p>IEEE Trans Med Imaging. 2017 Apr 28;:</p> <p>Authors: Seghouane AK, Iqbal A</p> <p>Abstract<br/> Sequential dictionary learning algorithms have been successfully applied to functional magnetic resonance imaging (fMRI) data analysis. fMRI datasets are however structured data matrices with notions of temporal smoothness in the column direction. This prior information which can be converted to a constraint of smoothness on the learned dictionary atoms has seldomly been included in classical dictionary learning algorithms when applied to fMRI data analysis. In this paper we tackle this problem by proposing two new sequential dictionary learning algorithms dedicated to fMRI data analysis by accounting for this prior information. These algorithms differs from the existing ones in their dictionary update stage. The steps of this stage are derived as a variant of the power method for computing the SVD. The proposed algorithms generate regularized dictionary atoms via the solution of a left regularized rank-one matrix approximation problem where temporal smoothness is enforced via regularization through basis expansion and sparse basis expansion in the dictionary update stage. Applications on synthetic data experiments and real fMRI datasets illustrating the performance of the proposed algorithms are provided.<br/> </p><p>PMID: 28463189 [PubMed - as supplied by publisher]</p> en-us Copyright 2000-2026 NITRC OSI Wed, 06 May 2026 17:06:39 GMT http://blogs.law.harvard.edu/tech/rss NITRC RSS generator