Hierarchical Segmentation Satisfying Constraints
Lewis D. Griffin, Alan C. F. Colchester, S. A. Röll, Colin Studholme · 1994
A new hierarchical segmentation algorithm is described. Its computational complexity and memory requirements are detailed, showing it to be practicably applicable to images of useful size. A simple modification of the algorithm adapts it to produce hierarchical segmentations that satisfy a constraint set. Results are given showing that this adapted algorithm can be used as the basis of a semi-automatic object definition tool or as the interface between a low-level image description module and a high-level module coding for knowledge and expectation.