International Journal of Computer Theory and Engineering

Frequency: Quarterly
ISSN: 1793-8201 (Print), 2972-4511 (Online)
Publisher:IACSIT Press

OPEN ACCESS
4.0
CiteScore

IJCTE 2017 Vol.9(2): 73-78
doi: 10.7763/IJCTE.2017.V9.1115

An Optimal and Automatic Graph Cut Method for Biomedical Images Using Compactness Measure

Sonia Nardotto , Laura Gemme , Silvana G. Dellepiane

  • Università degli Studi di Genova, via Opera Pia 11a, I16145 Genova, Italy.

Abstract

This work aims to achieve an automatic and optimal graph cut phase based on a segmentation method presented in a previous paper. A graph-based segmentation algorithm, starting from a seed point belonging to the region of interest (ROI), is able to find the Minimum Path Spanning Tree (MPST) by using a new cost function and an optimal aggregation criterion. In order to extract the ROI, a graph-cut of the obtained tree is absolutely necessary. By definition, the main drawback of the graph-based segmentation methods is the loss of spatial and contextual information. To overcome this problem, a new method based on compactness measure is here proposed The present approach is applied to the biomedical field, considering Magnetic Resonance Imaging (MRI) volumes of the hand and neurological districts.

Keywords

  • Automatic segmentation
  • graph-based segmentation
  • graph cut
  • compactness measure
1115-S022

How to Cite

Copied

Sonia Nardotto, Laura Gemme, and Silvana G. Dellepiane, "An Optimal and Automatic Graph Cut Method for Biomedical Images Using Compactness Measure," International Journal of Computer Theory and Engineering, vol. 9, no. 2, pp. 73-78, 2017. https://doi.org/10.7763/IJCTE.2017.V9.1115

Copyright & License

Copyright © 2017 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Menu