Comparison of eight unwrapping algorithms applied to Fourier-transform profilometry

被引:115
|
作者
Zappa, E. [1 ]
Busca, G. [1 ]
机构
[1] Politecn Milan, Dept Mech Engn, I-20133 Milan, Italy
关键词
phase unwrapping; Fourier transform profilometry; fringe analysis;
D O I
10.1016/j.optlaseng.2007.09.002
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Phase unwrapping is a task common to many applications like interferometry imaging, medical magnetic resonance imaging, solid-state physics, etc. Fourier transform profilometry (FTP) values the height distribution of object, elaborating the interference between a plane reference grating and a deformed object grating. Since the height information is extracted from the phase of a complex function, the phase unwrapping is a critical step of the process. Several unwrapping algorithms are proposed in literature, but applied to measurement technologies different from FTP. The purpose of this paper is to define the performances of eight different unwrapping algorithms applied to FTP optical scan method and to define the best one. The algorithms chosen are: Goldstein's algorithm, quality Guided path following method. Mask cut method, Flynn's method, multi-grid method, weighted multi-grid method, preconditioned conjugate gradient method and minimum L-p-norm method. The methods were tested on real images acquired by a FTP scanner developed and calibrated for these experiments. The objects used vary from simple geometries, like planes and cylinders, to complex shapes of common use objects. Algorithms were qualified considering the phase unwrapping errors, execution time and accuracy of the shape of objects obtained from the scan method in comparison with real ones. The results show that quality guided algorithm best fits in FTP application. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:106 / 116
页数:11
相关论文
共 50 条
  • [21] FAST ALGORITHMS FOR THE DISCRETE W TRANSFORM AND FOR THE DISCRETE FOURIER-TRANSFORM
    WANG, ZD
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1984, 32 (04): : 803 - 816
  • [22] Spatially frequency-multiplexed number-theoretic phase unwrapping technique for the Fourier-transform profilometry of objects with height discontinuities and/or spatial isolations
    Takeda, M
    Gu, Q
    Kinoshita, M
    Takai, H
    Takahashi, Y
    LASER INTERFEROMETRY VIII: TECHNIQUES AND ANALYSIS, 1996, 2860 : 46 - 53
  • [23] Integrated phase unwrapping algorithm for the measurement of 3D shapes by Fourier transform profilometry
    Wu, Shuang-qing
    Zhang, Yin
    Zhang, San-yuan
    Ye, Xiu-zi
    JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A, 2009, 10 (07): : 1018 - 1028
  • [24] DISCRETE FOURIER-TRANSFORM ALGORITHMS FOR REAL VALUED SEQUENCES
    MARTENS, JB
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1984, 32 (02): : 390 - 396
  • [25] DISCRETE FAST FOURIER-TRANSFORM ALGORITHMS - A TUTORIAL SURVEY
    AN, M
    GERTNER, I
    ROFHEART, M
    TOLIMIERI, R
    ADVANCES IN ELECTRONICS AND ELECTRON PHYSICS, 1991, 80 : 1 - 67
  • [26] SYMMETRIC PRIME FACTOR FAST FOURIER-TRANSFORM ALGORITHMS
    OTTO, JS
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1989, 10 (03): : 419 - 431
  • [27] VERY FAST FOURIER-TRANSFORM ALGORITHMS HARDWARE FOR IMPLEMENTATION
    DESPAIN, AM
    IEEE TRANSACTIONS ON COMPUTERS, 1979, 28 (05) : 333 - 341
  • [28] ITERATIVE FOURIER-TRANSFORM ALGORITHM APPLIED TO COMPUTER HOLOGRAPHY
    WYROWSKI, F
    BRYNGDAHL, O
    JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, 1988, 5 (07): : 1058 - 1065
  • [29] IS COMPUTING WITH THE FINITE FOURIER-TRANSFORM PURE OR APPLIED MATHEMATICS
    AUSLANDER, L
    TOLIMIERI, R
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1979, 1 (06) : 847 - 897
  • [30] Fourier transform profilometry applied to 3-D object detection
    Esteve-Taboada, JJ
    García, J
    Ferreira, C
    18TH CONGRESS OF THE INTERNATIONAL COMMISSION FOR OPTICS: OPTICS FOR THE NEXT MILLENNIUM, TECHNICAL DIGEST, 1999, 3749 : 356 - 357