arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.00907cs.CV
收藏

用于细胞分割的候选多重切割

The Candidate Multi-Cut for Cell Segmentation

Institut de Robotica i Informatica Industrial, UPC(加泰罗尼亚理工大学工业机器人与计算机研究所);Universitat Pompeu Fabra(庞培法布拉大学);MPI-CBG(马克斯·普朗克分子细胞生物学与遗传学研究所);Janelia Research Campus(珍妮利亚研究园区)

Jan Funke, Chong Zhang, Tobias Pietzsch, Stephan Saalfeld

摘要:

生物医学图像分割的两种成功方法是(1)从合并树中选择候选分割,以及(2)通过解决多切割问题对小超像素进行聚类。在本文中,我们介绍了一个模型,统一这两种方法。我们的模型,候选人多切割(CMC),允许联合选择和聚类的部分候选人从合并树。通过这种方式,我们克服了各个方法的各自局限性:(1)可能分割的空间不限于合并树的候选者,以及(2)可以使用更大上下文上的特征对大于超像素的候选者进行聚类决策。我们使用整数线性规划来解决候选人的选择和聚类的优化问题。在细胞群的2D光学显微镜和神经元的3D电子显微镜的数据集上,我们表明我们的方法具有很好的泛化能力,并且比单独的合并树或Multi-Cut方法生成更准确的分割。

英文摘要:

Two successful approaches for the segmentation of biomedical images are (1) the selection of segment candidates from a merge-tree, and (2) the clustering of small superpixels by solving a Multi-Cut problem. In this paper, we introduce a model that unifies both approaches. Our model, the Candidate Multi-Cut (CMC), allows joint selection and clustering of segment candidates from a merge-tree. This way, we overcome the respective limitations of the individual methods: (1) the space of possible segmentations is not constrained to candidates of a merge-tree, and (2) the decision for clustering can be made on candidates larger than superpixels, using features over larger contexts. We solve the optimization problem of selecting and clustering of candidates using an integer linear program. On datasets of 2D light microscopy of cell populations and 3D electron microscopy of neurons, we show that our method generalizes well and generates more accurate segmentations than merge-tree or Multi-Cut methods alone.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