| Summary: | The problem of finding local extrema on halftone images is considered. Well-known block-search algorithms provide high speed, but they extract only strict (single-pixel) extremes, skipping extreme areas formed by non-strict extremes. Morphological search algorithms provide the selection of non-strict extremes, but have a high computational complexity. A mathematical model and an algorithm based on the brightness analysis of adjacent homogeneous regions are proposed to isolate strict and non-strict local extremes of images with low computational complexity. Their differences from well-known models are: consideration of homogeneous areas, which are formed by non-strict extremes and are local maxima or minima in relation to adjacent areas; elimination of iterative processing of non-extreme pixels; assigning the numbers to local extremes during their search. These differences allowed to increase the accuracy of local extremum extraction in comparison with block search and to reduce the computational complexity in comparison with morphological search.
|
|---|