Publications

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication


Year(s) from:  to 
Author:
Keywords (separated by spaces):

Inverse Problem of Ultrasound Beamforming with Sparsity in Time and Frequency Domain

Ece Ozkan and Orcun Goksel
IEEE International Ultrasonics Symposium
September 2016

Abstract

Beamforming is a common signal processing technique to locally focus and enhance the transmitted or received ultrasound (US) energy in a region-of-interest (ROI), which has an important impact on the image quality and controls the resolution and contrast. The most common and the simplest beamforming technique for medical US is the Delay-And-Sum (DAS) beamforming, although adaptive beamforming techniques also exist. Row-based beamforming methods formulate the forward problem for each image row and accordingly solve an inverse problem separately at each image depth. In this work, we propose a full-frame inverse-problem based beamforming method, where we define the forward problem for the entire image and solve an inverse problem for all image depths jointly. We present our results for the reconstruction of the US image using one plane-wave. Results are evaluated on the Plane-wave Imaging Challenge in Medical UltraSound (PICMUS) dataset. CNR and FWHM values for all datasets are shown to improve significantly in comparison to DAS.


Link to publisher's page
Download in pdf format
@InProceedings{eth_biwi_01320,
  author = {Ece Ozkan and Orcun Goksel},
  title = {Inverse Problem of Ultrasound Beamforming with Sparsity in Time and Frequency Domain},
  booktitle = {IEEE International Ultrasonics Symposium},
  year = {2016},
  month = {September},
  keywords = {}
}