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}
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.