Delay Compression: Reducing Delay Calculation Requirements for 3D Plane-Wave Ultrasound

Brendan L. West, Jian Zhou, C. Chakrabarti, T. Wenisch
{"title":"Delay Compression: Reducing Delay Calculation Requirements for 3D Plane-Wave Ultrasound","authors":"Brendan L. West, Jian Zhou, C. Chakrabarti, T. Wenisch","doi":"10.1109/ULTSYM.2019.8925725","DOIUrl":null,"url":null,"abstract":"In 3D plane-wave ultrasound, computational requirements are directly proportional to the number of focal points in a volume. For a receive aperture of size of M<inf>x</inf>M<inf>y</inf> transducers, a beamforming aperture size of N<inf>x</inf>N<inf>y</inf>, and a depth of M<inf>z</inf> focal points, M<inf>x</inf> M<inf>y</inf> M<inf>z</inf> N<inf>x</inf> N<inf>y</inf> round-trip delays must be computed. To reduce this requirement, we decompose the planar transmit distance into two parts: (1) from the plane-wave’s origin to the first point in each focal line, and (2) from the plane when it is touching the first point in each focal line to each subsequent focal point along that line. The latter distance, as well as the reflection distances, are symmetric across beamforming apertures, and thus their computation can be shared. This decomposition results in up to a M<inf>x</inf> M<inf>y</inf> reduction in the number of unique delays while retaining full image quality. Using our technique, precomputing delays and storing them in look-up tables (LUTs) is now possible for 3D plane-wave ultrasound for the first time, opening new doors for computational architectures in this field. Our method works with 2D, 3D, and 3D-separable variants of plane-wave ultrasound.","PeriodicalId":6759,"journal":{"name":"2019 IEEE International Ultrasonics Symposium (IUS)","volume":"42 1","pages":"1278-1281"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Ultrasonics Symposium (IUS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ULTSYM.2019.8925725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In 3D plane-wave ultrasound, computational requirements are directly proportional to the number of focal points in a volume. For a receive aperture of size of MxMy transducers, a beamforming aperture size of NxNy, and a depth of Mz focal points, Mx My Mz Nx Ny round-trip delays must be computed. To reduce this requirement, we decompose the planar transmit distance into two parts: (1) from the plane-wave’s origin to the first point in each focal line, and (2) from the plane when it is touching the first point in each focal line to each subsequent focal point along that line. The latter distance, as well as the reflection distances, are symmetric across beamforming apertures, and thus their computation can be shared. This decomposition results in up to a Mx My reduction in the number of unique delays while retaining full image quality. Using our technique, precomputing delays and storing them in look-up tables (LUTs) is now possible for 3D plane-wave ultrasound for the first time, opening new doors for computational architectures in this field. Our method works with 2D, 3D, and 3D-separable variants of plane-wave ultrasound.
延迟压缩:降低三维平面波超声的延迟计算要求
在三维平面波超声中,计算需求与体积中焦点的数量成正比。对于接收孔径为MxMy的换能器,波束形成孔径为NxNy,焦点深度为Mz的换能器,必须计算MxMy Mz NxNy的往返延迟。为了减少这一要求,我们将平面传播距离分解为两部分:(1)从平面波的原点到每条焦点线上的第一个点,以及(2)从平面接触每条焦点线上的第一个点到沿着该线的每个后续焦点。后一种距离以及反射距离在波束形成孔径之间是对称的,因此它们的计算可以共享。这种分解的结果是在保留完整图像质量的同时,在唯一延迟的数量上减少了Mx - My。使用我们的技术,预计算延迟并将其存储在查找表(lut)中现在首次可以用于3D平面波超声,为该领域的计算架构打开了新的大门。我们的方法适用于二维、三维和三维可分离的平面波超声。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信