Abstract
Graph cuts is an image segmentation method by which the region and boundary information of objects can be revolved comprehensively. Because of the complex spatial characteristics of high-dimensional images, time complexity and segmentation accuracy of graph cuts methods for high-dimensional images need to be improved. This paper proposes a new three-dimensional multilevel banded graph cuts model to increase its accuracy and reduce its complexity. Firstly, three-dimensional image is viewed as a high-dimensional space to construct three-dimensional network graphs. A pyramid image sequence is created by Gaussian pyramid downsampling procedure. Then, a new energy function is built according to the spatial characteristics of the three-dimensional image, in which the adjacent points are expressed by using a 26-connected system. At last, the banded graph is constructed on a narrow band around the object/background. The graph cuts method is performed on the banded graph layer by layer to obtain the object region sequentially. In order to verify the proposed method, we have performed an experiment on a set of three-dimensional colon CT images, and compared the results with local region active contour and Chan–Vese model. The experimental results demonstrate that the proposed method can segment colon tissues from three-dimensional abdominal CT images accurately. The segmentation accuracy can be increased to 95.1% and the time complexity is reduced by about 30% of the other two methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Pattern Recognition and Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.