Semi-automated Organ Segmentation Using 3-dimensional Medical Imagery through Sparse Representation

DOI Web Site
  • WATANABE Hidefumi
    Graduate School of Engineering, Tokyo University of Agriculture and Technology
  • SHIMIZU Akinobu
    Graduate School of Engineering, Tokyo University of Agriculture and Technology
  • UMETSU Shun
    Graduate School of Engineering, Tokyo University of Agriculture and Technology
  • KOBATAKE Hidefumi
    Institute of National Colleges of Technology
  • UENO Junji
    Faculty of Medicine, The University of Tokushima
  • NAWANO Shigeru
    Mita Hospital, International University of Health and Welfare

Bibliographic Information

Other Title
  • スパース表現を用いた3次元医用画像からの半自動臓器セグメンテーションアルゴリズム
  • スパース ヒョウゲン オ モチイタ 3ジゲン イヨウ ガゾウ カラ ノ ハンジドウ ゾウキ セグメンテーションアルゴリズム

Search this article

Description

This paper proposes a semi-automated organ segmentation algorithm using landmarks (LMs) from a computed tomography (CT) volume. Here, several LMs are manually defined by the user on a target organ's surface in an input volume. A patient-specific probabilistic atlas (PA) is constructed based on sparse representation obtained using training labels computed by minimizing the square error between the input and training label LMs as well as the L1 norm term. This paper presents the experimental results for the purpose of segmentation of the liver, gallbladder, and right and left kidneys, in which the proposed PA was proved to be effective in an organ of irregular shape. The average Jaccard Indices of the maximum a posteriori followed by graph cuts-based segmentation of all the target organs were 0.757 for a conventional PA, and 0.838 for the proposed PA, respectively. It was statistically confirmed that the segmentation performance using a proposed PA was superior to that using a conventional PA. We also discuss the pros and cons of the proposed PA by exploring the relationship between the organ's shape and segmentation performance.

Journal

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top