Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas
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-stric...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
National Academy of Sciences of Belarus, the United Institute of Informatics Problems
2019-09-01
|
| Series: | Informatika |
| Subjects: | |
| Online Access: | https://inf.grid.by/jour/article/view/879 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832543132389998592 |
|---|---|
| author | V. Yu. Tsviatkou Anh Tuan Nguyen |
| author_facet | V. Yu. Tsviatkou Anh Tuan Nguyen |
| author_sort | V. Yu. Tsviatkou |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-0e75b88c0aa84d21904e12a4ca2b95c6 |
| institution | Kabale University |
| issn | 1816-0301 |
| language | Russian |
| publishDate | 2019-09-01 |
| publisher | National Academy of Sciences of Belarus, the United Institute of Informatics Problems |
| record_format | Article |
| series | Informatika |
| spelling | doaj-art-0e75b88c0aa84d21904e12a4ca2b95c62025-02-03T11:51:49ZrusNational Academy of Sciences of Belarus, the United Institute of Informatics ProblemsInformatika1816-03012019-09-011632336849Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areasV. Yu. Tsviatkou0Anh Tuan Nguyen1Belarusian State University of Informatics and RadioelectronicsBelarusian State University of Informatics and RadioelectronicsThe 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.https://inf.grid.by/jour/article/view/879segmentsearchlocal extremesstrict extremesnon-strict extremeslocal maximalocal minima |
| spellingShingle | V. Yu. Tsviatkou Anh Tuan Nguyen Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas Informatika segmentsearch local extremes strict extremes non-strict extremes local maxima local minima |
| title | Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas |
| title_full | Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas |
| title_fullStr | Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas |
| title_full_unstemmed | Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas |
| title_short | Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas |
| title_sort | segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas |
| topic | segmentsearch local extremes strict extremes non-strict extremes local maxima local minima |
| url | https://inf.grid.by/jour/article/view/879 |
| work_keys_str_mv | AT vyutsviatkou segmentsearchforlocalextremumsofimagesbasedontheanalysisofbrightnessofadjacenthomogeneousareas AT anhtuannguyen segmentsearchforlocalextremumsofimagesbasedontheanalysisofbrightnessofadjacenthomogeneousareas |