Efficient morphological shape representation without searching

This paper proposes a new morphological shape representation algorithm that does not require searching. A theoretical analysis as well as experimental results are presented to compare the algorithm with two leading morphological shape representation schemes: the morphological skeleton transform (MST) and the morphological shape decomposition (MSD). Our algorithm combines the advantages of the MST and MSD. In our scheme, a binary shape is decomposed into a union of disks of different sizes. The number of disks used is close to that by the MST and the reconstruction cost is close to that by the MSD.