arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.10003cs.CVcs.DMmath.CO
收藏

秀丽隐杆线虫胚胎细胞核识别的超图精确匹配算法

An Exact Hypergraph Matching Algorithm for Nuclear Identification in Embryonic Caenorhabditis elegans

University of Maryland, College Park(马里兰大学帕克分校);National Institutes of Health(美国国立卫生研究院)

Andrew Lauziere, Ryan Christensen, Hari Shroff, Radu Balan

摘要:

在计算机视觉中,寻找点集之间的最佳对应关系是一项常见的任务。现有技术假设点之间的关系相对简单,并且不能保证最佳匹配。我们介绍了一种算法,能够准确地解决点集匹配建模的超图匹配的任务。该算法扩展了经典的分支定界范式,选择和聚合的多线性目标函数的分解下的顶点。该方法的动机是秀丽隐杆线虫,一种经常用于发育生物学和神经生物学的模式生物。胚胎C.线虫含有缝细胞,这些细胞可以作为基准标记,允许在胚胎发育期间识别其他细胞核。所提出的算法识别接缝细胞更准确地比建立点集匹配方法,同时提供了一个框架,以接近其他类似的复杂点集匹配任务。

英文摘要:

Finding an optimal correspondence between point sets is a common task in computer vision. Existing techniques assume relatively simple relationships among points and do not guarantee an optimal match. We introduce an algorithm capable of exactly solving point set matching by modeling the task as hypergraph matching. The algorithm extends the classical branch and bound paradigm to select and aggregate vertices under a proposed decomposition of the multilinear objective function. The methodology is motivated by Caenorhabditis elegans, a model organism used frequently in developmental biology and neurobiology. The embryonic C. elegans contains seam cells that can act as fiducial markers allowing the identification of other nuclei during embryo development. The proposed algorithm identifies seam cells more accurately than established point-set matching methods, while providing a framework to approach other similarly complex point set matching tasks.

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

↑