제주대학교 Repository

Boundary estimation with gravitational search algorithm based optimization in electrical impedance tomography

Metadata Downloads
Abstract
Electrical impedance tomography (EIT) is a noninvasive image reconstruction method. It reconstructs the cross-sectional conductivity distribution of the domain. EIT is applied in various areas of applications such as medical, industrial, and geophysical. However, it suffers from poor spatial resolution due to the ill-posed and non-linear nature of the problem. Boundary or shape estimation is the alternative approach to solve this poor resolution problem. In this approach, the number of unknowns to be estimated is reduced which improves the spatial resolution. The conductivity of the closed disjoint region of the domain is assumed to be known as prior for the boundary estimation. In this thesis, for the closed boundary, the complex shape is defined by the Fourier series coefficients and the shape estimation is done with a heuristic algorithm. In this work, we have presented three scenarios for the boundary estimation in EIT.

The first study is the estimation of the bladder boundary in the pelvic domain. In this, the boundary is estimated by a heuristic algorithm gravitational search algorithm (GSA). The estimation of the bladder using the noninvasive method is necessary for paraplegia patients. These patients are unable to discharge urine at the right time due to a weaker sensation for bladder volume. If the urine is not discharged in time, then the bladder size will increase and affect the neighboring organs and tissues. Size estimation of the bladder with EIT can clarify the bladder status. The bladder is a nonuniform structure with a complex shape; therefore, higher-order Fourier series is needed to represent the true shape. Estimating higher-order Fourier coefficients by a conventional modified Newton-Raphson (mNR) algorithm does not give the desired performance. GSA is proposed in this work to estimate the Fourier series coefficients as it is known for solving optimization problems in high-dimensional search space. Also, GSA has fast convergence and does not require the computation of Jacobian. Numerical experiments and phantom studies are performed to estimate the bladder size and it is compared with the estimated result by mNR.

The second case is the estimation of the defect on the single-layer graphene sheet by PSOGSA. A PSOGSA is a hybrid algorithm that is the combination of particle swarm optimization (PSO) and GSA. Recently, graphene has gained a lot of attention in the electronic industry due to its unique properties and can overcome the limits of miniaturization making way for novel devices in the field of electronics. For the development of new device applications, it is necessary to grow large wafer-sized monolayer graphene. Among the methods to synthesize large graphene films, chemical vapour deposition (CVD) is one of the promising and common techniques but defects such as cracks, holes, or wrinkles are hard to avoid. Electrical impedance tomography (EIT) can be used to detect those defects on a graphene sheet. The conductivity is assumed to be known as prior and the geometry of the defect is estimated. These defect geometries are defined by truncated Fourier series coefficient which can represent the complex shapes. Numerical and experimental studies are done for graphene characterization and the results showed that the proposed PSOGSA has good performance in locating the defects present on a graphene surface.

The third is the open boundary case where the interlayer boundary of the subsurface is estimated. Subsurface topology estimation is important for the geophysical survey. The subsurface region can be approximated as piece-wise separate regions with constant conductivity in each region; therefore, the conductivity estimation problem is transformed to estimate the shape and location of the layer boundary interface. Each layer interface boundary is treated as an open boundary that is described using front points. A DNN model is used to estimate the front points describing the multi-layer interface boundaries. This DNN model is tuned for hidden layer nodes using PSOGSA. The PSOGSA tuned DNN model is trained for interlayer boundary reconstruction using training data that consists of pairs of voltage measurements of the subsurface domain. The tuned DNN model estimation result is compared with the 7-layer DNN model. The study on all three cases shows the proposed method has a better estimation result than the compared method.
Author(s)
샤르마 수남 쿠마르
Issued Date
2022
Awarded Date
2022-08
Type
Dissertation
URI
https://dcoll.jejunu.ac.kr/common/orgView/000000010651
Alternative Author(s)
Sharma Sunam Kumar
Affiliation
제주대학교 대학원
Department
대학원 에너지응용시스템학부 전자공학전공
Advisor
Kim Kyung Youn
Table Of Contents
List of Figures xii
List of Tables xviii
1 Introduction 1
1.1 Electrical impedance tomography . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Boundary estimation studies . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.4 Aims and content . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2 Forward problem 11
2.1 Governing equation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.2 Boundary conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.3 Mathematical Electrode models . . . . . . . . . . . . . . . . . . . . . . . 14
2.3.1 Complete electrode model . . . . . . . . . . . . . . . . . . . . . . 15
2.4 Numerical Solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
2.5 Current injection method . . . . . . . . . . . . . . . . . . . . . . . . . . 18
3 Inverse problem 20
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
3.2 Heuristic algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
3.3 Neural network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
4 Heuristic algorithm 23
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
4.2 Gravitational search algorithm . . . . . . . . . . . . . . . . . . . . . . . 24
4.3 Particle Swarm Optimization . . . . . . . . . . . . . . . . . . . . . . . . 29
4.4 Hybrid PSOGSA algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 31
5 PSOGSA tuned DNN 34
5.1 Deep neural network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
5.2 Training of DNN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
5.3 Hyper-parameter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
5.4 Hyper-parameter tuning . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
5.5 Tuning with PSOGSA . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39
6 Bladder boundary reconstruction with GSA 43
6.1 Boundary representation of the bladder . . . . . . . . . . . . . . . . . . 43
6.2 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
6.2.1 Numerical simulation . . . . . . . . . . . . . . . . . . . . . . . . 46
6.2.2 Phantom experiment . . . . . . . . . . . . . . . . . . . . . . . . . 53
6.3 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
7 Defect detection in graphene with PSOGSA 60
7.1 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
7.1.1 Numerical study . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
7.1.2 Experimental study . . . . . . . . . . . . . . . . . . . . . . . . . 77
7.2 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
8 Interlayer boundary estimation by PSOGSA-DNN 82
8.1 Interlayer boundary representation . . . . . . . . . . . . . . . . . . . . . 82
8.2 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
8.3 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
9 Conclusion 98
Summary 100
List of publications 102
Bibliography 104
Degree
Doctor
Publisher
제주대학교 대학원
Appears in Collections:
Faculty of Applied Energy System > Electronic Engineering
공개 및 라이선스
  • 공개 구분공개
  • 엠바고2022-08-18
파일 목록

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.