| 基于直方图区域生长的遥感图像阈值分割算法 |
| |
| 引用本文： | 刘思言,李玲,特日根,李竺强,马经宇,朱瑞飞.基于直方图区域生长的遥感图像阈值分割算法[J].测绘通报,2021,0(2):25-29. |
| |
| 作者姓名： | 刘思言 李玲 特日根 李竺强 马经宇 朱瑞飞 |
| |
| 作者单位： | 1. 长光卫星技术有限公司, 吉林 长春 130000;2. 吉林省卫星遥感应用技术重点实验室, 吉林 长春 130000;3. 中国科学院长春光学精密机械与物理研究所, 吉林 长春 130000 |
| |
| 基金项目： | 吉林省重点科技研发项目;国家重点研发计划重点专项 |
| |
| 摘 要： | 传统阈值分割算法从单阈值扩展到多阈值的过程中，时间复杂度会大幅度增加，并且由于遥感图像信息复杂，会导致分割效果降低。为了解决这些问题，本文提出了基于直方图区域生长的遥感图像阈值分割算法。在本文算法中，每一个灰度级均作为1个初始阈值，用256个阈值将直方图分割成256个原始小区域。为了减少阈值数目，本文将小区域合并成大区域，每一次合并都可视为一次区域的生长。在每次生长过程中，选取熵值H最小的区域作为直方图各区域中的主区域，并通过本文提出的预匹配策略将其与相邻区域合并。每一次区域生长后，阈值数目均减少1个。在整个过程中，最多只需要生长255次。算法的时间复杂度稳定在O（L）级别。最后通过单阈值和多阈值试验证明本文算法在运行时间和分割精度上均具有优势。
|
| 关 键 词： | 图像分割 直方图 区域生长 合并 预匹配 |
| 收稿时间： | 2020-03-31 |
| 修稿时间： | 2020-06-15 |
Threshold segmentation algorithm based on histogram region growing for remote sensing images |
| |
| LIU Siyan,LI Ling,TE Rigen,LI Zhuqiang,MA Jingyu,ZHU Ruifei.Threshold segmentation algorithm based on histogram region growing for remote sensing images[J].Bulletin of Surveying and Mapping,2021,0(2):25-29. |
| |
| Authors: | LIU Siyan LI Ling TE Rigen LI Zhuqiang MA Jingyu ZHU Ruifei |
| |
| Institution: | 1. Chang Guang Satellite Technology Co., Ltd., Changchun 130000, China;2. Key Laboratory of Satellite Remote Sensing Application Technology of Jilin Province, Changchun 130000, China;3. Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130000, China |
| |
| Abstract: | In the process of traditional thresholding algorithm from single-threshold to multi-threshold,the time complexity will increase greatly,and because of the complexity of remote sensing image information,the segmentation effect will be reduced.This paper creatively proposes the idea based on histogram region growing for remote sensing images.Each gray level is regarded as a threshold,so that the histogram is divided into 256 original small regions by the 256 thresholds.For reducing the number of thresholds,small regions are merged into large regions.Each merging can be regarded as the growth of a region.In each growth,the region with the smallest entropy H is selected as the main one in all regions of the histogram,and then it is merged with the adjacent region by the way of prejudgment.After growing,the number of thresholds decreases.In the whole process,the growth times are only 255 at most,and the time complexity is stable at O(L).In this paper,single-threshold and multi-threshold experiments show that the algorithm has high accuracy in segmentation results,and has advantages in run time. |
| |
| Keywords: | image segmentation histogram region growing merge pre-judgment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《测绘通报》浏览原始摘要信息 |
| 点击此处可从《测绘通报》下载免费的PDF全文 |
|
