A modified graph cuts image segmentation algorithm with adaptive shape constraints and its application to computed tomography images
| Autor: | Qinlan Xie, Xuesong Lu, Xianpan Pan, Hong Chen |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Pixel
business.industry Computer science 0206 medical engineering ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Process (computing) Health Informatics Pattern recognition 02 engineering and technology Function (mathematics) 020601 biomedical engineering Image (mathematics) Term (time) 03 medical and health sciences 0302 clinical medicine Computer Science::Computer Vision and Pattern Recognition Cut Signal Processing Segmentation Artificial intelligence business 030217 neurology & neurosurgery Energy (signal processing) |
| Zdroj: | Biomedical Signal Processing and Control. 62:102092 |
| ISSN: | 1746-8094 |
| DOI: | 10.1016/j.bspc.2020.102092 |
| Popis: | The low contrast, blurred edges, and irregular contours of organs, such as the liver, kidney, and spleen, in abdominal computed tomography (CT) images hamper the machine-aided extraction of specific image regions pertaining to individual target organs. This problem is addressed herein by proposing an improved graph cuts segmentation algorithm with adaptive shape constraints. First, the original image is segmented based on multi-atlas registration. Then, the segmentation result is employed as a shape prior to constrain the shape of the final graph cuts segmentation result by adding a shape constraint energy term to the graph cuts energy function. The levels of shape constraint applied to the graph cuts energy function are adjusted according to differences in the probability of adjacent pixels residing within the target region, which are obtained in the initial segmentation process. Finally, the images of individual target organs in abdominal CT images are extracted by minimizing the energy function using the maximum-flow minimum-cut algorithm. Experimental results demonstrate that the proposed method can segment target organs well and can effectively reduce the occurrences of over-segmentation and under-segmentation caused by the conventional graph cuts algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect