Unsupervised regions based segmentation using object discovery

Journal of Visual Communication and Image Representation(2015)

引用 12|浏览43
暂无评分
摘要
A fully unsupervised foreground object discovery scheme is proposed.A tree-constrained iterative algorithm achieves high accuracy for segmentation.Color-based FG model works well on objects with complicated fine structures. We present a new unsupervised algorithm to discovery and segment out common objects from multiple images. Compared with previous cosegmentation methods, our algorithm performs well even when the appearance variations in the foregrounds are more substantial than those in some areas of the backgrounds. Our algorithm mainly includes two parts: the foreground object discovery scheme and the iterative region allocation algorithm. Two terms, a region-saliency prior and a region-repeatness measure, are introduced in the foreground object discovery scheme to detect the foregrounds without any supervisory information. The iterative region allocation algorithm searches the optimal solution for the final segmentation with the constraints from a maximal spanning tree, and an effective color-based model is utilized during this process. The comparative experimental results show that the proposed algorithm matches or outperforms several previous methods on several standard datasets.
更多
查看译文
关键词
Cosegmentation,Segmentation,Regions based,Object discovery,Saliency,Maximal spanning tree,Structural constraint,Combinatorial optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要