Abstract
Although a variety of techniques have been developed to reduce the appearance of B-mode speckle, quantitative ultrasound (QUS) aims at extracting the hidden properties of the tissue. Herein, we propose two novel techniques to accurately and precisely estimate two important QUS parameters, namely, the average attenuation coefficient and the backscatter coefficient. Both the techniques optimize a cost function that incorporates data and continuity constraint terms, which we call AnaLytical Global rEgularized BackscatteR quAntitative ultrasound (ALGEBRA). We propose two versions of ALGEBRA, namely, 1-D- and 2-D-ALGEBRA. In 1-D-ALGEBRA, the regularized cost function is formulated in the axial direction, and the QUS parameters are calculated for one line of radio frequency (RF) echo data. In 2-D-ALGEBRA, the regularized cost function is formulated for the entire image, and the QUS parameters throughout the image are estimated simultaneously. This simultaneous optimization allows 2-D-ALGEBRA to "see" all the data before estimating the QUS parameters. In both the methods, we efficiently optimize the cost functions by casting it as a sparse linear system of equations. As a result of this efficient optimization, 1-D-ALGEBRA and 2-D-ALGEBRA are, respectively, 600 and 300 times faster than optimization using the dynamic programming (DP) method previously proposed by our group. In addition, the proposed technique has fewer input parameters that require manual tuning. Our results demonstrate that the proposed ALGEBRA methods substantially outperform least-square and DP methods in estimating the QUS parameters in phantom experiments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.