Please use this identifier to cite or link to this item: http://hdl.handle.net/11144/3718
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBioucas-Dias, José-
dc.contributor.authorValadão, Gonçalo-
dc.date.accessioned2018-04-13T14:50:26Z-
dc.date.available2018-04-13T14:50:26Z-
dc.date.issued2007-
dc.identifier.citationJ. Bioucas-Dias and G. Valadão, "Phase unwrapping via graph cuts", IEEE Transactions on Image processing, vol. 16, no. 3, pp. 698-709, 2007.por
dc.identifier.issn1057-7149-
dc.identifier.urihttp://hdl.handle.net/11144/3718-
dc.description.abstractPhase unwrapping is the inference of absolute phase from modulo-2pi phase. This paper introduces a new energy minimization framework for phase unwrapping. The considered objective functions are first-order Markov random fields. We provide an exact energy minimization algorithm, whenever the corresponding clique potentials are convex, namely for the phase unwrapping classical Lp norm, with pges1. Its complexity is KT(n,3n), where K is the length of the absolute phase domain measured in 2pi units and T(n,m) is the complexity of a max-flow computation in a graph with n nodes and m edges. For nonconvex clique potentials, often used owing to their discontinuity preserving ability, we face an NP-hard problem for which we devise an approximate solution. Both algorithms solve integer optimization problems by computing a sequence of binary optimizations, each one solved by graph cut techniques. Accordingly, we name the two algorithms PUMA, for phase unwrapping max-flow/min-cut. A set of experimental results illustrates the effectiveness of the proposed approach and its competitiveness in comparison with state-of-the-art phase unwrapping algorithmspor
dc.language.isoengpor
dc.publisherIEEEpor
dc.rightsopenAccesspor
dc.subjectPhase unwrappingpor
dc.subjectenergy minimizationpor
dc.subjectinteger optimizationpor
dc.subjectInSARpor
dc.subjectMRIpor
dc.subjectgraph cutspor
dc.subjectsubmodularitypor
dc.subjectdiscontinuity preservabilitypor
dc.subjectcomputed imagepor
dc.titlePhase Unwrapping via Graph Cutspor
dc.typearticlepor
degois.publication.firstPage698por
degois.publication.lastPage709por
degois.publication.issue9por
degois.publication.titleIEEE Transactions on Image Processingpor
degois.publication.volume15por
dc.peerreviewedyespor
Appears in Collections:DCT - Artigos/Papers

Files in This Item:
File Description SizeFormat 
Phase.pdf673,89 kBAdobe PDFThumbnail
View/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.