{'fraction_non_alphanumeric': 0.01734820322180917, 'fraction_numerical': 0.0, 'mean_word_length': 5.516129032258065, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Improved Watershed Algorithm for Color Image Segmentation

An adaptive marker extraction-based watershed algorithm is proposed to overcome the over-segmentation problem. By combining local minima depth and water basin scale information, markers are adaptively extracted for local minima, and the threshold for marker-extraction is automatically calculated according to the statistics of local extreme points in the gradient map. These markers are imposed on the original gradient map as its local minima. The watershed algorithm is applied on the modified gradient map to segment the image. Simulation results show that the proposed method can efficiently reduce over-segmentation with scarcely computational complexity increase. It has better anti-noise performance and edge-location capability as well.