time%shi(%interpolaon% smoothing%csc.ucdavis.edu/~chaos/courses/poci/projects2014/... · soc. 550....

8

Upload: others

Post on 21-Jun-2020

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone
Page 2: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone
Page 3: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone

•  Time  Shi(  Interpola1on  

•  Mo1on  Correc1on  

•  Smoothing  

Page 4: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone

Done on the individual voxel level with smoothing Problems: Low Signal to Noise Ratio Large number of simultaneous hypotheses being

tested, diminishing significance of results.

Clustering deals with these issues.

Page 5: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone

FMRI Heuristic: Correlation Coefficient

Page 6: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone

500 iterations: 4945 clusters

3500 iterations: 1945 clusters

5000 iterations: 445 clusters

Page 7: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone

Information Questions

How much information is lost due to clustering? Is there an optimal level of clustering that

maximizes statistical significance but minimizes feature loss?

Alternative Clustering Heuristics? Like mutual information, or generated HMM similarity?

Page 8: Time%Shi(%Interpolaon% Smoothing%csc.ucdavis.edu/~chaos/courses/poci/Projects2014/... · soc. 550. 300. \ [A] AFNr AFNl_data4/sbi Norm [lone \ [B] AFNI: AFNl_data4/sb1 Norm [lone

“Optimal” Clusters

Can measure information loss by looking at statistical complexity of system at each step?

Once found: Can look for correlation with experiment events Can treat clusters as HMMs