Abstract
Due to its effectiveness in fringe pattern analysis, a fast implementation of windowed Fourier transform (WFT)-based algorithms is desired. In this work, we speed up the implementation in two aspects. First, we speed up the computation of Fourier transform, which is a core component of the WFT-based algorithms. Second, we parallelize the main body of these algorithms due to its parallel characteristic. With these two approaches, we obtain a faster implementation than the original MATLAB version.
© 2015 Optical Society of America
Full Article |
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Figures (2)
You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Tables (6)
You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Equations (8)
You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription