电阻抗断层成像的最佳传输

IF 2.2 2区 数学 Q1 MATHEMATICS, APPLIED
Gang Bao, Yixuan Zhang
{"title":"电阻抗断层成像的最佳传输","authors":"Gang Bao, Yixuan Zhang","doi":"10.1090/mcom/3919","DOIUrl":null,"url":null,"abstract":"This work establishes a framework for solving inverse boundary problems with the geodesic-based quadratic Wasserstein distance (<inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper W 2\"> <mml:semantics> <mml:msub> <mml:mi>W</mml:mi> <mml:mrow class=\"MJX-TeXAtom-ORD\"> <mml:mn>2</mml:mn> </mml:mrow> </mml:msub> <mml:annotation encoding=\"application/x-tex\">W_{2}</mml:annotation> </mml:semantics> </mml:math> </inline-formula>). A general form of the Fréchet gradient is systematically derived from the optimal transportation (OT) theory. In addition, a fast algorithm based on the new formulation of OT on <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"double-struck upper S Superscript 1\"> <mml:semantics> <mml:msup> <mml:mrow class=\"MJX-TeXAtom-ORD\"> <mml:mi mathvariant=\"double-struck\">S</mml:mi> </mml:mrow> <mml:mrow class=\"MJX-TeXAtom-ORD\"> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> <mml:annotation encoding=\"application/x-tex\">\\mathbb {S}^{1}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is developed to solve the corresponding optimal transport problem. The computational complexity of the algorithm is reduced to <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper O left-parenthesis upper N right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">O(N)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> from <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper O left-parenthesis upper N cubed right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:msup> <mml:mi>N</mml:mi> <mml:mrow class=\"MJX-TeXAtom-ORD\"> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">O(N^{3})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of the traditional method. Combining with the adjoint-state method, this framework provides a new computational approach for solving the challenging electrical impedance tomography problem. Numerical examples are presented to illustrate the effectiveness of our method.","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":"7 9","pages":"0"},"PeriodicalIF":2.2000,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal transportation for electrical impedance tomography\",\"authors\":\"Gang Bao, Yixuan Zhang\",\"doi\":\"10.1090/mcom/3919\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work establishes a framework for solving inverse boundary problems with the geodesic-based quadratic Wasserstein distance (<inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper W 2\\\"> <mml:semantics> <mml:msub> <mml:mi>W</mml:mi> <mml:mrow class=\\\"MJX-TeXAtom-ORD\\\"> <mml:mn>2</mml:mn> </mml:mrow> </mml:msub> <mml:annotation encoding=\\\"application/x-tex\\\">W_{2}</mml:annotation> </mml:semantics> </mml:math> </inline-formula>). A general form of the Fréchet gradient is systematically derived from the optimal transportation (OT) theory. In addition, a fast algorithm based on the new formulation of OT on <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"double-struck upper S Superscript 1\\\"> <mml:semantics> <mml:msup> <mml:mrow class=\\\"MJX-TeXAtom-ORD\\\"> <mml:mi mathvariant=\\\"double-struck\\\">S</mml:mi> </mml:mrow> <mml:mrow class=\\\"MJX-TeXAtom-ORD\\\"> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> <mml:annotation encoding=\\\"application/x-tex\\\">\\\\mathbb {S}^{1}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is developed to solve the corresponding optimal transport problem. The computational complexity of the algorithm is reduced to <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper O left-parenthesis upper N right-parenthesis\\\"> <mml:semantics> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy=\\\"false\\\">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy=\\\"false\\\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\\\"application/x-tex\\\">O(N)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> from <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper O left-parenthesis upper N cubed right-parenthesis\\\"> <mml:semantics> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy=\\\"false\\\">(</mml:mo> <mml:msup> <mml:mi>N</mml:mi> <mml:mrow class=\\\"MJX-TeXAtom-ORD\\\"> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mo stretchy=\\\"false\\\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\\\"application/x-tex\\\">O(N^{3})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of the traditional method. Combining with the adjoint-state method, this framework provides a new computational approach for solving the challenging electrical impedance tomography problem. Numerical examples are presented to illustrate the effectiveness of our method.\",\"PeriodicalId\":18456,\"journal\":{\"name\":\"Mathematics of Computation\",\"volume\":\"7 9\",\"pages\":\"0\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2023-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics of Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/mcom/3919\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/mcom/3919","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

本文建立了求解基于测地线的二次Wasserstein距离(w2w_{2})逆边界问题的框架。从最优运输理论出发,系统地导出了fr切特梯度的一般形式。此外,基于s1 \mathbb {S}^{1}上新的OT公式,提出了求解相应最优运输问题的快速算法。该算法的计算复杂度由传统方法的O(N 3) O(N^{3})降低到O(N) O(N)。结合伴随状态法,该框架为解决具有挑战性的电阻抗层析成像问题提供了一种新的计算方法。数值算例说明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal transportation for electrical impedance tomography
This work establishes a framework for solving inverse boundary problems with the geodesic-based quadratic Wasserstein distance ( W 2 W_{2} ). A general form of the Fréchet gradient is systematically derived from the optimal transportation (OT) theory. In addition, a fast algorithm based on the new formulation of OT on S 1 \mathbb {S}^{1} is developed to solve the corresponding optimal transport problem. The computational complexity of the algorithm is reduced to O ( N ) O(N) from O ( N 3 ) O(N^{3}) of the traditional method. Combining with the adjoint-state method, this framework provides a new computational approach for solving the challenging electrical impedance tomography problem. Numerical examples are presented to illustrate the effectiveness of our method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematics of Computation
Mathematics of Computation 数学-应用数学
CiteScore
3.90
自引率
5.00%
发文量
55
审稿时长
7.0 months
期刊介绍: All articles submitted to this journal are peer-reviewed. The AMS has a single blind peer-review process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are. This journal is devoted to research articles of the highest quality in computational mathematics. Areas covered include numerical analysis, computational discrete mathematics, including number theory, algebra and combinatorics, and related fields such as stochastic numerical methods. Articles must be of significant computational interest and contain original and substantial mathematical analysis or development of computational methodology.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信