University of Cambridge > Talks.cam > Signal Processing and Communications Lab Seminars > Markov Random Fields for Classification in High Dimensional Spaces with Application to fMRI Analysis

Markov Random Fields for Classification in High Dimensional Spaces with Application to fMRI Analysis

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Rachel Fogg.

In this talk we present a new classification algorithm for high dimensional problems. The algorithm uses a Markov random field for modeling meaningful interactions within the training data set. The model parameters are efficiently estimated using the Kalman filter algorithm and adapted to fit the test data using a recursive matrix formulation of the extended Baum-Welch algorithm. A spatially likelihood test procedure is then used for classifying the data. The performance of the new algorithm is demonstrated in fMRI classification.

This talk is part of the Signal Processing and Communications Lab Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity