The phase-shifting digital holography (PSDH) is a typical problem in holography. It is traditionally conducted by the measurements from multiple shots. The four- and three-shot approaches to PSDH are commonly utilized for the imaging of static objects. Unlike this, the imaging of dynamic objects requires that PSDH should be conducted by single-shot measurements. Motivated by this, we are interested in the single-shot phase retrieval (PR) problem for periodic signals. The reference wave we use for such a PR model is the plane reference wave, and the measurements are the single-shot intensities. A single-shot PR algorithm is established. Additionally, it is observed that what is required for the four- and three-shot approaches are essentially the intensity differences. From the perspective of intensity difference, the stability of the algorithm is systematically investigated. In particular, it is found that the stability depends on the correlation between the wave vector and sampling set. Based on the wave vector, the choice scheme for sampling set is designed such that the recovery is well-conditioned in the noisy setting. The simulation of image recovery confirms the correctness of related results.

For the light microscopy images that have the characteristics of shallow depth of field, serious distortion and poor resolution, mismatch is a ubiquitous phenomenon. The paper presents a mismatch detection method for the stereo light microscopy stereo matching. Affine transformation matrix and matching constraint condition are calibrated by the calibration board which has the precision solid dots and the motorized stage. Bias vector of affine transformation of each matching pair is taken as the criteria to apply mismatch detection. The experimental results show that the method can detect more mismatching pairs and preserve more matching pairs than the traditional RANSAC method and the epipolar rectification method.

In this paper, we propose a novel fast cost propagation algorithm on spanning tree structures. By introducing local smoothness constraint during the weighted cost aggregation process on tree structures, we overcome the shortage of the “fronto-parallel plane” assumption used in most local and non-local cost aggregation algorithms. By applying it to our stereo correspondence framework, accurate results with fine disparity boundaries can be obtained. We also introduce a linear time implementation of the proposed algorithm, thus the computational complexity is kept extremely low.