• Title/Summary/Keyword: Multi-atlas segmentation

Search Result 7, Processing Time 0.015 seconds

Automatic Segmentation of Renal Parenchyma using Graph-cuts with Shape Constraint based on Multi-probabilistic Atlas in Abdominal CT Images (복부 컴퓨터 단층촬영영상에서 다중 확률 아틀라스 기반 형상제한 그래프-컷을 사용한 신실질 자동 분할)

  • Lee, Jaeseon;Hong, Helen;Rha, Koon Ho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.22 no.4
    • /
    • pp.11-19
    • /
    • 2016
  • In this paper, we propose an automatic segmentation method of renal parenchyma on abdominal CT image using graph-cuts with shape constraint based on multi-probabilistic atlas. The proposed method consists of following three steps. First, to use the various shape information of renal parenchyma, multi-probabilistic atlas is generated by cortex-based similarity registration. Second, initial seeds for graph-cuts are extracted by maximum a posteriori (MAP) estimation and renal parenchyma is segmented by graph-cuts with shape constraint. Third, to reduce alignment error of probabilistic atlas and increase segmentation accuracy, registration and segmentation are iteratively performed. To evaluate the performance of proposed method, qualitative and quantitative evaluation are performed. Experimental results show that the proposed method avoids a leakage into neighbor regions with similar intensity of renal parenchyma and shows improved segmentation accuracy.

Anterior Cruciate Ligament Segmentation in Knee MRI with Locally-aligned Probabilistic Atlas and Iterative Graph Cuts (무릎 자기공명영상에서 지역적 확률 아틀라스 정렬 및 반복적 그래프 컷을 이용한 전방십자인대 분할)

  • Lee, Han Sang;Hong, Helen
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1222-1230
    • /
    • 2015
  • Segmentation of the anterior cruciate ligament (ACL) in knee MRI remains a challenging task due to its inhomogeneous signal intensity and low contrast with surrounding soft tissues. In this paper, we propose a multi-atlas-based segmentation of the ACL in knee MRI with locally-aligned probabilistic atlas (PA) in an iterative graph cuts framework. First, a novel PA generation method is proposed with global and local multi-atlas alignment by means of rigid registration. Second, with the generated PA, segmentation of the ACL is performed by maximum-aposteriori (MAP) estimation and then by graph cuts. Third, refinement of ACL segmentation is performed by improving shape prior through mask-based PA generation and iterative graph cuts. Experiments were performed with a Dice similarity coefficients of 75.0%, an average surface distance of 1.7 pixels, and a root mean squared distance of 2.7 pixels, which increased accuracy by 12.8%, 22.7%, and 22.9%, respectively, from the graph cuts with patient-specific shape constraints.

Automatic Segmentation of Femoral Cartilage in Knee MR Images using Multi-atlas-based Locally-weighted Voting (무릎 MR 영상에서 다중 아틀라스 기반 지역적 가중투표를 이용한 대퇴부 연골 자동 분할)

  • Kim, Hyeun A;Kim, Hyeonjin;Lee, Han Sang;Hong, Helen
    • Journal of KIISE
    • /
    • v.43 no.8
    • /
    • pp.869-877
    • /
    • 2016
  • In this paper, we propose an automated segmentation method of femoral cartilage in knee MR images using multi-atlas-based locally-weighted voting. The proposed method involves two steps. First, to utilize the shape information to show that the femoral cartilage is attached to a femur, the femur is segmented via volume and object-based locally-weighted voting and narrow-band region growing. Second, the object-based affine transformation of the femur is applied to the registration of femoral cartilage, and the femoral cartilage is segmented via multi-atlas shape-based locally-weighted voting. To evaluate the performance of the proposed method, we compared the segmentation results of majority voting method, intensity-based locally-weighted voting method, and the proposed method with manual segmentation results defined by expert. In our experimental results, the newly proposed method avoids a leakage into the neighboring regions having similar intensity of femoral cartilage, and shows improved segmentation accuracy.

