• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for matematiske fag
  • View Item
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for matematiske fag
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Approximate recursive algorithm for finding MAP of binary Markov random fields

Altaye, Endale Berhane
Master thesis
Thumbnail
View/Open
351910_FULLTEXT01.pdf (348.9Kb)
351910_COVER01.pdf (48.13Kb)
URI
http://hdl.handle.net/11250/258740
Date
2010
Metadata
Show full item record
Collections
  • Institutt for matematiske fag [1456]
Abstract
The purpose of this study was to develop a recursive algorithm for computing a maximum a posteriori (MAP) estimate of a binary Markov random field (MRF) by using the MAP-MRF framework. We also discuss how to include an approximation in the recursive scheme, so that the algorithm becomes computationally feasible also for larger problems. In particular, we discuss how our algorithm can be used in an image analysis setting. We consider a situation where an unobserved latent field is assumed to follow a Markov random field prior model, a Gaussian noise-corrupted version of the latent field is observed, and we estimate the unobserved field by the MAP estimator.
Publisher
Institutt for matematiske fag

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit