{"title":"图像恢复中全变分正则化的Kronecker积近似","authors":"A. Bentbib, A. Bouhamidi, K. Kreit","doi":"10.52846/ami.v49i1.1511","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new algorithm to restore blurred and noisy images based on the total variation regularization, where the discrete associated Euler-Lagrange problem is solved by exploiting the structure of the matrices and transforming the initial problem to a generalized Sylvester linear matrix equation by using a special Kronecker product approximation. Afterwards, global Krylov subspace methods are used to solve the linear matrix equation. Numerical experiments are given to illustrate the effectiveness of the proposed method.","PeriodicalId":43654,"journal":{"name":"Annals of the University of Craiova-Mathematics and Computer Science Series","volume":"9 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Kronecker product approximation for the total variation regularization in image restoration\",\"authors\":\"A. Bentbib, A. Bouhamidi, K. Kreit\",\"doi\":\"10.52846/ami.v49i1.1511\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new algorithm to restore blurred and noisy images based on the total variation regularization, where the discrete associated Euler-Lagrange problem is solved by exploiting the structure of the matrices and transforming the initial problem to a generalized Sylvester linear matrix equation by using a special Kronecker product approximation. Afterwards, global Krylov subspace methods are used to solve the linear matrix equation. Numerical experiments are given to illustrate the effectiveness of the proposed method.\",\"PeriodicalId\":43654,\"journal\":{\"name\":\"Annals of the University of Craiova-Mathematics and Computer Science Series\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2022-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of the University of Craiova-Mathematics and Computer Science Series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52846/ami.v49i1.1511\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of the University of Craiova-Mathematics and Computer Science Series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52846/ami.v49i1.1511","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
Kronecker product approximation for the total variation regularization in image restoration
In this paper, we propose a new algorithm to restore blurred and noisy images based on the total variation regularization, where the discrete associated Euler-Lagrange problem is solved by exploiting the structure of the matrices and transforming the initial problem to a generalized Sylvester linear matrix equation by using a special Kronecker product approximation. Afterwards, global Krylov subspace methods are used to solve the linear matrix equation. Numerical experiments are given to illustrate the effectiveness of the proposed method.