A new Graph-Based method for automatic segmentation

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a new graph-based segmentation method is proposed. Various Regions of Interest (ROIs) can be extracted from digital images/volumes without requiring any processing parameters. Only one point belonging to the region of interest must be given. The method, starting from a single source element, proceeds with a specific propagation mechanism based on the graph theory, to find a Minimum Path Spanning Tree (MPST). As compared with other existing segmentation methods, a new cost function is here proposed. It allows the process to be adaptive to both a local and global context, to be optimal and independent from the order of analysis, requiring a single iteration step. The final decision step is based on a threshold value that is automatically selected. Performance evaluation is presented by applying the method in the biomedical field, considering the extraction of wrist bones from real Magnetic Resonance Imaging (MRI) volumes.

Cite

CITATION STYLE

APA

Gemme, L., & Dellepiane, S. (2015). A new Graph-Based method for automatic segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9279, pp. 601–611). Springer Verlag. https://doi.org/10.1007/978-3-319-23231-7_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free