Renal cortex segmentation using optimal surface search with novel graph construction

  • Xiuli Li
  • , Xinjian Chen
  • , Jianhua Yao
  • , Xing Zhang
  • , Jie Tian*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we propose a novel approach to solve the renal cortex segmentation problem, which has rarely been studied. In this study, the renal cortex segmentation problem is handled as a multiple-surfaces extraction problem, which is solved using the optimal surface search method. We propose a novel graph construction scheme in the optimal surface search to better accommodate multiple surfaces. Different surface sub-graphs are constructed according to their properties, and inter-surface relationships are also modeled in the graph. The proposed method was tested on 17 clinical CT datasets. The true positive volume fraction (TPVF) and false positive volume fraction (FPVF) are 74.10% and 0.08%, respectively. The experimental results demonstrate the effectiveness of the proposed method.

Original languageEnglish
Title of host publicationMedical Image Computing and Computer-Assisted Intervention, MICCAI 2011 - 14th International Conference, Proceedings
Pages387-394
Number of pages8
EditionPART 3
DOIs
StatePublished - 2011
Externally publishedYes
Event14th International Conference on Medical Image Computing and Computer Assisted Intervention, MICCAI 2011 - Toronto, ON, Canada
Duration: 18 Sep 201122 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume6893 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Medical Image Computing and Computer Assisted Intervention, MICCAI 2011
Country/TerritoryCanada
CityToronto, ON
Period18/09/1122/09/11

Fingerprint

Dive into the research topics of 'Renal cortex segmentation using optimal surface search with novel graph construction'. Together they form a unique fingerprint.

Cite this