Minimum S-Excess graph for segmenting and tracking multiple borders with HMM

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

This article is free to access.

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.

Cite

CITATION STYLE

APA

Essa, E., Xie, X., & Jones, J. L. (2015). Minimum S-Excess graph for segmenting and tracking multiple borders with HMM. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9350, pp. 28–35). Springer Verlag. https://doi.org/10.1007/978-3-319-24571-3_4

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