Hierarchical segmentation using a composite criterion for remotely sensed imagery

Morris Goldberg, Jinyun Zhang
{"title":"Hierarchical segmentation using a composite criterion for remotely sensed imagery","authors":"Morris Goldberg,&nbsp;Jinyun Zhang","doi":"10.1016/0031-8663(87)90044-5","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, an image segmentation algorithm based upon hierarchical step-wise optimization with a composite merge criterion is presented. In hierarchical step-wise optimization, at each step, the two segments which optimize a criterion/cost function are found and merged. The main innovation proposed in this paper is that different criteria are employed at different stages in the hierarchical process. At the lowest stage, when the segment size is still small, the segment mean is the main information and is used in the merge criterion. For the intermediate stages, with increasing segment size, the mean is no longer sufficient to describe the characteristics of a segment and, therefore, a criterion related to the mean and the variance is considered. At the final stage, additional information, such as the edge information is included in the criterion. In other words, with increasing segment size, more information is required to describe the characteristics of the segments and is incorporated into a composite criterion. Experimental results on a Landsat image show that improved segmentations can result when a composite criterion is employed.</p></div>","PeriodicalId":101020,"journal":{"name":"Photogrammetria","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1987-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0031-8663(87)90044-5","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Photogrammetria","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0031866387900445","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper, an image segmentation algorithm based upon hierarchical step-wise optimization with a composite merge criterion is presented. In hierarchical step-wise optimization, at each step, the two segments which optimize a criterion/cost function are found and merged. The main innovation proposed in this paper is that different criteria are employed at different stages in the hierarchical process. At the lowest stage, when the segment size is still small, the segment mean is the main information and is used in the merge criterion. For the intermediate stages, with increasing segment size, the mean is no longer sufficient to describe the characteristics of a segment and, therefore, a criterion related to the mean and the variance is considered. At the final stage, additional information, such as the edge information is included in the criterion. In other words, with increasing segment size, more information is required to describe the characteristics of the segments and is incorporated into a composite criterion. Experimental results on a Landsat image show that improved segmentations can result when a composite criterion is employed.

基于复合准则的遥感图像分层分割
提出了一种基于复合合并准则的分层分步优化图像分割算法。在分层分步优化中,在每一步中,找到优化标准/成本函数的两个分段并将其合并。本文提出的主要创新点是在分级过程的不同阶段采用不同的标准。在最低阶段,当段大小仍然很小时,段均值是主要信息,用于合并准则。对于中间阶段,随着段大小的增加,均值不再足以描述段的特征,因此,考虑与均值和方差相关的标准。在最后阶段,附加信息,如边缘信息被包含在标准中。换句话说,随着段大小的增加,需要更多的信息来描述段的特征,并将其纳入复合准则。在陆地卫星图像上的实验结果表明,采用复合准则可以得到较好的分割效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信