Issue No. 02 - February (1989 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.16711
<p>A segmentation algorithm based on sequential optimization which produces a hierarchical decomposition of the picture is presented. The decomposition is data driven with no restriction on segment shapes. It can be viewed as a tree, where the nodes correspond to picture segments and where links between nodes indicate set inclusions. Picture segmentation is first regarded as a problem of piecewise picture approximation, which consists of finding the partition with the minimum approximation error. Then, picture segmentation is presented as an hypothesis-testing process which merges only segments that belong to the same region. A hierarchical decomposition constraint is used in both cases, which results in the same stepwise optimization algorithm. At each iteration, the two most similar segments are merged by optimizing a stepwise criterion. The algorithm is used to segment a remote-sensing picture, and illustrate the hierarchical structure of the picture.</p>
data structure; computerised picture processing; iterative methods; picture segmentation; stepwise optimization; sequential optimization; hierarchical decomposition; tree; computerised picture processing; iterative methods; optimisation; trees (mathematics)
"Hierarchy in Picture Segmentation: A Stepwise Optimization Approach," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 150-163, 1989.