A way to reduce the artifacts caused by intensely absorbing areas in computed tomography

Чукалина М. В.; A. Ingacheva; Прун В. Е.; Бузмаков А. В.; Николаев Д. П.

doi:527-531

?

A way to reduce the artifacts caused by intensely absorbing areas in computed tomography

Чукалина М. В., Ingacheva A., Прун В. Е., Бузмаков А. В., Николаев Д. П.

Artifacts caused by intensely absorbing areas are encountered in computed tomography and may obscure or simulate pathology in medical applications, hide or mimic the cracks and cavities in the devices at industrial applications. We simulated sinograms with different levels of absorption to demonstrate the artifacts dynamics. If the analysis of the measured data shows the presence of strongly absorbing areas in the object under study we propose to use quadratic programming technique for solving the inverse problem. Although the technique is time-consuming it allows us to avoid the typical artifacts. We compare the images reconstructed with different techniques including the proposed one. ©ECMS Valeri M. Mladenov, Petia Georgieva, Grisha Spasov, Galidiya Petrova (Editors).

Keywords: Quadratic programming Algebraic reconstruction technique Computed tomography Metal and metal-like artifacts

In book

Proceedings - 29th European Conference on Modelling and Simulation, ECMS 2015

Albena, Varna: [б.и.], 2015.

Восстановление трехмерной геометрии сосудов по данным компьютерной томографии

Chepovskiy A., Борисенко В. В., Серова Н. С., Вестник Новосибирского государственного университета. Серия: Информационные технологии 2019 Т. 17 № 3 С. 5–17

Рассматриваются алгоритмы построения триангуляции внутренней поверхности коронарных артерий сердца по данным компьютерной томографии. Точное определение геометрии сосудов необходимо для построения гидродинамической модели кровоснабжения сердца и расчета параметров кровотока с помощью уравнений Навье– Стокса. Для восстановления трехмерной геометрии применяется комбинация двух основных методов: трехмерного алгоритма роста области из семени и ячеечного метода, использующего разбиение пространства на тетраэдры. При этом используется тетраэдрическая ...

Added: October 22, 2019

Анализ внутрисосудистого градиента ослабления контрастирования коронарных артерий методом компьютерной томографии при отсутствии стенотического поражения коронарного русла.

Chepovskiy A., Терновой С. К., Веселова Т. Н. et al., Russian Electronic Journal of Radiology 2019 Т. 9 № 3 С. 58–64

Purpose: Determination of transluminal attenuation gradient (TAG) in intact cor onary arteries ...

Added: October 7, 2019

Automatic beam hardening correction for CT reconstruction

Ingacheva A., Чукалина М. В., Николаев Д. П. et al., , in: Proceedings - 31th European Conference on Modelling and Simulation, ECMS 2017.: [б.и.], 2017.

In computed tomography (CT) the quality of reconstructed images depends on several reasons: the quality of the set-up calibration; precision of the mathematical model, used in the reconstruction procedure; the reconstruction technique used; quality of the numerical implementation of the reconstruction algorithm. Most of fast reconstruction algorithms use the X-ray monochromaticity assumption. If we apply ...

Added: October 27, 2017

An Edge Detection using 2D Gaussian Function in Computed Tomography

Knas M., Cierniak R., Rebrova O., , in: Lecture Notes in Computer Science, V. 9119, 2015, Artificial Intelligence and Soft Computing.: Springer, 2015. P. 586–593.

In this paper, we propose an iterative algorithm for edge detection. The presented method uses a 2D Gaussian function and Prewitt operator. Firstly, the selection of edge points has been achieved by a statistical method. Secondly, the boundary tracking has been performed by the rotation of the Gaussian function and by changing function's variables. The ...

Added: October 15, 2016

The clique problem for graphs with a few eigenvalues of the same sign

Malyshev D., Pardalos P. M., Optimization Letters 2015 Vol. 9 No. 5 P. 839–843

The quadratic programming problem is known to be NP-hard for Hessian matrices with only one negative eigenvalue, but it is tractable for convex instances. These facts yield to consider the number of negative eigenvalues as a complexity measure of quadratic programs. We prove here that the clique problem is tractable for two variants of its Motzkin-Strauss ...

Added: September 26, 2014

Robust optimization of graph partitioning involving interval uncertainty

Fana N., Zhengb Q. P., Pardalos P. M., Theoretical Computer Science 2012 Vol. 447 P. 53–61

The graph partitioning problem is to partition the vertex set of a graph into a number of nonempty subsets so that the total weight of edges connecting distinct subsets is minimized. Previous research requires the input of cardinalities of subsets or the number of subsets for equipartition. In this paper, the problem is formulated as ...

Added: December 31, 2012