Abstract

Massive inherent speckle noise and extremely low contrast make it difficult to binarize electronic speckle pattern interferometry (ESPI) fringe patterns. In this paper, we present a binarization based on preprocessing and fuzzy C-means (FCM) clustering for low-quality ESPI fringe patterns. First, we use the multiscale retinex (MSR) algorithm to enhance the original fringe pattern to improve the contrast between the bright and dark fringes. Then, the local entropy of the enhanced fringe pattern is calculated and the second-order oriented partial differential equation algorithm is introduced to filter the local entropy map. Finally, the FCM is applied to cluster the local entropy filtering map, and the pixels of the fringe pattern are classified into two categories: bright fringes and dark fringes. To verify the reliability and universality of the proposed method, we provide a qualitative evaluation of six experimental ESPI subtraction fringe patterns and two computer-simulated ESPI addition fringe patterns. Experimental results exhibit that the proposed method can provide good binarization performances.

© 2021 Optical Society of America

Binarization of ESPI fringe patterns based on local entropy

Mingming Chen, Chen Tang, Min Xu, and Zhenkun Lei
Opt. Express 27(22) 32378-32391 (2019)

Binarization of ESPI fringe patterns based on an M-net convolutional neural network

Chenxiu Liu, Chen Tang, Min Xu, and Zhenkun Lei
Appl. Opt. 59(30) 9598-9606 (2020)

Fuzzy c-means clustering based segmentation and the filtering method for discontinuous ESPI fringe patterns

Wenjun Xu, Chen Tang, Min Xu, and Zhenkun Lei
Appl. Opt. 58(6) 1442-1450 (2019)

Combination of oriented partial differential equation and shearlet transform for denoising in electronic speckle pattern interferometry fringe patterns

Wenjun Xu, Chen Tang, Fan Gu, and Jiajia Cheng
Appl. Opt. 56(10) 2843-2850 (2017)

Batch denoising of ESPI fringe patterns based on convolutional neural network

Fugui Hao, Chen Tang, Min Xu, and Zhenkun Lei
Appl. Opt. 58(13) 3338-3346 (2019)