arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.03022cs.CV
收藏

基于迭代下一边界检测的灌木横截面显微图像年轮实例分割

Iterative Next Boundary Detection for Instance Segmentation of Tree Rings in Microscopy Images of Shrub Cross Sections

Fraunhofer Institute for Computer Graphics Research (IGD)(弗劳恩霍夫计算机图形学研究所(IGD));Ernst Moritz Arndt University(恩斯特·莫里茨·阿恩特大学);Centre for Research on Ecology and Forestry Applications (CREAF)(生态与林业应用研究中心(CREAF));University of Rostock(罗斯托克大学)

Alexander Gillert, Giulia Resente, Alba Anadon-Rosell, Martin Wilmking, Uwe Freiherr von Lukas

摘要:

我们解决的问题,检测树木年轮的灌木横截面的显微图像。这可以被认为是实例分割任务的特殊情况,具有若干独特的挑战,例如对象的同心圆环形状和导致现有方法性能不足的高精度要求。我们提出了一种新的迭代法,我们称之为迭代下边界检测(INBD)。它直观地模拟自然生长方向,从灌木横截面的中心开始,并在每个迭代步骤中检测下一个环边界。在我们的实验中,INBD表现出优于一般的实例分割方法的性能,是唯一一个内置的时间顺序的概念。我们的数据集和源代码可以在http://github.com/alexander-g/INBD上找到。

英文摘要:

We address the problem of detecting tree rings in microscopy images of shrub cross sections. This can be regarded as a special case of the instance segmentation task with several unique challenges such as the concentric circular ring shape of the objects and high precision requirements that result in inadequate performance of existing methods. We propose a new iterative method which we term Iterative Next Boundary Detection (INBD). It intuitively models the natural growth direction, starting from the center of the shrub cross section and detecting the next ring boundary in each iteration step. In our experiments, INBD shows superior performance to generic instance segmentation methods and is the only one with a built-in notion of chronological order. Our dataset and source code are available at http://github.com/alexander-g/INBD.

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

↑