{"title":"使用随机微分方程方法的图像反卷积","authors":"X. Descombes, M. Lebellego, E. Zhizhina","doi":"10.5220/0002064701570164","DOIUrl":null,"url":null,"abstract":"Abstract: We consider the problem of image deconvolution. We foccus on a Bayesian approach which consists of maximizing an energy obtained by a Markov Random Field modeling. MRFs are classically optimized by a MCMC sampler embeded into a simulated annealing scheme. In a previous work, we have shown that, in the context of image denoising, a diffusion process can outperform the MCMC approach in term of computational time. Herein, we extend this approach to the case of deconvolution. We first study the case where the kernel is known. Then, we address the myopic and blind deconvolutions.","PeriodicalId":411140,"journal":{"name":"International Conference on Computer Vision Theory and Applications","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Image deconvolution using a stochastic differential equation approach\",\"authors\":\"X. Descombes, M. Lebellego, E. Zhizhina\",\"doi\":\"10.5220/0002064701570164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract: We consider the problem of image deconvolution. We foccus on a Bayesian approach which consists of maximizing an energy obtained by a Markov Random Field modeling. MRFs are classically optimized by a MCMC sampler embeded into a simulated annealing scheme. In a previous work, we have shown that, in the context of image denoising, a diffusion process can outperform the MCMC approach in term of computational time. Herein, we extend this approach to the case of deconvolution. We first study the case where the kernel is known. Then, we address the myopic and blind deconvolutions.\",\"PeriodicalId\":411140,\"journal\":{\"name\":\"International Conference on Computer Vision Theory and Applications\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computer Vision Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0002064701570164\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Vision Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0002064701570164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Image deconvolution using a stochastic differential equation approach
Abstract: We consider the problem of image deconvolution. We foccus on a Bayesian approach which consists of maximizing an energy obtained by a Markov Random Field modeling. MRFs are classically optimized by a MCMC sampler embeded into a simulated annealing scheme. In a previous work, we have shown that, in the context of image denoising, a diffusion process can outperform the MCMC approach in term of computational time. Herein, we extend this approach to the case of deconvolution. We first study the case where the kernel is known. Then, we address the myopic and blind deconvolutions.