Search:
Computing and Library Services - delivering an inspiring information environment

Robust three-dimensional best-path phase-unwrapping algorithm that avoids singularity loops

Abdul-Rahman, Hussein S., Arevalillo-Herráez, Miguel, Gdeisat, Munther, Burton, David, Lalor, Michael, Lilley, Francis, Moore, Christopher, Sheltraw, Daniel and Qudeisat, Mohammed (2009) Robust three-dimensional best-path phase-unwrapping algorithm that avoids singularity loops. Applied Optics, 48 (23). pp. 4582-4596. ISSN 0003-6935

[img] PDF - Published Version
Download (1977kB)

    Abstract

    In this paper we propose a novel hybrid three-dimensional phase-unwrapping algorithm, which we refer to here as the three-dimensional best-path avoiding singularity loops (3DBPASL) algorithm. This algorithm combines the advantages and avoids the drawbacks of two well-known 3D phase-unwrapping algorithms, namely, the 3D phase-unwrapping noise-immune technique and the 3D phase-unwrapping best-path technique. The hybrid technique presented here is more robust than its predecessors since it not only follows a discrete unwrapping path depending on a 3D quality map, but it also avoids any singularity loops that may occur in the unwrapping path. Simulation and experimental results have shown that the proposed algorithm outperforms its parent techniques in terms of reliability and robustness.

    Item Type: Article
    Additional Information: © 2007 Optical Society of America
    Subjects: Q Science > QA Mathematics
    Q Science > QA Mathematics > QA76 Computer software
    T Technology > T Technology (General)
    Schools: School of Computing and Engineering
    Depositing User: Hussein Abdul-Rahman
    Date Deposited: 02 Oct 2012 15:50
    Last Modified: 02 Oct 2012 16:08
    URI: http://eprints.hud.ac.uk/id/eprint/14954

    Document Downloads

    Downloader Countries

    More statistics for this item...

    Item control for Repository Staff only:

    View Item

    University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©