time%shi(%interpolaon% smoothing%csc.ucdavis.edu/~chaos/courses/poci/projects2014/... · soc. 550....
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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/1.jpg)
![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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/2.jpg)
![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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/3.jpg)
• 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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/4.jpg)
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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/5.jpg)
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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/6.jpg)
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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/7.jpg)
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](https://reader033.vdocuments.net/reader033/viewer/2022053006/5f0a763e7e708231d42bc046/html5/thumbnails/8.jpg)
“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