一种基于标记的分水岭算法

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512) Pub Date : 2004-05-23 DOI:10.1109/ISCAS.2004.1329213

H. Gao, P. Xue, Weisi Lin

{"title":"一种基于标记的分水岭算法","authors":"H. Gao, P. Xue, Weisi Lin","doi":"10.1109/ISCAS.2004.1329213","DOIUrl":null,"url":null,"abstract":"The marker-based watershed approach is a very efficient means for image segmentation and has been widely used in recent years. The conventional marker-based algorithms are realized using hierarchical queues. A new marker-based watershed algorithm based on the disjoint set data structure is proposed in this paper. It consists of two steps: the flooding step and the resolving step. This algorithm has significantly lower memory requirement as compared with the conventional algorithms while maintaining the computational complexity of O(N) where N is the image size. Experimental results further show that the new algorithm implemented in C language runs much faster than the conventional algorithm based on the hierarchical queues as a result of savings from huge memory allocation and releasing operations.","PeriodicalId":6445,"journal":{"name":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","volume":"18 1","pages":"II-81"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"A new marker-based watershed algorithm\",\"authors\":\"H. Gao, P. Xue, Weisi Lin\",\"doi\":\"10.1109/ISCAS.2004.1329213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The marker-based watershed approach is a very efficient means for image segmentation and has been widely used in recent years. The conventional marker-based algorithms are realized using hierarchical queues. A new marker-based watershed algorithm based on the disjoint set data structure is proposed in this paper. It consists of two steps: the flooding step and the resolving step. This algorithm has significantly lower memory requirement as compared with the conventional algorithms while maintaining the computational complexity of O(N) where N is the image size. Experimental results further show that the new algorithm implemented in C language runs much faster than the conventional algorithm based on the hierarchical queues as a result of savings from huge memory allocation and releasing operations.\",\"PeriodicalId\":6445,\"journal\":{\"name\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"volume\":\"18 1\",\"pages\":\"II-81\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCAS.2004.1329213\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.2004.1329213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 38

摘要

基于标记的分水岭分割方法是一种非常有效的图像分割方法，近年来得到了广泛的应用。传统的基于标记的算法是使用分层队列实现的。提出了一种基于不相交集数据结构的基于标记的分水岭算法。它包括两个步骤:泛洪步骤和分解步骤。与传统算法相比，该算法对内存的需求明显降低，同时保持了O(N)的计算复杂度，其中N为图像大小。实验结果进一步表明，用C语言实现的新算法比基于分层队列的传统算法运行速度快得多，因为它节省了大量的内存分配和释放操作。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new marker-based watershed algorithm

The marker-based watershed approach is a very efficient means for image segmentation and has been widely used in recent years. The conventional marker-based algorithms are realized using hierarchical queues. A new marker-based watershed algorithm based on the disjoint set data structure is proposed in this paper. It consists of two steps: the flooding step and the resolving step. This algorithm has significantly lower memory requirement as compared with the conventional algorithms while maintaining the computational complexity of O(N) where N is the image size. Experimental results further show that the new algorithm implemented in C language runs much faster than the conventional algorithm based on the hierarchical queues as a result of savings from huge memory allocation and releasing operations.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)

自引率

0.00%

发文量