科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper proposes a new unsupervised image segmentation method by using Bhattacharyya distance-based irregular pyramid, termed as 'BDIP' algorithm. The proposed BDIP algorithm obtains a suboptimal labelling solution under the condition that the number of segments is not manually given. It hierarchically builds each level of the irregular pyramid, with the result that the final segments emerge as they are represented by single nodes at certain levels. The BDIP algorithm employs Bhattacharyya distance to estimate the intra-level similarity at higher pyramidal levels so as to improve the accuracy and robustness to noise. Furthermore, an adaptive neighbour search method is proposed such that the BDIP algorithm can self-determine the number of segments. This method considers not only the graphic constraint, but also the similarity constraint in the sense that a candidate node is selected as a neighbour of the centre node if there is no boundary evidence between these two nodes. With the pyramidal accumulation, this evaluation is aggregated into the approximately global evidence, based on which the number of segments can be self-determined. Experimental results have shown that this proposed BDIP algorithm outperforms other benchmark segmentation algorithms in terms of segmentation accuracy, labelling cost and robustness to noise.
