A Fast Local Level Set Method for Inverse Gravimetry

被引:41
|
作者
Isakov, Victor [2 ]
Leung, Shingyu [3 ]
Qian, Jianliang [1 ]
机构
[1] Michigan State Univ, Dept Math, E Lansing, MI 48824 USA
[2] Wichita State Univ, Dept Math & Stat, Wichita, KS 67208 USA
[3] Hong Kong Univ Sci & Technol, Dept Math, Hong Kong, Hong Kong, Peoples R China
基金
美国国家科学基金会;
关键词
Level set methods; inverse gravimetry; fast algorithms; numerical continuation; RECONSTRUCTION; EQUATIONS; EVOLUTION;
D O I
10.4208/cicp.100710.021210a
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We propose a fast local level set method for the inverse problem of gravimetry. The theoretical foundation for our approach is based on the following uniqueness result: if an open set D is star-shaped or x(3)-convex with respect to its center of gravity, then its exterior potential uniquely determines the open set D. To achieve this purpose constructively, the first challenge is how to parametrize this open set D as its boundary may have a variety of possible shapes. To describe those different shapes we propose to use a level-set function to parametrize the unknown boundary of this open set. The second challenge is how to deal with the issue of partial data as gravimetric measurements are only made on a part of a given reference domain a To overcome this difficulty, we propose a linear numerical continuation approach based on the single layer representation to find potentials on the boundary of some artificial domain containing the unknown set D. The third challenge is how to speed up the level set inversion process. Based on some features of the underlying inverse gravimetry problem such as the potential density being constant inside the unknown domain, we propose a novel numerical approach which is able to take advantage of these features so that the computational speed is accelerated by an order of magnitude. We carry out numerical experiments for both two- and three-dimensional cases to demonstrate the effectiveness of the new algorithm.
引用
收藏
页码:1044 / 1070
页数:27
相关论文
共 50 条
  • [31] TRIAL AND ERROR METHOD IN SOLUTION OF INVERSE GRAVIMETRY AND MAGNITOMETRY PROBLEMS
    STRAKHOV, VM
    DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA B-GEOLOGICHNI KHIMICHNI TA BIOLOGICHNI NAUKI, 1975, (11): : 990 - 995
  • [32] A BAYESIAN LEVEL SET METHOD FOR AN INVERSE MEDIUM SCATTERING PROBLEM IN ACOUSTICS
    Huang, Jiangfeng
    Deng, Zhiliang
    Xu, Liwei
    INVERSE PROBLEMS AND IMAGING, 2021, 15 (05) : 1077 - 1097
  • [33] A fast marching level set method for monotonically advancing fronts
    Sethian, JA
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (04) : 1591 - 1595
  • [34] Retinal Vasculature Segmentation Based on Fast Level Set Method
    Dizdaroglu, Bekir
    2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 855 - 858
  • [35] A Fast Level Set Method for Multimaterial Recovery in Microwave Imaging
    Shah, Pratik
    Moghaddam, Mahta
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2018, 66 (06) : 3017 - 3026
  • [36] A fast image segmentation approach based on level set method
    Zhang, Li-jun
    Wu, Xiao-jun
    Sheng, Zan
    2006 8TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, VOLS 1-4, 2006, : 974 - +
  • [37] Improving Level Set Method for Fast Auroral Oval Segmentation
    Yang, Xi
    Gao, Xinbo
    Tao, Dacheng
    Li, Xuelong
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2014, 23 (07) : 2854 - 2865
  • [38] A fast marching level set method for monotonically advancing fronts
    Sethian, J. A.
    Proceedings of the National Academy of Sciences of the United States of America, 93 (04):
  • [39] Hydrodynamic simulation based on a fast particle level set method
    Huang, Xiaoyun
    Li, Shaowu
    ASIAN AND PACIFIC COASTS 2007, 2007, : 383 - 386
  • [40] Image Segmentation Using a Generalized Fast Level Set Method
    Vu, Dang Tran
    Kim, Jin Young
    Choi, Seung Ho
    Na, Seung You
    ISPRA '09: PROCEEDINGS OF THE 9TH WSEAS INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, ROBOTICS AND AUTOMATION, 2010, : 298 - +