Efficient morphological shape representation by varying overlapping levels among representative disks

摘要

The morphological skeleton transform, the morphological shape decomposition, and the overlapped morphological shape decomposition are three basic morphological shape representation schemes. In this paper. we propose a now way of generalizing these basic representation algorithms to improve representational efficiency. In all three basic algorithms, a fixed overlapping policy is used to control the overlapping relationships among 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. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved. [References: 39]