BriefGPT.xyz
Apr, 2014
一种连续最大流算法解决一般的分层多标签问题
A Continuous Max-Flow Approach to General Hierarchical Multi-Labelling Problems
HTML
PDF
John S. H. Baxter, Martin Rajchl, Jing Yuan, Terry M. Peters
TL;DR
该论文提出了一种广义分层最大流(GHMF)分割算法，该算法可以在全局最优凸优化框架中将解剖学的部分-整体关系表现为非约束性分层，从而实现标签的空间分组和聚类，并适应于多种分割任务中。
Abstract
multi-region segmentation
algorithms often have the onus of incorporating complex
anatomical knowledge
representing spatial or geometric relationships between objects, and general-purpose methods of addressing th
→