- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
The aim of this paper is to investigate the application of a semi-implicit additive operator splitting scheme based binary level set method to source reconstruction problems. We reformulate the original model to be a new constrained optimization problem under the binary level set framework and solve it by the augmented Lagrangian method. Then we propose an efficient gradient-type algorithm based on the additive operator splitting scheme. The proposed algorithm can create new holes during the evolution. Topological changes can be handled automatically and complex geometry can be recovered under a certain amount of noise in the observation data. Numerical examples are presented to show the effectiveness and efficiency of our method.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/693.html} }The aim of this paper is to investigate the application of a semi-implicit additive operator splitting scheme based binary level set method to source reconstruction problems. We reformulate the original model to be a new constrained optimization problem under the binary level set framework and solve it by the augmented Lagrangian method. Then we propose an efficient gradient-type algorithm based on the additive operator splitting scheme. The proposed algorithm can create new holes during the evolution. Topological changes can be handled automatically and complex geometry can be recovered under a certain amount of noise in the observation data. Numerical examples are presented to show the effectiveness and efficiency of our method.