Fraunhofer-Gesellschaft

Publica

Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Subsampling Approaches for Compressed Sensing with Ultrasound Arrays in Non-Destructive Testing

 
: Pérez, Eduardo; Kirchhof, Jan; Krieg, Fabian; Römer, Florian

:
Volltext urn:nbn:de:0011-n-6157131 (857 KByte PDF)
MD5 Fingerprint: cf51713514de398c5cbf5d2249e6fd32
(CC) by
Erstellt am: 3.12.2020


Sensors. Online journal 20 (2020), Nr.23, Art. 6734, 23 S.
http://www.mdpi.com/journal/sensors
ISSN: 1424-8220
ISSN: 1424-8239
ISSN: 1424-3210
Deutsche Forschungsgemeinschaft DFG
GA 2062/5-1; CoSMaDU
Fraunhofer-Gesellschaft FhG
025-601128; ATTRACT
Englisch
Zeitschriftenaufsatz, Elektronische Publikation
Fraunhofer IZFP ()
full matrix capture; Compressed Sensing (CS); sparse array

Abstract
Full Matrix Capture is a multi-channel data acquisition method which enables flexible, high resolution imaging using ultrasound arrays. However, the measurement time and data volume are increased considerably. Both of these costs can be circumvented via compressed sensing, which exploits prior knowledge of the underlying model and its sparsity to reduce the amount of data needed to produce a high resolution image. In order to design compression matrices that are physically realizable without sophisticated hardware constraints, structured subsampling patterns are designed and evaluated in this work. The design is based on the analysis of the Cramér–Rao Bound of a single scatterer in a homogeneous, isotropic medium. A numerical comparison of the point spread functions obtained with different compression matrices and the Fast Iterative Shrinkage/Thresholding Algorithm shows that the best performance is achieved when each transmit event can use a different subset of receiving elements and each receiving element uses a different section of the echo signal spectrum. Such a design has the advantage of outperforming other structured patterns to the extent that suboptimal selection matrices provide a good performance and can be efficiently computed with greedy approaches.

: http://publica.fraunhofer.de/dokumente/N-615713.html