Bea1985

[Bea1985]
Selection of Segment Similarity Measures for Hierarchical Picture Segmentation

Authors:Beaulieu Jean-Marie, Morris Goldberg

In Book:Computer-Generated Images

 1985, pp. 87-97

Publisher:Springer

ISBN:978-4-431-68033-8

URL:https://link.springer.com/chapter/10.1007/978-4-431-68033-8_8

DOI:10.1007/978-4-431-68033-8_8

Abstract:   The problem of defining appropriate segment similarity measures for picture segmentation is exmained. In agglomerative hierqarchical segmentation, two segments are coamapared and merged if found similar. The propesed Hierarchical Step-Wise Optimization (HSWO) algorithm finds and then merges the two most similar segements, on a step-by-step basis. By considering picture segmentation as a piece-wise picture approximation problem, the similarity measure (or the step-wise criterion) is related to the overall approximation error. The measure then corresponds to the increase of the approximation error resulting from merging two segments. Similarity measures derived from constant approximations (zeroth order polynomials) and planar approximations (first order polynomials). An adaptive measurebased upon local variance is also used. The advantages of combining similarity measures (or cirteria) are also stressed. Different picture areas can require different measures which must therefore be combined in order to obtain good overall results. Moreover, in hierarchical segmentation, simple measures can be used for the first merging steps, while, at a higher level of the segment hierarchy, more complex measures can be employed.

« Selection of Segment Similarity Measures for Hierarchical Picture Segmentation, »
Beaulieu Jean-Marie, Morris Goldberg,
in Computer-Generated Images, Springer, 1985, pp. 87-97.
[Bibtex]

@incollection{Bea1985,
author = {Beaulieu, Jean-Marie and Goldberg, Morris},
title = {Selection of Segment Similarity Measures for Hierarchical Picture Segmentation},
booktitle = {Computer-Generated Images},
editor = {},
publisher = {Springer},
address = {},
pages = {87-97},
year = {1985},
month = {},
url = {https://link.springer.com/chapter/10.1007/978-4-431-68033-8_8},
isbn = {978-4-431-68033-8},
doi = {10.1007/978-4-431-68033-8_8},
abstract = {The problem of defining appropriate segment similarity measures for picture segmentation is exmained. In agglomerative hierqarchical segmentation, two segments are coamapared and merged if found similar. The propesed Hierarchical Step-Wise Optimization (HSWO) algorithm finds and then merges the two most similar segements, on a step-by-step basis. By considering picture segmentation as a piece-wise picture approximation problem, the similarity measure (or the step-wise criterion) is related to the overall approximation error. The measure then corresponds to the increase of the approximation error resulting from merging two segments. Similarity measures derived from constant approximations (zeroth order polynomials) and planar approximations (first order polynomials). An adaptive measurebased upon local variance is also used. The advantages of combining similarity measures (or cirteria) are also stressed. Different picture areas can require different measures which must therefore be combined in order to obtain good overall results. Moreover, in hierarchical segmentation, simple measures can be used for the first merging steps, while, at a higher level of the segment hierarchy, more complex measures can be employed.},
mypdf = {5},
keywords = {Hierarchical segmentation; Similarity measures; Clustering}
}

DOWNLOAD   this page printed version

See also [Bea1985b].
 

website © Jean-Marie Beaulieu