Ultrafast Ultrasound Imaging

Among medical imaging modalities, such as computed tomography (CT) and magnetic resonance imaging (MRI), ultrasound imaging stands out due to its temporal resolution. Owing to the nature of medical ultrasound imaging, it has been used for not only observation of the morphology of living organs but also functional imaging, such as blood flow imaging and evaluation of the cardiac function. Ultrafast ultrasound imaging, which has recently become widely available, significantly increases the opportunities for medical functional imaging. Ultrafast ultrasound imaging typically enables imaging frame-rates of up to ten thousand frames per second (fps). Due to the extremely high temporal resolution, this enables visualization of rapid dynamic responses of biological tissues, which cannot be observed and analyzed by conventional ultrasound imaging. This Special Issue includes various studies of improvements to the performance of ultrafast ultrasoun

Fast Meta Learning for Adaptive Beamforming

This paper studies the deep learning based adaptive downlink beamforming solution for the signal-to-interference-plus-noise ratio balancing problem. Adaptive beamforming is an important approach to enhance the performance in dynamic wireless environments in which testing channels have different distributions from training channels. We propose an adaptive method to achieve fast adaptation of beamforming based on the principle of meta learning. Specifically, our method first learns an embedding model by training a deep neural network as a transferable feature extractor. In the adaptation stage, it fits a support vector regression model using the extracted features and testing data of the new environment. Simulation results demonstrate that compared to the state of the art meta learning method, our proposed algorithm reduces the complexities in both training and adaptation processes by more than an order of magnitude, while achieving better adaptation performance

Approximate Kernel Orthogonalization for Antenna Array Processing

We present a method for kernel antenna array processing using Gaussian kernels as basis functions. The method first identifies the data clusters by using a modified sparse greedy matrix approximation. Then, the algorithm performs model reduction in order to try to reduce the final size of the beamformer. The method is tested with simulations that include two arrays made of two and seven printed half wavelength thick dipoles, in scenarios with 4 and 5 users coming from different angles of arrival. The antenna parameters are simulated for all DOAs, and include the dipole radiation pattern and the mutual coupling effects of the array. The method is compared with other state-of-the-art nonlinear processing methods, to show that the presented algorithm has near optimal capabilities together with a low computational burden.Spanish Governnment under Grant TEC2008-02473IEEE Antennas and Propagation SocietyPublicad