A METHOD FOR COMPARATIVE-EVALUATION OF EIT ALGORITHMS USING A STANDARD DATA SET

Date

1995-08-01

Author

IDER, YZ
EYUBOGLU, BM
KUZUOGLU, M
Leblebicioğlu, Mehmet Kemal
BAYSAL, U
CAGLAR, BK
BIRGUL, O

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

208
views

0
downloads

The point spread function (PSF) is the most widely used tool for quantifying the spatial resolution of imaging systems. However, prerequisites for the proper use of this tool are linearity and space invariance. Because EIT is non-linear it is only possible to compare different reconstruction algorithms using a standard data set. In this study, the FEM is used to generate simulation data, which are used to investigate the non-linear behaviour of EIT, the space dependence of its PSF and its capability of resolving nearby objects. It is found that for the case of iterative backprojection (IterB), the full width half maximum (FWHM) values of single-object perturbations for central, intermediate and peripheral high-contrast objects are 27%, 18% and 14% of the imaging region diameter respectively. For the method based on singular value decomposition of the Geselowitz lead sensitivity matrix (GS-SVD), the FWHM is not space dependent and is 12% of the imaging region diameter. Conclusions obtained using single-object PSF studies must also be checked with double-object or more complex perturbations because EIT is non-linear. For example, the GS-SVD method fails to detect two widely separated objects unless the truncation level of SVD is carefully adjusted. With more truncation, however, the resolution of the method is worsened. Based on these and similar observations a set of simulation data, which is proposed for comparative evaluation of different EIT algorithms, is specified and explained in the conclusion section.

Subject Keywords

Biophysics, Physiology (medical), Physiology, Biomedical Engineering

URI

https://hdl.handle.net/11511/45862

Journal

PHYSIOLOGICAL MEASUREMENT

DOI

https://doi.org/10.1088/0967-3334/16/3a/021

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

A FAST IMAGE-RECONSTRUCTION ALGORITHM FOR ELECTRICAL-IMPEDANCE TOMOGRAPHY Kuzuoğlu, Mustafa; Leblebicioğlu, Mehmet Kemal (IOP Publishing, 1994-05-01) In this paper, we propose a fast algorithm for the reconstruction of the conductivity perturbation DELTAsigma about a known conductivity variation sigma0. The method is based on the minimization of a quadratic functional subject to linear constraints, where the existence of a unique solution is guaranteed. The algorithm developed for this purpose is iterative and each iteration is composed of a simple matrix multiplication. The validity of this method is illustrated with several examples.
DETERMINATION OF OPTIMUM INJECTED CURRENT PATTERNS IN ELECTRICAL-IMPEDANCE TOMOGRAPHY KOKSAL, A; Eyüboğlu, Behçet Murat (IOP Publishing, 1995-08-01) The problem of finding the optimum current under different constraints in electrical impedance tomography is cast into a non-linear optimization problem. Optimum currents are investigated for a two-dimensional cylindrical body with a concentric or an eccentric inhomogeneity under the constraints of constant dissipated power and constant total injected current. For a concentric inhomogeneity, it is shown that the opposite drive results in a better distinguishability than the cosine current pattern under the ...
ANALYTIC AND SEMIANALYTIC SOLUTIONS IN ELECTRICAL-IMPEDANCE TOMOGRAPHY .1. 2-DIMENSIONAL PROBLEMS PIDCOCK, MK; Kuzuoğlu, Mustafa; Leblebicioğlu, Mehmet Kemal (IOP Publishing, 1995-05-01) We give analytic and semi-analytic solutions to a number of problems which are related to the image reconstruction problem of electrical impedance tomography (EIT) in two dimensions.
An algorithm for line matching in an image by mapping into an n-dimensional vector space Sultanov, Raiymbek; Atakan, Ahmet; Ismailova, Rita (2019-01-01) This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplifi...
A Partition Based Method for Spectrum-Preserving Mesh Simplification Yazgan, Misranur; Sahillioğlu, Yusuf; Department of Computer Engineering (2022-8-29) When the complexity of a mesh starts introducing high computational costs, mesh simplification methods come into the picture, to reduce the number of elements utilized to represent the mesh. Majority of the simplification methods focus on preserving the appearance of the mesh, ignoring the spectral properties of the differential operators derived from the mesh. The spectrum of the Laplace-Beltrami operator is essential for a large subset of applications in geometry processing. Coarsening a mesh without cons...

Citation Formats

Y. IDER et al., “A METHOD FOR COMPARATIVE-EVALUATION OF EIT ALGORITHMS USING A STANDARD DATA SET,” PHYSIOLOGICAL MEASUREMENT, pp. 0–0, 1995, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/45862.