{"title":"Motion estimation using mean field annealing applied to MRI","authors":"S. Rajala, I. M. Abdelqader, G. Bilbro, W. Snyder","doi":"10.1109/CBMS.1992.244942","DOIUrl":null,"url":null,"abstract":"A novel method for obtaining dense displacement fields from a sequence of frames is presented. The algorithm is based on modeling the displacement field as a Markov random field, hence making it possible to use the equivalence of a Markov random field and a Gibbs distribution. The Gibbs distribution is used to define a mean field probability density function, and the displacement field is found using a mean field annealing algorithm. Mean field annealing is a technique which finds the global or near global minima in nonconvex optimization problems. Analysis of the algorithm and experimental results are presented.<<ETX>>","PeriodicalId":197891,"journal":{"name":"[1992] Proceedings Fifth Annual IEEE Symposium on Computer-Based Medical Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings Fifth Annual IEEE Symposium on Computer-Based Medical Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CBMS.1992.244942","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A novel method for obtaining dense displacement fields from a sequence of frames is presented. The algorithm is based on modeling the displacement field as a Markov random field, hence making it possible to use the equivalence of a Markov random field and a Gibbs distribution. The Gibbs distribution is used to define a mean field probability density function, and the displacement field is found using a mean field annealing algorithm. Mean field annealing is a technique which finds the global or near global minima in nonconvex optimization problems. Analysis of the algorithm and experimental results are presented.<>