Invasive cardiac catheterisation is a precursor to ablation therapy for ventricular tachycardia. Invasive cardiac diagnostics are fraught with risks. Decades of research has been conducted on the inverse problem of electrocardiography, which can be used to reconstruct Heart Surface Potentials (HSPs) from Body Surface Potentials (BSPs), for non-invasive cardiac diagnostics. State of the art solutions to the inverse problem are unsatisfactory, since the inverse problem is known to be ill-posed. In this paper we propose a novel approach to reconstructing HSPs from BSPs using a Time-Delay Artificial Neural Network (TDANN). We first design the TDANN architecture, and then develop an iterative search space algorithm to find the parameters of the TDANN, which results in the best overall HSP prediction. We use recorded BSPs and HSPs from individuals suffering from serious cardiac conditions to validate our TDANN. The results are encouraging, in that the predicted and recorded HSPs have an average correlation coefficient of 0.7 under diseased conditions.
Recently, machine learning solutions have been proposed to reconstruct HSPs from BSPs. @cite_1 , kernel ridge regression, with a Gaussian kernel, is used to reconstruct HSPs from BSPs. Although performing better than the numerical solutions, the machine learning solution has low correlation with the exact solution. Hence, the activation map of the heart surface potentials is unsatisfactory. Furthermore, none of the techniques consider reconstruction of HSPs under cardiac disease states, therefore, the fidelity of reconstructed activation map, under diseased states is suspect.
@cite_1
1994040806 2891214351 2082304695 2106903293
Hyperspectral images (HSIs) are often degraded by a mixture of various kinds of noise in the acquisition process, which can include Gaussian noise, impulse noise, dead lines, stripes, and so on. This paper introduces a new HSI restoration method based on low-rank matrix recovery (LRMR), which can simultaneously remove the Gaussian noise, impulse noise, dead lines, and stripes. By lexicographically ordering a patch of the HSI into a 2-D matrix, the low-rank property of the hyperspectral imagery is explored, which suggests that a clean HSI patch can be regarded as a low-rank matrix. We then formulate the HSI restoration problem into an LRMR framework. To further remove the mixed noise, the “Go Decomposition” algorithm is applied to solve the LRMR problem. Several experiments were conducted in both simulated and real data conditions to verify the performance of the proposed LRMR-based HSI restoration method. Incorrect ECG gating of cardiac magnetic resonance (CMR) acquisitions can lead to artefacts, which hampers the accuracy of diagnostic imaging. Therefore, there is a need for robust reconstruction methods to ensure high image quality. In this paper, we propose a method to automatically correct motion-related artefacts in CMR acquisitions during reconstruction from k-space data. Our method is based on the Automap reconstruction method, which directly reconstructs high quality MR images from k-space using deep learning. Our main methodological contribution is the addition of an adversarial element to this architecture, in which the quality of image reconstruction (the generator) is increased by using a discriminator. We train the reconstruction network to automatically correct for motion-related artefacts using synthetically corrupted CMR k-space data and uncorrupted reconstructed images. Using 25000 images from the UK Biobank dataset we achieve good image quality in the presence of synthetic motion artefacts, but some structural information was lost. We quantitatively compare our method to a standard inverse Fourier reconstruction. In addition, we qualitatively evaluate the proposed technique using k-space data containing real motion artefacts. Abstract A fundamental step in the diagnosis of cardiovascular diseases, automatic left ventricle (LV) segmentation in cardiac magnetic resonance images (MRIs) is still acknowledged to be a difficult problem. Most of the existing algorithms require either extensive training or intensive user inputs. This study investigates fast detection of the left ventricle (LV) endo- and epicardium surfaces in cardiac MRI via convex relaxation and distribution matching. The algorithm requires a single subject for training and a very simple user input, which amounts to a single point (mouse click) per target region (cavity or myocardium). It seeks cavity and myocardium regions within each 3D phase by optimizing two functionals, each containing two distribution-matching constraints: (1) a distance-based shape prior and (2) an intensity prior. Based on a global measure of similarity between distributions, the shape prior is intrinsically invariant with respect to translation and rotation. We further introduce a scale variable from which we derive a fixed-point equation (FPE), thereby achieving scale-invariance with only few fast computations. The proposed algorithm relaxes the need for costly pose estimation (or registration) procedures and large training sets, and can tolerate shape deformations, unlike template (or atlas) based priors. Our formulation leads to a challenging problem, which is not directly amenable to convex-optimization techniques. For each functional, we split the problem into a sequence of sub-problems, each of which can be solved exactly and globally via a convex relaxation and the augmented Lagrangian method. Unlike related graph-cut approaches, the proposed convex-relaxation solution can be parallelized to reduce substantially the computational time for 3D domains (or higher), extends directly to high dimensions, and does not have the grid-bias problem. Our parallelized implementation on a graphics processing unit (GPU) demonstrates that the proposed algorithm requires about 3.87 s for a typical cardiac MRI volume, a speed-up of about five times compared to a standard implementation. We report a performance evaluation over 400 volumes acquired from 20 subjects, which shows that the obtained 3D surfaces correlate with independent manual delineations. We further demonstrate experimentally that (1) the performance of the algorithm is not significantly affected by the choice of the training subject and (2) the shape description we use does not change significantly from one subject to another. These results support the fact that a single subject is sufficient for training the proposed algorithm. The inverse problem of electrocardiography is solved in order to reconstruct electrical events within the heart from information measured noninvasively on the body surface. These electrical events can be deduced from measured epicardial potentials; therefore, a noninvasive method of recovering epicardial potentials from body surface data is useful in clinical and experimental work. The ill-posed nature of this problem necessitates the use of regularization in the solution procedure. Inversion using Tihonov zero-order regularization, a quasi-static method, had been employed previously and was able to reconstruct, with relatively good accuracy, important events in cardiac excitation (maxima, minima, etc.). Taking advantage of the fact that the process of cardiac excitation is continuous in time, one can incorporate information from the time progression of excitation in the regularization procedure using the Twomey technique. Methods of this type were tested on data obtained from a human-torso tank in which a beating canine heart was placed. The results show a marked improvement in the inverse solution when these temporal methods are used. >