{"title":"基于形态学和图的全自动肝脏分割技术的集成","authors":"W. Yussof, H. Burkhardt","doi":"10.1234/MJEE.V4I3.322","DOIUrl":null,"url":null,"abstract":"Here a fully 3D algorithm for automatic liver segmentation from CT volumetric datasets is presented. The algorithm starts by smoothing the original volume using anisotropic diffusion. The coarse liver region is obtained from the threshold process that is based on a priori knowledge. Then, several morphological operations is performed such as operating the liver to detach the unwanted region connected to the liver and finding the largest component using the connected component labeling (CCL) algorithm. At this stage, both 3D and 2D CCL is done subsequently. However, in 2D CCL, the adjacent slices are also affected from current slice changes. Finally, the boundary of the liver is refined using graph-cuts solver. Our algorithm does not require any user interaction or training datasets to be used. The algorithm has been evaluated on 10 CT scans of the liver and the results are encouraging to poor quality of images.","PeriodicalId":37804,"journal":{"name":"Majlesi Journal of Electrical Engineering","volume":"4 1","pages":"59-66"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Integration of Morphology and Graph-based Techniques for Fully Automatic Liver Segmentation\",\"authors\":\"W. Yussof, H. Burkhardt\",\"doi\":\"10.1234/MJEE.V4I3.322\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Here a fully 3D algorithm for automatic liver segmentation from CT volumetric datasets is presented. The algorithm starts by smoothing the original volume using anisotropic diffusion. The coarse liver region is obtained from the threshold process that is based on a priori knowledge. Then, several morphological operations is performed such as operating the liver to detach the unwanted region connected to the liver and finding the largest component using the connected component labeling (CCL) algorithm. At this stage, both 3D and 2D CCL is done subsequently. However, in 2D CCL, the adjacent slices are also affected from current slice changes. Finally, the boundary of the liver is refined using graph-cuts solver. Our algorithm does not require any user interaction or training datasets to be used. The algorithm has been evaluated on 10 CT scans of the liver and the results are encouraging to poor quality of images.\",\"PeriodicalId\":37804,\"journal\":{\"name\":\"Majlesi Journal of Electrical Engineering\",\"volume\":\"4 1\",\"pages\":\"59-66\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Majlesi Journal of Electrical Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1234/MJEE.V4I3.322\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Majlesi Journal of Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1234/MJEE.V4I3.322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
Integration of Morphology and Graph-based Techniques for Fully Automatic Liver Segmentation
Here a fully 3D algorithm for automatic liver segmentation from CT volumetric datasets is presented. The algorithm starts by smoothing the original volume using anisotropic diffusion. The coarse liver region is obtained from the threshold process that is based on a priori knowledge. Then, several morphological operations is performed such as operating the liver to detach the unwanted region connected to the liver and finding the largest component using the connected component labeling (CCL) algorithm. At this stage, both 3D and 2D CCL is done subsequently. However, in 2D CCL, the adjacent slices are also affected from current slice changes. Finally, the boundary of the liver is refined using graph-cuts solver. Our algorithm does not require any user interaction or training datasets to be used. The algorithm has been evaluated on 10 CT scans of the liver and the results are encouraging to poor quality of images.
期刊介绍:
The scope of Majlesi Journal of Electrcial Engineering (MJEE) is ranging from mathematical foundation to practical engineering design in all areas of electrical engineering. The editorial board is international and original unpublished papers are welcome from throughout the world. The journal is devoted primarily to research papers, but very high quality survey and tutorial papers are also published. There is no publication charge for the authors.