Sorry, you need to enable JavaScript to visit this website.

There is growing interest in the use of deep neural network
(DNN) based image denoising to reduce patient’s X-ray
dosage in medical computed tomography (CT). An effective
denoiser must remove noise while maintaining the texture
and detail. Commonly used mean squared error (MSE) loss
functions in the DNN training weight errors due to bias and
variance equally. However, the error due to bias is often more
egregious since it results in loss of image texture and detail.
In this paper, we present a novel approach to designing a loss

In this paper, we present a novel Image Fusion Model
(IFM) for ECG heart-beat classification to overcome the
weaknesses of existing machine learning techniques that rely
either on manual feature extraction or direct utilization of 1D
raw ECG signal. At the input of IFM, we first convert the
heart-beats of ECG into three different images using Gramian
Angular Field (GAF), Recurrence Plot (RP) and Markov
Transition Field (MTF) and then fuse these images to create

Conventional Computed Tomography (CT) systems use a single X-ray source and an arc of detectors mounted on a rotating gantry to acquire a set of projection data. Novel CT systems are now being pioneered in which a complete ring of distributed X-ray sources and detectors are electronically turned on and off, without any mechanical motion, to acquire a set of projections for tomographic reconstruction. This paper discusses new sensing and reconstruction paradigms enabled by this new CT architecture.

The development of compressed sensing (CS) techniques for magnetic resonance imaging (MRI) is enabling a speedup of MRI scanning. To increase the incoherence in the sampling, a random selection of points on the k-space is deployed and a continuous trajectory is obtained by solving a traveling salesman problem (TSP) through these points. A feasible trajectory satisfying the gradient constraints is then obtained by parameterizing it using state-of-the-art methods. In this paper, a constrained convex optimization based method to obtain feasible trajectories is proposed.

A novel class of k-space trajectories for magnetic resonance imaging (MRI) sampling using space-filling curves (SFCs) is presented here. More specifically, Peano, Hilbert and Sierpinski curves are used. We propose 1-shot and 4-shot variable density SFCs by utilizing the space coverage provided by SFCs in different iterations. The proposed trajectories are compared with state-of-the-art echo-planar imaging (EPI) trajectories for 128 × 128 and 256 × 256 phantom and brain images.

Transcranial magnetic stimulation (TMS) is a non-invasive clinical technique used for treatment of several neurological diseases such as depression, Alzheimer’s disease and Parkinson’s disease. However, it is always challenging to accurately adjust the electric field on different specific brain regions due to the requirement of several stimulation parameters’ optimizations.