No abstract

Intensity saturation is a challenging problem in structured light 3D shape measurement. Most of the existing methods achieve high dynamic range (HDR) measurement by sacrificing measurement speed, making them limited in high-speed dynamic applications. This Letter proposes a generic efficient saturation-induced phase error correction method for HDR measurement without increasing any fringe patterns. We first theoretically analyze the saturated signal model and deduce the periodic characteristic of saturation-induced phase error. Based on this, we specially design a saturation-induced phase error correction method by joint Fourier analysis and Hilbert transform. Furthermore, the relationship among phase error, saturation degree, and number of phase-shifting steps is established by numerical simulation. Since the proposed method requires no extra captured images or complicated intensity calibration, it is extremely convenient in implementation and is applicable to performing high-speed 3D shape measurements. Simulations and experiments verify the feasibility of the proposed method.

The non-uniform motion-induced error reduction in dynamic fringe projection profilometry is complex and challenging. Recently, deep learning (DL) has been successfully applied to many complex optical problems with strong nonlinearity and exhibits excellent performance. Inspired by this, a deep learning-based method is developed for non-uniform motion-induced error reduction by taking advantage of the powerful ability of nonlinear fitting. First, a specially designed dataset of motion-induced error reduction is generated for network training by incorporating complex nonlinearity. Then, the corresponding DL-based architecture is proposed and it contains two parts: in the first part, a fringe compensation module is developed as network pre-processing to reduce the phase error caused by fringe discontinuity; in the second part, a deep neural network is employed to extract the high-level features of error distribution and establish a pixel-wise hidden nonlinear mapping between the phase with motion-induced error and the ideal one. Both simulations and real experiments demonstrate the feasibility of the proposed method in dynamic macroscopic measurement.

No abstract

Symmetric nonnegative matrix factorization (SNMF) approximates a symmetric nonnegative matrix by the product of a nonnegative low-rank matrix and its transpose. SNMF has been successfully used in many real-world applications such as clustering. In this paper, we propose an accelerated variant of the multiplicative update (MU) algorithm of He et al. designed to solve the SNMF problem. The accelerated algorithm is derived by using the extrapolation scheme of Nesterov and a restart strategy. The extrapolation scheme plays a leading role in accelerating the MU algorithm of He et al. and the restart strategy ensures that the objective function of SNMF is monotonically decreasing. We apply the accelerated algorithm to clustering problems and symmetric nonnegative tensor factorization (SNTF). The experiment results on both synthetic and real-world data show that it is more than four times faster than the MU algorithm of He et al. and performs favorably compared to recent state-of-the-art algorithms.