在超像素边界图中作为最小比率循环的对象切割

Gao Zhu, Y. Ming, Hongdong Li
{"title":"在超像素边界图中作为最小比率循环的对象切割","authors":"Gao Zhu, Y. Ming, Hongdong Li","doi":"10.1109/DICTA.2013.6691506","DOIUrl":null,"url":null,"abstract":"A category-specific object cut method is proposed in this paper that utilizes both minimum ratio cycle optimization and superpixel segmentation. This method can find a non-self-intersecting cycle in the image plane which aligns well with the outer boundary of an object instance. Most existing approaches under the minimum ratio cycle optimization framework are used for unsupervised image segmentation. Directly applying their approaches will cause orientation ambiguity which makes the globally minimal solution unachievable. It is demonstrated that a modification on top-down classification information can alleviate this difficulty even it does not hold for traditional linear-energy object cut methods. PASCAL VOC 2007 segmentation dataset is used for experimental evaluation and improved performance is obtained when our method is compared with other competitive object cut algorithms.","PeriodicalId":231632,"journal":{"name":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Object Cut as Minimum Ratio Cycle in a Superpixel Boundary Graph\",\"authors\":\"Gao Zhu, Y. Ming, Hongdong Li\",\"doi\":\"10.1109/DICTA.2013.6691506\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A category-specific object cut method is proposed in this paper that utilizes both minimum ratio cycle optimization and superpixel segmentation. This method can find a non-self-intersecting cycle in the image plane which aligns well with the outer boundary of an object instance. Most existing approaches under the minimum ratio cycle optimization framework are used for unsupervised image segmentation. Directly applying their approaches will cause orientation ambiguity which makes the globally minimal solution unachievable. It is demonstrated that a modification on top-down classification information can alleviate this difficulty even it does not hold for traditional linear-energy object cut methods. PASCAL VOC 2007 segmentation dataset is used for experimental evaluation and improved performance is obtained when our method is compared with other competitive object cut algorithms.\",\"PeriodicalId\":231632,\"journal\":{\"name\":\"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)\",\"volume\":\"142 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DICTA.2013.6691506\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Digital Image Computing: Techniques and Applications (DICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DICTA.2013.6691506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种结合最小比例循环优化和超像素分割的分类目标切割方法。该方法可以在图像平面上找到与对象实例外边界对齐良好的非自相交循环。现有的无监督图像分割方法大多采用最小比循环优化框架下的方法。直接应用它们的方法会导致方向模糊,使全局最小解无法实现。结果表明,对自顶向下的分类信息进行修改可以缓解这一困难,即使传统的线性能量目标切割方法不成立。使用PASCAL VOC 2007分割数据集进行实验评估,并与其他竞争对象分割算法进行比较,得到了更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Object Cut as Minimum Ratio Cycle in a Superpixel Boundary Graph
A category-specific object cut method is proposed in this paper that utilizes both minimum ratio cycle optimization and superpixel segmentation. This method can find a non-self-intersecting cycle in the image plane which aligns well with the outer boundary of an object instance. Most existing approaches under the minimum ratio cycle optimization framework are used for unsupervised image segmentation. Directly applying their approaches will cause orientation ambiguity which makes the globally minimal solution unachievable. It is demonstrated that a modification on top-down classification information can alleviate this difficulty even it does not hold for traditional linear-energy object cut methods. PASCAL VOC 2007 segmentation dataset is used for experimental evaluation and improved performance is obtained when our method is compared with other competitive object cut algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信