| Literature DB >> 29352385 |
Thanongchai Siriapisith1,2, Worapan Kusakunniran3, Peter Haddawy2.
Abstract
Aortic aneurysm segmentation remains a challenge. Manual segmentation is a time-consuming process which is not practical for routine use. To address this limitation, several automated segmentation techniques for aortic aneurysm have been developed, such as edge detection-based methods, partial differential equation methods, and graph partitioning methods. However, automatic segmentation of aortic aneurysm is difficult due to high pixel similarity to adjacent tissue and a lack of color information in the medical image, preventing previous work from being applicable to difficult cases. This paper uses uses a variable neighborhood search that alternates between intensity-based and gradient-based segmentation techniques. By alternating between intensity and gradient spaces, the search can escape from local optima of each space. The experimental results demonstrate that the proposed method outperforms the other existing segmentation methods in the literature, based on measurements of dice similarity coefficient and jaccard similarity coefficient at the pixel level. In addition, it is shown to perform well for cases that are difficult to segment.Entities:
Keywords: Abdominal aortic aneurysm; Computed tomography; Graph cut; Iterative; Multi-layer segmentation; Probabilistic model; Variable neighborhood search
Mesh:
Year: 2018 PMID: 29352385 PMCID: PMC6113142 DOI: 10.1007/s10278-018-0049-z
Source DB: PubMed Journal: J Digit Imaging ISSN: 0897-1889 Impact factor: 4.056