Optimization of Multi-Atlas Segmentation with Joint Label Fusion Algorithm for Automatic Segmentation in Prostate MR Imaging

  • Choi, Yoon Ho;Kim, Jae-Hun;Kim, Chan Kyo
    • Investigative Magnetic Resonance Imaging
    • /
    • v.24 no.3
    • /
    • pp.123-131
    • /
    • 2020
  • Purpose: Joint label fusion (JLF) is a popular multi-atlas-based segmentation algorithm, which compensates for dependent errors that may exist between atlases. However, in order to get good segmentation results, it is very important to set the several free parameters of the algorithm to optimal values. In this study, we first investigate the feasibility of a JLF algorithm for prostate segmentation in MR images, and then suggest the optimal set of parameters for the automatic prostate segmentation by validating the results of each parameter combination. Materials and Methods: We acquired T2-weighted prostate MR images from 20 normal heathy volunteers and did a series of cross validations for every set of parameters of JLF. In each case, the atlases were rigidly registered for the target image. Then, we calculated their voting weights for label fusion from each combination of JLF's parameters (rpxy, rpz, rsxy, rsz, β). We evaluated the segmentation performances by five validation metrics of the Prostate MR Image Segmentation challenge. Results: As the number of voxels participating in the voting weight calculation and the number of referenced atlases is increased, the overall segmentation performance is gradually improved. The JLF algorithm showed the best results for dice similarity coefficient, 0.8495 ± 0.0392; relative volume difference, 15.2353 ± 17.2350; absolute relative volume difference, 18.8710 ± 13.1546; 95% Hausdorff distance, 7.2366 ± 1.8502; and average boundary distance, 2.2107 ± 0.4972; in parameters of rpxy = 10, rpz = 1, rsxy = 3, rsz = 1, and β = 3. Conclusion: The evaluated results showed the feasibility of the JLF algorithm for automatic segmentation of prostate MRI. This empirical analysis of segmentation results by label fusion allows for the appropriate setting of parameters.

Hierarchical Organ Segmentation using Location Information based on Multi-atlas in Abdominal CT Images (복부 컴퓨터단층촬영 영상에서 다중 아틀라스 기반 위치적 정보를 사용한 계층적 장기 분할)

  • Kim, Hyeonjin;Kim, Hyeun A;Lee, Han Sang;Hong, Helen
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.12
    • /
    • pp.1960-1969
    • /
    • 2016
  • In this paper, we propose an automatic hierarchical organ segmentation method on abdominal CT images. First, similar atlases are selected using bone-based similarity registration and similarity of liver, kidney, and pancreas area. Second, each abdominal organ is roughly segmented using image-based similarity registration and intensity-based locally weighted voting. Finally, the segmented abdominal organ is refined using mask-based affine registration and intensity-based locally weighted voting. Especially, gallbladder and pancreas are hierarchically refined using location information of neighbor organs such as liver, left kidney and spleen. Our method was tested on a dataset of 12 portal-venous phase CT data. The average DSC of total organs was $90.47{\pm}1.70%$. Our method can be used for patient-specific abdominal organ segmentation for rehearsal of laparoscopic surgery.

Automatic Meniscus Segmentation from Knee MR Images using Multi-atlas-based Locally-weighted Voting and Patch-based Edge Feature Classification (무릎 MR 영상에서 다중 아틀라스 기반 지역적 가중 투표 및 패치 기반 윤곽선 특징 분류를 통한 반월상 연골 자동 분할)

  • Kim, SoonBeen;Kim, Hyeonjin;Hong, Helen;Wang, Joon Ho
    • Journal of the Korea Computer Graphics Society
    • /
    • v.24 no.4
    • /
    • pp.29-38
    • /
    • 2018
  • In this paper, we propose an automatic segmentation method of meniscus in knee MR images by automatic meniscus localization, multi-atlas-based locally-weighted voting, and patch-based edge feature classification. First, after segmenting the bone and knee articular cartilage, the volume of interest of the meniscus is automatically localized. Second, the meniscus is segmented by multi-atlas-based locally-weighted voting taking into account the weights of shape and intensity distribution in the volume of interest of the meniscus. Finally, to remove leakage to the collateral ligaments with similar intensity, meniscus is refined using patch-based edge feature classification considering shape and distance weights. Dice similarity coefficient between proposed method and manual segmentation were 80.13% of medial meniscus and 80.81 % for lateral meniscus, and showed better results of 7.25% for medial meniscus and 1.31% for lateral meniscus compared to the multi-atlas-based locally-weighted voting.

Performance evaluation of vessel extraction algorithm applied to Aortic root segmentation in CT Angiography (CT Angiography 영상에서 대동맥 추출을 위한 혈관 분할 알고리즘 성능 평가)

  • Kim, Tae-Hyong;Hwang, Young-sang;Shin, Ki-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.2
    • /
    • pp.196-204
    • /
    • 2016
  • World Health Organization reported that heart-related diseases such as coronary artery stenoses show the highest occurrence rate which may cause heart attack. Using Computed Tomography angiography images will allow radiologists to detect and have intervention by creating 3D roadmapping of the vessels. However, it is often complex and difficult do reconstruct 3D vessel which causes very large amount of time and previous researches were studied to segment vessels more accurate automatically. Therefore, in this paper, Region Competition, Geodesic Active Contour (GAC), Multi-atlas based segmentation and Active Shape Model algorithms were applied to segment aortic root from CTA images and the results were analyzed by using mean Hausdorff distance, volume to volume measure, computational time, user-interaction and coronary ostium detection rate. As a result, Extracted 3D aortic model using GAC showed the highest accuracy but also showed highest user-interaction results. Therefore, it is important to improve automatic segmentation algorithm in future