Multicomponent volume reconstruction from slice data using a modified multicomponent Cahn-Hilliard system
- Authors
- Li, Yibao; Wang, Jing; Lu, Bingheng; Jeong, Darae; Kim, Junseok
- Issue Date
- 9월-2019
- Publisher
- ELSEVIER SCI LTD
- Keywords
- Multicomponent; Volume reconstruction; Cahn-Hilliard equation; Cross section interpolating
- Citation
- PATTERN RECOGNITION, v.93, pp.124 - 133
- Indexed
- SCIE
SCOPUS
- Journal Title
- PATTERN RECOGNITION
- Volume
- 93
- Start Page
- 124
- End Page
- 133
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/62984
- DOI
- 10.1016/j.patcog.2019.04.006
- ISSN
- 0031-3203
- Abstract
- We propose an efficient and robust algorithm to reconstruct the volumes of multi-labeled objects from sets of cross sections without overlapping regions, artificial gaps, or mismatched interfaces. The algorithm can handle cross sections wherein different regions have different labels. The present study represents a multicomponent extension of our previous work (Li et al. (2015), [1]), wherein we modified the original Cahn-Hilliard (CH) equation by adding a fidelity term to keep the solution close to the single-labeled slice data. The classical CH equation possesses desirable properties, such as smoothing and conservation. The key idea of the present work is to employ a multicomponent CH system to reconstruct multicomponent volumes without self-intersections. We utilize the linearly stabilized convex splitting scheme introduced by Eyre with the Fourier-spectral method so that we can use a large time step and solve the discrete equation quickly. The proposed algorithm is simple and produces smooth volumes that closely preserve the original volume data and do not self-intersect. Numerical results demonstrate the effectiveness and robustness of the proposed method. (C) 2019 Elsevier Ltd. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.