A Fast MAP Algorithm for 3D Ultrasound

Bayesian methods have been avoided in 3D ultrasound. The multiplicative type of noise which corrupts ultrasound images leads to slow reconstruction procedures if Bayesian principles are used. Heuristic approaches have been used instead in practical applications. This paper tries to overcome this difficulty by proposing an algorithm which is derived from sound theoretical principles and fast. This algorithm is based on the expansion of the noise probability density function as a Taylor series, un the vicinity of the maximum likelihood estimates, leading to a linear set of equations which are easily solved by standard techniques. Reconstruction examples with synthetic and medical data are provided to evaluate the proposed algorithm.

[1]  João M. Sanches,et al.  A Rayleigh reconstruction/interpolation algorithm for 3D ultrasound , 2000, Pattern Recognit. Lett..

[2]  Stan Z. Li,et al.  Close-Form Solution and Parameter Selection for Convex Minimization-Based Edge-Preserving Smoothing , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  T. Nelson,et al.  Three‐dimensional ultrasound , 1999, Ultrasound in obstetrics & gynecology : the official journal of the International Society of Ultrasound in Obstetrics and Gynecology.

[4]  J. Besag On the Statistical Analysis of Dirty Pictures , 1986 .

[5]  Robert Rohling,et al.  A comparison of freehand three-dimensional ultrasound reconstruction techniques , 1999, Medical Image Anal..

[6]  G. Herman,et al.  Discrete tomography : foundations, algorithms, and applications , 1999 .

[7]  C. Burckhardt Speckle in ultrasound B-mode scans , 1978, IEEE Transactions on Sonics and Ultrasonics.

[8]  José M. N. Leitão,et al.  Wall position and thickness estimation from sequences of echocardiographic images , 1996, IEEE Trans. Medical Imaging.

[9]  J. U. Quistgaard,et al.  Signal acquisition and processing in medical diagnostic ultrasound , 1997, IEEE Signal Process. Mag..