A new split and merge algorithm based on discrete map
Luc Brun, Jean‐Philippe Domenger · Digital Library (University of West Bohemia) · 1997
Usually, the segmentation algorithms implementing the split and merge operations are restricted to a split stage followed by a merge stage. In this paper, we present a new split and merge algorithm combining alternatively split and merge operations at each recursive step. This algorithm is based on a data structure called discrete map [BD96a]. This data structure provides an efficient framework to implement split and merge operations.