scispace - formally typeset
Search or ask a question

Showing papers on "Range segmentation published in 1979"


Proceedings ArticleDOI
01 Dec 1979
TL;DR: In this paper, a split-and-merge algorithm for picture segmentation is described, where the regions of an arbitrary initial segmentation are tested for uniformity and if not uniform they are subdivided into smaller regions or set aside if their size is below a given threshold.
Abstract: Picture segmentation is expressed as a sequence of decision problems within the framework of a split-and-merge algorithm. First regions of an arbitrary initial segmentation are tested for uniformity and if not uniform they are subdivided into smaller regions, or set aside if their size is below a given threshold. Next regions classified as uniform are subject to a cluster analysis to identify similar types which are merged. At this point there exist reliable estimates of the parameters of the random field of each type of region and they are used to classify some of the remaining small regions. Any regions remaining after this step are considered part of a boundary ambiguity zone. The location of the boundary is estimated then by interpolation between the existing uniform regions. Experimental results on artificial picutres are also included.

56 citations