Boundary Refined Texture Segmentation Based on K-Views and Datagram Methods

Abstract

We propose a new texture segmentation algorithm to improve the segmentation of boundary areas in the image. In some applications such as medical image segmentation, an exact segmentation on the boundary areas is needed. But satisfactory segmentation results cannot be obtained on the boundary areas among different texture classes with some existing texture segmentation algorithms in our preliminary experiments. The proposed algorithm consists of three steps. The first step is to apply the K-view-datagram segmentation method to the image to obtain an initial segmentation; the second step is to find a boundary set which includes the pixels with high probabilities to be misclassified by the initial K-view-datagram segmentation; the third step is to apply a modified K-views template method with a small scanning window to the boundary set to refine the segmentation. The evaluation of the proposed algorithm was carried out with the benchmark images randomly taken from Brodatz Gallery and the ultrasonic prostate images provided by the hospitals. Initial experimental results show that the concept of boundary set defined in this paper can catch most of misclassified pixels of the output of the initial K-View-datagram segmentation. The new segmentation algorithm gives high segmentation accuracy and classifies the boundary areas better than the existing algorithms