Adaptive Morphological Reconstruction for Seeded Image Segmentation

Abstract

Morphological reconstruction (MR) is often employed by seeded image segmentation algorithms such as watershed transform and power watershed as it is able to filter seeds (regional minima) to reduce over-segmentation. However, MR might mistakenly filter meaningful seeds that are required for generating accurate segmentation and it is also sensitive to the scale because a single-scale structuring element is employed. In this paper, a novel adaptive morphological reconstruction (AMR) operation is proposed that has three advantages. Firstly, AMR can adaptively filter useless seeds while preserving meaningful ones. Secondly, AMR is insensitive to the scale of structuring elements because multiscale structuring elements are employed. Finally, AMR has two attractive properties: monotonic increasingness and convergence that help seeded segmentation algorithms to achieve a hierarchical segmentation. Experiments clearly demonstrate that AMR is useful for improving algorithms of seeded image segmentation and seed-based spectral segmentation. Compared to several state-of-the-art algorithms, the proposed algorithms provide better segmentation results requiring less computing time. Source code is available at https://github.com/SUST-reynole/AMR.

SEEK: A Framework of Superpixel Learning with CNN Features for Unsupervised Segmentation

“…However, the proposed approach is slow because of CPU implementation. Lei et al [33] proposed adaptive morphological reconstruction, which filters out useless regional minima and is better in convergence, but it falls behind in the state-of-the-art FCN based techniques. Bosch et al [34] exploited the segmentation parameter space where highly over-and under-segmented hypotheses are generated.…”

Automatic Image Thresholding Based on Shannon Entropy Difference and Dynamic Synergic Entropy

“…Step 1: Calculate the guiding edge images K u * x and K u * y according to Eqs. (5), (6), (7), and (8).…”

“…The goal is a partition of the image into coherent regions, which is an important initial step in the analysis of image content. Numerous image segmentation algorithms have been developed in the last several decades, from the earliest methods, such as image thresholding [1], region growing and merging [2]- [3], clustering [4]- [5], watershed segmentation [6]- [7], to more complex algorithms, such as active contours [8], graph cuts [9]- [10], and deep learning-based methods [11]- [12].…”

Segmentasi Warna Citra Bunga Daisy dengan Algoritma K-Means pada Ruang Warna Lab

“…Segmentasi citra itu sendiri dapat dihasilkan dengan menggunakan kaidah statistik seperti korelasi [9] dan distribusi [10]. Selain itu, segmentasi dapat dilakukan dengan memanfaatkan struktur morpologi citra [11], pengelompokan hirarkie [12] ataupun menggunakan deep learning [13]. Sementara itu, segmentasi citra memiliki beberapa kendala, dimulai dari kesulitan dalam mendapatkan data ground truth dan menghasilkan segmentasi yang akurat seperti ganguan derau [14].…”