Login | Register

Clutter suppression in ultrasound: performance evaluation and review of low-rank and sparse matrix decomposition methods

Title:

Clutter suppression in ultrasound: performance evaluation and review of low-rank and sparse matrix decomposition methods

Zhang, Naiyuan, Ashikuzzaman, Md and Rivaz, Hassan (2020) Clutter suppression in ultrasound: performance evaluation and review of low-rank and sparse matrix decomposition methods. BioMedical Engineering OnLine, 19 (1). ISSN 1475-925X

[img]
Preview
Text (Publisher's Version) (application/pdf)
s12938-020-00778-z.pdf - Published Version
Available under License Creative Commons Attribution.
3MB
[img]
Preview
Other (Publisher's Version) (application/pdf)
12938_2020_778_MOESM1_ESM.pdf - Supplemental Material
Available under License Creative Commons Public Domain Dedication.
101kB

Official URL: https://doi.org/10.1186/s12938-020-00778-z

Abstract

Vessel diseases are often accompanied by abnormalities related to vascular shape and size. Therefore, a clear visualization of vasculature is of high clinical significance. Ultrasound color flow imaging (CFI) is one of the prominent techniques for flow visualization. However, clutter signals originating from slow-moving tissue are one of the main obstacles to obtain a clear view of the vascular network. Enhancement of the vasculature by suppressing the clutters is a significant and irreplaceable step for many applications of ultrasound CFI. Currently, this task is often performed by singular value decomposition (SVD) of the data matrix. This approach exhibits two well-known limitations. First, the performance of SVD is sensitive to the proper manual selection of the ranks corresponding to clutter and blood subspaces. Second, SVD is prone to failure in the presence of large random noise in the dataset. A potential solution to these issues is using decomposition into low-rank and sparse matrices (DLSM) framework. SVD is one of the algorithms for solving the minimization problem under the DLSM framework. Many other algorithms under DLSM avoid full SVD and use approximated SVD or SVD-free ideas which may have better performance with higher robustness and less computing time. In practice, these models separate blood from clutter based on the assumption that steady clutter represents a low-rank structure and that the moving blood component is sparse. In this paper, we present a comprehensive review of ultrasound clutter suppression techniques and exploit the feasibility of low-rank and sparse decomposition schemes in ultrasound clutter suppression. We conduct this review study by adapting 106 DLSM algorithms and validating them against simulation, phantom, and in vivo rat datasets. Two conventional quality metrics, signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR), are used for performance evaluation. In addition, computation times required by different algorithms for generating clutter suppressed images are reported. Our extensive analysis shows that the DLSM framework can be successfully applied to ultrasound clutter suppression.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Electrical and Computer Engineering
Item Type:Article
Refereed:Yes
Authors:Zhang, Naiyuan and Ashikuzzaman, Md and Rivaz, Hassan
Journal or Publication:BioMedical Engineering OnLine
Date:28 May 2020
Funders:
  • Natural Sciences and Engineering Research Council of Canada (NSERC)
  • Concordia Open Access Author Fund
Digital Object Identifier (DOI):10.1186/s12938-020-00778-z
Keywords:Ultrasound color flow imaging, Clutter suppression, Vessel visualization, Low-rank and sparse matrix decomposition
ID Code:988025
Deposited By: JOSHUA CHALIFOUR
Deposited On:26 Feb 2021 20:41
Last Modified:26 Feb 2021 20:41
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top