CAPE: combinatorial absolute phase estimation

Detalhes bibliográficos
Autor(a) principal: Valadão, Gonçalo
Data de Publicação: 2009
Outros Autores: Bioucas-Dias, José
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/11144/3719
Resumo: 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.
id RCAP_2d0f90b7ccf968860903a26dd1761c44
oai_identifier_str oai:repositorio.ual.pt:11144/3719
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling CAPE: combinatorial absolute phase estimationImage processingImaging systemsMagnetic resonance imagingPhase estimationPhase unwrappingSynthetic aperture radarAn 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.Optical Society of America2018-04-13T14:53:19Z2009-01-01T00:00:00Z2009info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/11144/3719eng1520-85321084-7529Valadão, GonçaloBioucas-Dias, Joséinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-01-11T02:13:39Zoai:repositorio.ual.pt:11144/3719Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T01:32:40.631308Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv CAPE: combinatorial absolute phase estimation
title CAPE: combinatorial absolute phase estimation
spellingShingle CAPE: combinatorial absolute phase estimation
Valadão, Gonçalo
Image processing
Imaging systems
Magnetic resonance imaging
Phase estimation
Phase unwrapping
Synthetic aperture radar
title_short CAPE: combinatorial absolute phase estimation
title_full CAPE: combinatorial absolute phase estimation
title_fullStr CAPE: combinatorial absolute phase estimation
title_full_unstemmed CAPE: combinatorial absolute phase estimation
title_sort CAPE: combinatorial absolute phase estimation
author Valadão, Gonçalo
author_facet Valadão, Gonçalo
Bioucas-Dias, José
author_role author
author2 Bioucas-Dias, José
author2_role author
dc.contributor.author.fl_str_mv Valadão, Gonçalo
Bioucas-Dias, José
dc.subject.por.fl_str_mv Image processing
Imaging systems
Magnetic resonance imaging
Phase estimation
Phase unwrapping
Synthetic aperture radar
topic Image processing
Imaging systems
Magnetic resonance imaging
Phase estimation
Phase unwrapping
Synthetic aperture radar
description 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.
publishDate 2009
dc.date.none.fl_str_mv 2009-01-01T00:00:00Z
2009
2018-04-13T14:53:19Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/11144/3719
url http://hdl.handle.net/11144/3719
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1520-8532
1084-7529
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Optical Society of America
publisher.none.fl_str_mv Optical Society of America
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799136806919208960