图像分割中的马尔可夫随机场

Z. Kato, J. Zerubia
{"title":"图像分割中的马尔可夫随机场","authors":"Z. Kato, J. Zerubia","doi":"10.1561/2000000035","DOIUrl":null,"url":null,"abstract":"Markov Random Fields in Image Segmentation provides an introduction to the fundamentals of Markovian modeling in image segmentation as well as a brief overview of recent advances in the field. Segmentation is formulated within an image labeling framework, where the problem is reduced to assigning labels to pixels. In a probabilistic approach, label dependencies are modeled by Markov random fields (MRF) and an optimal labeling is determined by Bayesian estimation, in particular maximum a posteriori (MAP) estimation. The main advantage of MRF models is that prior information can be imposed locally through clique potentials. MRF models usually yield a non-convex energy function. The minimization of this function is crucial in order to find the most likely segmentation according to the MRF model. Classical optimization algorithms including simulated annealing and deterministic relaxation are treated along with more recent graph cut-based algorithms. The primary goal of this monograph is to demonstrate the basic steps to construct an easily applicable MRF segmentation model and further develop its multi-scale and hierarchical implementations as well as their combination in a multilayer model. Representative examples from remote sensing and biological imaging are analyzed in full detail to illustrate the applicability of these MRF models. Furthermore, a sample implementation of the most important segmentation algorithms is available as supplementary software. Markov Random Fields in Image Segmentation is an invaluable resource for every student, engineer, or researcher dealing with Markovian modeling for image segmentation.","PeriodicalId":12340,"journal":{"name":"Found. Trends Signal Process.","volume":"77 1","pages":"1-155"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"84","resultStr":"{\"title\":\"Markov Random Fields in Image Segmentation\",\"authors\":\"Z. Kato, J. Zerubia\",\"doi\":\"10.1561/2000000035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Markov Random Fields in Image Segmentation provides an introduction to the fundamentals of Markovian modeling in image segmentation as well as a brief overview of recent advances in the field. Segmentation is formulated within an image labeling framework, where the problem is reduced to assigning labels to pixels. In a probabilistic approach, label dependencies are modeled by Markov random fields (MRF) and an optimal labeling is determined by Bayesian estimation, in particular maximum a posteriori (MAP) estimation. The main advantage of MRF models is that prior information can be imposed locally through clique potentials. MRF models usually yield a non-convex energy function. The minimization of this function is crucial in order to find the most likely segmentation according to the MRF model. Classical optimization algorithms including simulated annealing and deterministic relaxation are treated along with more recent graph cut-based algorithms. The primary goal of this monograph is to demonstrate the basic steps to construct an easily applicable MRF segmentation model and further develop its multi-scale and hierarchical implementations as well as their combination in a multilayer model. Representative examples from remote sensing and biological imaging are analyzed in full detail to illustrate the applicability of these MRF models. Furthermore, a sample implementation of the most important segmentation algorithms is available as supplementary software. Markov Random Fields in Image Segmentation is an invaluable resource for every student, engineer, or researcher dealing with Markovian modeling for image segmentation.\",\"PeriodicalId\":12340,\"journal\":{\"name\":\"Found. Trends Signal Process.\",\"volume\":\"77 1\",\"pages\":\"1-155\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"84\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Found. Trends Signal Process.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1561/2000000035\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Found. Trends Signal Process.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1561/2000000035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 84

摘要

《图像分割中的马尔可夫随机场》介绍了图像分割中的马尔可夫建模的基本原理,并简要概述了该领域的最新进展。分割是在图像标记框架内制定的,其中问题被简化为为像素分配标签。在概率方法中,标签依赖关系由马尔可夫随机场(MRF)建模,最优标记由贝叶斯估计确定,特别是最大后验估计(MAP)。磁流变函数模型的主要优点是可以通过团势局部施加先验信息。磁流变函数模型通常产生一个非凸能量函数。为了根据MRF模型找到最可能的分割,这个函数的最小化是至关重要的。经典的优化算法包括模拟退火和确定性松弛,以及最近的基于图割的算法。本专著的主要目标是演示构建易于应用的MRF分割模型的基本步骤,并进一步发展其多尺度和分层实现以及它们在多层模型中的组合。从遥感和生物成像的代表性的例子进行了详细的分析,以说明这些磁共振成像模型的适用性。此外,还提供了最重要的分割算法的示例实现作为补充软件。马尔可夫随机场图像分割是一个宝贵的资源,为每一个学生,工程师,或研究人员处理马尔可夫建模图像分割。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Markov Random Fields in Image Segmentation
Markov Random Fields in Image Segmentation provides an introduction to the fundamentals of Markovian modeling in image segmentation as well as a brief overview of recent advances in the field. Segmentation is formulated within an image labeling framework, where the problem is reduced to assigning labels to pixels. In a probabilistic approach, label dependencies are modeled by Markov random fields (MRF) and an optimal labeling is determined by Bayesian estimation, in particular maximum a posteriori (MAP) estimation. The main advantage of MRF models is that prior information can be imposed locally through clique potentials. MRF models usually yield a non-convex energy function. The minimization of this function is crucial in order to find the most likely segmentation according to the MRF model. Classical optimization algorithms including simulated annealing and deterministic relaxation are treated along with more recent graph cut-based algorithms. The primary goal of this monograph is to demonstrate the basic steps to construct an easily applicable MRF segmentation model and further develop its multi-scale and hierarchical implementations as well as their combination in a multilayer model. Representative examples from remote sensing and biological imaging are analyzed in full detail to illustrate the applicability of these MRF models. Furthermore, a sample implementation of the most important segmentation algorithms is available as supplementary software. Markov Random Fields in Image Segmentation is an invaluable resource for every student, engineer, or researcher dealing with Markovian modeling for image segmentation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信