In this paper, we propose a new way of generalizing three basic morphological shape representation algorithms to improve representational efficiency. In all three basic algorithms, a fixed overlapping policy is used to control the overlapping relationships between representative disks of different sizes. In our new algorithm, different overlapping policies are used to generate shape components that have different overlapping relationships among themselves. The overlapping policy is selected dynamically according to local shape features. Experiments show that compared to the three basic algorithms, our algorithm produces more efficient representations with lower numbers of representative points.
['Jianning Xu']
Efficient morphological shape representation by varying overlapping levels between representative disks