A Comparison of Algorithms for Connected Set Openings and Closings
A Comparison of Algorithms for Connected Set Openings and Closings
复制标题
DOI：
10.1109/34.993556
复制
发表时间：
2002-04
期刊：
影响因子：
--
通讯作者：
Arnold Meijster;M. Wilkinson
中科院分区：
文献类型：
--
作者：
Arnold Meijster;M. Wilkinson
讨论了用于图像滤波和模式识别的形态连通集运算符的实现。两个较早的算法的基础上的优先级队列和分层队列，分别进行了比较，最近的工会找到的方法。与早期的算法，处理区域极值在图像中顺序，联合查找方法允许同时处理极值。在区域开口、闭合和模式谱的背景下，联合查找算法在几乎所有测试的自然和合成图像上都优于以前的方法。最后，扩展到模式谱和更一般的类的属性运算符的所有三个算法，和内存使用进行了比较。
The implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent union-find approach. Unlike the earlier algorithms which process regional extrema in the image sequentially, the union-find method allows simultaneous processing of extrema. In the context of area openings, closings, and pattern spectra, the union-find algorithm outperforms the previous methods on almost all natural and synthetic images tested. Finally, extensions to pattern spectra and the more general class of attribute operators are presented for all three algorithms, and memory usages are compared.