paper-with-me

Papers

Feature Sensitive Label Fusion with Random Walker for Atlas-based Image Segmentation

2016-10-24 · Siqi Bao, Albert C. S. Chung

In this paper, a novel label fusion method is proposed for brain magnetic resonance image segmentation. This label fusion method is formulated on a graph, which embraces both label priors from atlases and anatomical priors from target image. To represent a pixel in a comprehensive way, three kinds of feature vectors are generated, including intensity, gradient and structural signature. To select candidate atlas nodes for fusion, rather than exact searching, randomized k-d tree with spatial constraint is introduced as an efficient approximation for high-dimensional feature matching. Feature Sensitive Label Prior (FSLP), which takes both the consistency and variety of different features into consideration, is proposed to gather atlas priors. As FSLP is a non-convex problem, one heuristic approach is further designed to solve it efficiently. Moreover, based on the anatomical knowledge, parts of the target pixels are also employed as graph seeds to assist the label fusion process and an iterative strategy is utilized to gradually update the label map. The comprehensive experiments carried out on two publicly available databases give results to demonstrate that the proposed method can obtain better segmentation quality.

📄 PDF Abstract BibTeX arXiv:1610.07475

Code (0)

등록된 구현이 없습니다.

Tasks

Image SegmentationSemantic Segmentation

Similar Papers 제목 키워드 기반

End-to-End Learned Random Walker for Seeded Image Segmentation

2019-05-22 · CVPR 2019 6 · Lorenzo Cerrone, Alexander Zeilmann, Fred A. Hamprecht

We present an end-to-end learned algorithm for seeded segmentation. Our method is based on the Random Walker algorithm, where we predict the edge weights of the underlying graph using a convolutional neural network. This…

Image SegmentationInstance SegmentationSegmentation

Selection of Random Walkers that Optimizes the Global Mean First-Passage Time for Search in Complex Networks

2018-12-12 · Mucong Ding, Kwok Yip Szeto

We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to th…

GuiltyWalker: Distance to illicit nodes in the Bitcoin network

2021-02-10 · Catarina Oliveira, João Torres, Maria Inês Silva, David Aparício 외

Money laundering is a global phenomenon with wide-reaching social and economic consequences. Cryptocurrencies are particularly susceptible due to the lack of control by authorities and their anonymity. Thus, it is import…

The Diffusion Metrics of African Swine Fever in Wild Boar

2022-02-03 · Hartmut H. K. Lentz, Hannes Bergmann, C. Sauter-Louis

To control African swine fever (ASF) efficiently, easily interpretable metrics of the outbreak dynamics are needed to plan and adapt the required measures. We found that the spread pattern of African Swine Fever cases in…

Stochastic compartment model with mortality and its application to epidemic spreading in complex networks

2024-03-18 · Teo Granger, Thomas M. Michelitsch, Michael Bestehorn, Alejandro P. Riascos 외

We study epidemic spreading in complex networks by a multiple random walker approach. Each walker performs an independent simple Markovian random walk on a complex undirected (ergodic) random graph where we focus on Bara…