By Topic

Maximum likelihood estimation of object location in diffraction tomography

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Devaney, A.J. ; Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA ; Tsihrintzis, G.A.

The problem is formulated within the context of diffraction tomography, where the complex phase of the diffracted wavefield is modeled using the Rytov approximation and the measurements consist of noisy renditions of this complex phase at a single frequency. The log likelihood function is computed for the case of additive zero mean Gaussian white noise and shown to be expressible in the form of the filtered backpropagation algorithm of diffraction tomography. In this form however, the filter function is no longer the rho filter appropriate to least square reconstruction but is now the generalized projection (propagation) of the object (centered at the origin) onto the line(s) parallel to the measurement line(s), but passing through the origin. This result allows the estimation problem to be solved via a diffraction tomographic imaging procedure where the noisy data is filtered and backpropagated in a first step, and the point of maximum value of the resulting image is then the maximum likelihood (ML) estimate of the object's location. The authors include a calculation of the Cramer-Rao bound for the estimation error and a computer simulation study illustrating the estimation procedure

Published in:

Signal Processing, IEEE Transactions on  (Volume:39 ,  Issue: 3 )