Constrained maximum likelihood based efficient dictionary learning for fMRI analysis

Muhammad Usman Khalid, Abd Krim Seghouane

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    16 Citations (Scopus)

    Abstract

    A principal component analysis (PCA) based dictionary initialization approach accompanied by a computationally efficient dictionary learning algorithm for statistical analysis of functional magnetic resonance imaging (fMRI) is proposed. It replaces a singular value decomposition (SVD) computation with an approximate solution to obtain a local minima for a given initial dictionary. The K-SVD has been recently used to develop a data-driven sparse general linear model (GLM) framework for fMRI analysis solely based on the sparsity of signals. However, the K-SVD algorithm is computationally demanding and may require many iterations to converge. Replacing SVD with an approximate solution for the dictionary update combined with an optimal dictionary initialization, the desired results for a sparse GLM can be improved and achieved in few iterations.

    Original languageEnglish
    Title of host publication2014 IEEE 11th International Symposium on Biomedical Imaging, ISBI 2014
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages45-48
    Number of pages4
    ISBN (Electronic)9781467319591
    Publication statusPublished - 29 Jul 2014
    Event2014 IEEE 11th International Symposium on Biomedical Imaging, ISBI 2014 - Beijing, China
    Duration: 29 Apr 20142 May 2014

    Publication series

    Name2014 IEEE 11th International Symposium on Biomedical Imaging, ISBI 2014

    Conference

    Conference2014 IEEE 11th International Symposium on Biomedical Imaging, ISBI 2014
    Country/TerritoryChina
    CityBeijing
    Period29/04/142/05/14

    Fingerprint

    Dive into the research topics of 'Constrained maximum likelihood based efficient dictionary learning for fMRI analysis'. Together they form a unique fingerprint.

    Cite this