Please use this identifier to cite or link to this item:
Title: CAPE: combinatorial absolute phase estimation
Authors: Valadão, Gonçalo
Bioucas-Dias, José
Keywords: Image processing
Imaging systems
Magnetic resonance imaging
Phase estimation
Phase unwrapping
Synthetic aperture radar
Issue Date: 2009
Publisher: Optical Society of America
Citation: G. Valadão and J Bioucas-Dias, "CAPE: Combinatorial absolute phase estimation", Journal of the Optical Society of America A, vol. 26, no. 9, pp. 2093-2106, 2009.
Abstract: An absolute phase estimation algorithm for interferometric applications is introduced. The approach is Bayesian. Besides coping with the 2π-periodic sinusoidal nonlinearity in the observations, the proposed methodology assumes a first-order Markov random field prior and a maximum a posteriori probability (MAP) viewpoint. For computing the MAP solution, we provide a combinatorial suboptimal algorithm that involves a multiprecision sequence. In the coarser precision, it unwraps the phase by using, essentially, the previously introduced PUMA algorithm [IEEE Trans. Image Proc. 16, 698 (2007) ], which blindly detects discontinuities and yields a piecewise smooth unwrapped phase. In the subsequent increasing precision iterations, the proposed algorithm denoises each piecewise smooth region, thanks to the previously detected location of the discontinuities. For each precision, we map the problem into a sequence of binary optimizations, which we tackle by computing min-cuts on appropriate graphs. This unified rationale for both phase unwrapping and denoising inherits the fast performance of the graph min-cuts algorithms. In a set of experimental results, we illustrate the effectiveness of the proposed approach.
Peer Reviewed: yes
ISSN: 1520-8532
Appears in Collections:DCT - Artigos/Papers

Files in This Item:
File Description SizeFormat 
JOSA09_CAPE.pdf1,54 MBAdobe PDFView/Open

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis Logotipo do Orcid 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.