基于最大熵和局部优先度的裂痕唐卡分割

Segmentation of Rip Thangka Based on Maximum Entropy and Local Priority

为数字化修复唐卡文物,需先解决破损区域分割问题。针对裂痕型唐卡破损区域破损程度不等,与邻近区域颜色有反差的特点,提出基于最大熵和局部优先度的算法。首先采用最大熵阈值法分割破损唐卡灰度图像,去除伪破损区域,得到破损程度较深区域;然后采用本文提出的新算法—基于局部优先度的过渡区算法分割唐卡灰度图像,去除伪破损区域,得到破损区域的过渡区区域;合并这两类区域得到最终的分割结果。实验结果表明本文算法不仅能对破损唐卡实现有效分割,对壁画等其他破损图像也能很好分割。该算法具有一定的有效性和鲁棒性。

To repair Thangka relic by digital technology,the damaged regions,which Thangka are segmented,must be solved firstly.The algorithm based on maximum entropy and local priority is proposed to segment damaged regions of rip Thangka,considering the extent of damaged features and color in contrast to neighboring regions.Firstly,the gray image of Thangka is segmeted using maximum entropy algorithm.The false damaged regions are removed and the seriously damaged regions are obtained.Secondly,the gray image of Thangka is segmeted by local priority algorithm,the false damaged regions are removed and the transition of the damaged regions are achieved.Finally,the serious damaged regions is combined with the transition of the damaged regions and the ultimate segmentation result is gained.Experimental results demonstrate that the proposed algorithm can not only segment damaged Thangka effectively,but also segment damaged murals etc,which shows the effectiveness and robustness of the proposed algorithm.