{"title":"A 2-level domain decomposition algorithm for inverse diffuse optical tomography","authors":"Il-Young Son, M. Guven, Xavier Intes, B. Yazıcı","doi":"10.1109/ICIP.2004.1421823","DOIUrl":null,"url":null,"abstract":"In this paper, we explore domain decomposition algorithms for the inverse DOT problem in order to reduce the computational complexity and accelerate the convergence of the optical image reconstruction. We propose a combination of a two-level multigrid algorithm with a modified multiplicative Schwarz algorithm, where a conjugate gradient is used as an accelerator to solve each sub-problem formulated on each of the partitioned sub-domains. For our experiments, simulated phantom configuration with two rectangular inclusions is used as a testbed to measure the computational efficiency of our algorithms. No a priori information about the configuration is assumed except for the source and detector locations. For the application of our modified Schwarz algorithm alone, we observe an increase in efficiency of 100% as compared to the conjugate gradient solution obtained for the full domain. With the addition of the coarse grid, this efficiency rises to 400%. The coarse grid also serves to improve the overall appearance of the reconstructed image at the boundaries of the inclusions.","PeriodicalId":147245,"journal":{"name":"International Conference on Information Photonics","volume":"354 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Information Photonics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2004.1421823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, we explore domain decomposition algorithms for the inverse DOT problem in order to reduce the computational complexity and accelerate the convergence of the optical image reconstruction. We propose a combination of a two-level multigrid algorithm with a modified multiplicative Schwarz algorithm, where a conjugate gradient is used as an accelerator to solve each sub-problem formulated on each of the partitioned sub-domains. For our experiments, simulated phantom configuration with two rectangular inclusions is used as a testbed to measure the computational efficiency of our algorithms. No a priori information about the configuration is assumed except for the source and detector locations. For the application of our modified Schwarz algorithm alone, we observe an increase in efficiency of 100% as compared to the conjugate gradient solution obtained for the full domain. With the addition of the coarse grid, this efficiency rises to 400%. The coarse grid also serves to improve the overall appearance of the reconstructed image at the boundaries of the inclusions.