No Cover Image

Conference Paper/Proceeding/Abstract 1298 views 249 downloads

Minimum s-Excess Graph for Segmenting and Tracking Multiple Borders with HMM

Ehab Essa, Xianghua Xie Orcid Logo, Jonathan Jones

International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI), Volume: 9350, Pages: 28 - 35

Swansea University Author: Xianghua Xie Orcid Logo

DOI (Published version): 10.1007/978-3-319-24571-3_4

Abstract

We present a novel HMM based approach to simultaneous segmentation of vessel walls in Lymphatic confocal images. The vessel borders are parameterized using RBFs to minimize the number of tracking points. The proposed method tracks the hidden states that indicate border locations for both the inner a...

Full description

Published in: International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI)
ISBN: 978-3-319-24570-6 978-3-319-24571-3
Published: Medical Image Computing and Computer-Assisted Intervention -- MICCAI 2015. MICCAI 2015. Lecture Notes in Computer Science, vol 9350. Navab N., Hornegger J., Wells W., Frangi A. (eds). 2015
Online Access: http://link.springer.com/chapter/10.1007%2F978-3-319-24571-3_4
URI: https://cronfa.swan.ac.uk/Record/cronfa22241
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract: We present a novel HMM based approach to simultaneous segmentation of vessel walls in Lymphatic confocal images. The vessel borders are parameterized using RBFs to minimize the number of tracking points. The proposed method tracks the hidden states that indicate border locations for both the inner and outer walls. The observation for both borders is obtained using edge-based features from steerable filters. Two separate Gaussian probability distributions for the vessel borders and background are used to infer the emission probability, and the transmission probability is learned using a Baum-Welch algorithm. We transform the segmentation problem into a minimization of an s-excess graph cost, with each node in the graph corresponding to a hidden state and the weight for each node being defined by its emission probability. We define the inter-relations between neighboring nodes based on the transmission probability. We present both qualitative and quantitative analysis in comparison to the popular Viterbi algorithm.
Keywords: Graph cut, image segmentation, medical image analysis, HMM, multiple border segmentation
College: Faculty of Science and Engineering
Start Page: 28
End Page: 35