Four-dimensional computational ultrasound imaging of brain hemodynamics.

Four-dimensional ultrasound imaging of complex biological systems such as the brain is technically challenging because of the spatiotemporal sampling requirements. We present computational ultrasound imaging (cUSi), an imaging method that uses complex ultrasound fields that can be generated with simple hardware and a physical wave prediction model to alleviate the sampling constraints. cUSi allows for high-resolution four-dimensional imaging of brain hemodynamics in awake and anesthetized mice.

Learning-based method for k-space trajectory design in MRI.

Variable density sampling of the k-space in MRI is an integral part of trajectory design. It has been observed that data-driven trajectory design methods provide a better image reconstruction as compared to trajectories obtained from a fixed or a parametric density function. In this paper, a data-driven strategy has been proposed to obtain non-Cartesian continuous k-space sampling trajectories for MRI under the compressed sensing framework (greedy non-Cartesian (GNC)). A stochas-tic version of the algorithm (stochastic greedy non-Cartesian (SGNC)) is also proposed that reduces the computation time. We compare the proposed trajectory with a traveling salesman problem (TSP)-based trajectory and an echo planar imaging-like trajectory obtained by a greedy method called stochastic greedy-Cartesian (SGC) algorithm. The training images are taken from knee images of the fastMRI dataset. It is observed that the proposed algorithms outperform the TSP-based and the SGC trajectories for similar read-out times.

Towards a general framework for fast and feasible k-space trajectories for MRI based on projection methods.

The design of feasible trajectories to traverse the k-space for sampling in magnetic resonance imaging (MRI) is important while considering ways to reduce the scan time. Over the recent years, non-Cartesian trajectories have been observed to result in benign artifacts and being less sensitive to motion. In this paper, we propose a generalized framework that encompasses projection-based methods to generate feasible non-Cartesian k-space trajectories. This framework allows to construct feasible trajectories from both random or structured initial trajectories, e.g., based on the traveling salesman problem (TSP). We evaluate the performance of the proposed methods by simulating the reconstruction of 128 × 128 and 256 × 256 phantom and brain MRI images in terms of structural similarity (SSIM) index and peak signal-to-noise ratio (PSNR) using compressed sensing techniques. It is observed that the TSP-based trajectories from the proposed projection method with constant acceleration parameterization (CAP) result in better reconstruction compared to the projection method with constant velocity parameterization (CVP) and this for a similar read-out time. Further, random-like trajectories are observed to be better than TSP-based trajectories as they reduce the read-out time while providing better reconstruction quality. A reduction in read-out time by upto 67% is achieved using the proposed projection with permutation (PP) method.

Time-domain oversampled orthogonal signal-division multiplexing underwater acoustic communications.

Orthogonal signal-division multiplexing (OSDM) is a recently emerging modulation scheme which, compared to conventional orthogonal frequency-division multiplexing, can effectively lower the peak-to-average power ratio and introduce intra-vector frequency diversity. In this paper, a time-domain oversampled OSDM system for underwater acoustic (UWA) communications is designed, where each OSDM vector is equivalently transmitted over multiple virtual channels, and thus an enhanced frequency diversity gain can be achieved. Moreover, at the receiver, zero vectors and frequency-shifted Chu sequences are used for Doppler compensation and channel estimation, respectively, while low-complexity per-vector equalization is performed based on the composite channel matrix factorization. Finally, the performance of the proposed OSDM system is evaluated through both numerical simulations and a short-range field experiment, and its effectiveness over time-varying UWA channels is confirmed.

Spatio-Temporal Field Estimation Using Kriged Kalman Filter (KKF) with Sparsity-Enforcing Sensor Placement.

We propose a sensor placement method for spatio-temporal field estimation based on a kriged Kalman filter (KKF) using a network of static or mobile sensors. The developed framework dynamically designs the optimal constellation to place the sensors. We combine the estimation error (for the stationary as well as non-stationary component of the field) minimization problem with a sparsity-enforcing penalty to design the optimal sensor constellation in an economic manner. The developed sensor placement method can be directly used for a general class of covariance matrices (ill-conditioned or well-conditioned) modelling the spatial variability of the stationary component of the field, which acts as a correlated observation noise, while estimating the non-stationary component of the field. Finally, a KKF estimator is used to estimate the field using the measurements from the selected sensing locations. Numerical results are provided to exhibit the feasibility of the proposed dynamic sensor placement followed by the KKF estimation method.

Compressive 3D ultrasound imaging using a single sensor.

Three-dimensional ultrasound is a powerful imaging technique, but it requires thousands of sensors and complex hardware. Very recently, the discovery of compressive sensing has shown that the signal structure can be exploited to reduce the burden posed by traditional sensing requirements. In this spirit, we have designed a simple ultrasound imaging device that can perform three-dimensional imaging using just a single ultrasound sensor. Our device makes a compressed measurement of the spatial ultrasound field using a plastic aperture mask placed in front of the ultrasound sensor. The aperture mask ensures that every pixel in the image is uniquely identifiable in the compressed measurement. We demonstrate that this device can successfully image two structured objects placed in water. The need for just one sensor instead of thousands paves the way for cheaper, faster, simpler, and smaller sensing devices and possible new clinical applications.

Space-frequency coded orthogonal signal-division multiplexing over underwater acoustic channels.

Orthogonal signal-division multiplexing (OSDM) is a newly emerged modulation scheme which provides a generalized framework unifying conventional orthogonal frequency-division multiplexing (OFDM) and single-carrier frequency domain equalization. In this letter, a space-frequency block coding (SFBC) scheme based on OSDM is proposed for time-varying underwater acoustic channels. The receiver processing includes Doppler compensation, channel estimation, space-frequency decoding, and equalization. Simulation and experimental results demonstrate its superiority over the existing SFBC-OFDM counterpart.

Ranging in an underwater medium with multiple isogradient sound speed profile layers.

In this paper, we analyze the problem of acoustic ranging between sensor nodes in an underwater environment. The underwater medium is assumed to be composed of multiple isogradient sound speed profile (SSP) layers where in each layer the sound speed is linearly related to the depth. Furthermore, each sensor node is able to measure its depth and can exchange this information with other nodes. Under these assumptions, we first show how the problem of underwater localization can be converted to the traditional range-based terrestrial localization problem when the depth information of the nodes is known a priori. Second, we relate the pair-wise time of flight (ToF) measurements between the nodes to their positions. Next, based on this relation, we propose a novel ranging algorithm for an underwater medium. The proposed ranging algorithm considers reflections from the seabed and sea surface. We will show that even without any reflections, the transmitted signal may travel through more than one path between two given nodes. The proposed algorithm analyzes them and selects the fastest one (first arrival path) based on the measured ToF and the nodes' depth measurements. Finally, in order to evaluate the performance of the proposed algorithm we run several simulations and compare the results with other existing algorithms.