Augmented tree partitioning for interactive image segmentation

ICIP(2008)

引用 3|浏览68
暂无评分
摘要
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to model the image, we use a tree-based structure called the augmented tree, which is built up by augmenting several abstract label nodes to the minimum spanning tree of the original graph. We then model image segmentation as the partitioning problem on the augmented tree. Dynamic programming is used to efficiently solve the optimization problem. Experimental results show that our method gives competitive segmentation results, and the speed is much faster than graph- based methods.
更多
查看译文
关键词
trees (mathematics),augmented tree,tree-based structure,dy- namic programming,image segmentation,semi-supervised image segmentation,interactive image segmentation,augmented tree partitioning,dynamic programming,index terms— image segmentation,graph structure,optimization problem,indexing terms,minimum spanning tree,pixel,belief propagation,algorithm design and analysis
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要