2015
DOI: 10.15622/sp.40.12
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of Piecewise Constant Approximation for Segmented Image

Abstract: УДК 004.932 М.В. ХАРИНОВ, И.Г. ХАНЫКОВ ОПТИМИЗАЦИЯ КУСОЧНО-ПОСТОЯННОГО ПРИБЛИЖЕНИЯ СЕГМЕНТИРОВАННОГО ИЗОБРАЖЕНИЯХаринов М.В., Ханыков И.Г. Оптимизация кусочно-постоянного приближения сегментированного изображения. Аннотация. В статье анализируется проблема сегментации цветового изображения, аппроксимируемого кусочно-постоянными приближениями. Качество сегментации оце-нивается по классическому среднеквадратичному отклонению (СКО) пикселей прибли-жения от пикселей изображения. Обсуждаются современные версии клас… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…The second stage "b" forms N sp superpixels, in fact, performing an improvement in the quality of a given partition with a fixed number of colors (clusters). For this task, two basic algorithms have been developed: SI-method (Segmentation Improvement) [2] and K-meanless method (K-means-without-means method) [3]. Many software implementations are due to both the possibility of a combination of a pair of basic SI and K-meanless methods (separately, sequentially, cyclically), and versions of the methods themselves (segmental, cluster).…”
Section: The Modification Of the Classical Ward's Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The second stage "b" forms N sp superpixels, in fact, performing an improvement in the quality of a given partition with a fixed number of colors (clusters). For this task, two basic algorithms have been developed: SI-method (Segmentation Improvement) [2] and K-meanless method (K-means-without-means method) [3]. Many software implementations are due to both the possibility of a combination of a pair of basic SI and K-meanless methods (separately, sequentially, cyclically), and versions of the methods themselves (segmental, cluster).…”
Section: The Modification Of the Classical Ward's Methodsmentioning
confidence: 99%
“…The combination of "merge&divide" operations ( 1), ( 3) improves image quality in the SI-method by dividing one of the segments (numbered 1) and merging the other two mismatched (numbered 2 and 3). SI-method is executed by the criterion [2]:…”
Section: The Software-algorithmic Toolkitmentioning
confidence: 99%
See 1 more Smart Citation
“…Currently, there exist various methods and approaches to the solution of image-based segmentation problem [1][2][3]. The most promising solutions in this domain are the approaches to the segmentation problem, which involve neural networks [4][5][6][7][8][9].…”
Section: Related Workmentioning
confidence: 99%
“…In the works of Khanykov et al , 2017; Kharinov and Khanykov, 2015a, b; Khanykov, 2017, a digital image segmentation algorithm is proposed, the flowchart of which is presented in Figure 4. The segmentation algorithm generates the hierarchical sequence of the source image segmentations, divided into clusters from 1 to N .…”
Section: Quasi-optimal Segmentation Algorithmmentioning
confidence: 99%