基于MCMC的鲁棒多模型拟合和可视化数据分割采样技术

Alireza Sadri, Ruwan Tennakoon, R. Hoseinnezhad, A. Bab-Hadiashar
{"title":"基于MCMC的鲁棒多模型拟合和可视化数据分割采样技术","authors":"Alireza Sadri, Ruwan Tennakoon, R. Hoseinnezhad, A. Bab-Hadiashar","doi":"10.1109/IPTA.2016.7821022","DOIUrl":null,"url":null,"abstract":"This paper approaches the problem of geometric multi-model fitting as a data segmentation problem which is solved by a sequence of sampling, model selection and clustering steps. We propose a sampling method that significantly facilitates solving the segmentation problem using the Normalized cut. The sampler is a novel application of Markov-Chain-Monte-Carlo (MCMC) method to sample from a distribution in the parameter space that is obtained by modifying the Least kth Order Statistics cost function. To sample from this distribution effectively, our proposed Markov Chain includes novel long and short jumps to ensure exploration and exploitation of all structures. It also includes fast local optimization steps to target all, even fairly small, putative structures. This leads to a clustering solution through which final model parameters for each segment are obtained. The method competes favorably with the state-of-the-art both in terms of computation power and segmentation accuracy.","PeriodicalId":123429,"journal":{"name":"2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"MCMC based sampling technique for robust multi-model fitting and visual data segmentation\",\"authors\":\"Alireza Sadri, Ruwan Tennakoon, R. Hoseinnezhad, A. Bab-Hadiashar\",\"doi\":\"10.1109/IPTA.2016.7821022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper approaches the problem of geometric multi-model fitting as a data segmentation problem which is solved by a sequence of sampling, model selection and clustering steps. We propose a sampling method that significantly facilitates solving the segmentation problem using the Normalized cut. The sampler is a novel application of Markov-Chain-Monte-Carlo (MCMC) method to sample from a distribution in the parameter space that is obtained by modifying the Least kth Order Statistics cost function. To sample from this distribution effectively, our proposed Markov Chain includes novel long and short jumps to ensure exploration and exploitation of all structures. It also includes fast local optimization steps to target all, even fairly small, putative structures. This leads to a clustering solution through which final model parameters for each segment are obtained. The method competes favorably with the state-of-the-art both in terms of computation power and segmentation accuracy.\",\"PeriodicalId\":123429,\"journal\":{\"name\":\"2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)\",\"volume\":\"104 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPTA.2016.7821022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Sixth International Conference on Image Processing Theory, Tools and Applications (IPTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPTA.2016.7821022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文将几何多模型拟合问题视为一个数据分割问题,通过一系列采样、模型选择和聚类步骤来解决。我们提出了一种采样方法,极大地促进了使用归一化切割来解决分割问题。采样器是马尔可夫链-蒙特卡罗(MCMC)方法的一种新应用,通过修改最小k阶统计量代价函数来从参数空间中的分布中采样。为了有效地从这个分布中采样,我们提出的马尔可夫链包括了新颖的长跳和短跳,以确保对所有结构的探索和利用。它还包括快速局部优化步骤,以针对所有,甚至相当小的假定结构。这导致了一个聚类解决方案,通过它可以获得每个部分的最终模型参数。该方法在计算能力和分割精度方面都具有较好的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MCMC based sampling technique for robust multi-model fitting and visual data segmentation
This paper approaches the problem of geometric multi-model fitting as a data segmentation problem which is solved by a sequence of sampling, model selection and clustering steps. We propose a sampling method that significantly facilitates solving the segmentation problem using the Normalized cut. The sampler is a novel application of Markov-Chain-Monte-Carlo (MCMC) method to sample from a distribution in the parameter space that is obtained by modifying the Least kth Order Statistics cost function. To sample from this distribution effectively, our proposed Markov Chain includes novel long and short jumps to ensure exploration and exploitation of all structures. It also includes fast local optimization steps to target all, even fairly small, putative structures. This leads to a clustering solution through which final model parameters for each segment are obtained. The method competes favorably with the state-of-the-art both in terms of computation power and segmentation accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信