arXiv subjects

Qionghai Dai

Publications and source records attributed to Qionghai Dai.

68 records · Page 4Linked to original sources

arXiv2017

Experimental comparison of single-pixel imaging algorithms

Single-pixel imaging (SPI) is a novel technique capturing 2D images using a photodiode, instead of conventional 2D array sensors. SPI owns high signal-to-noise ratio, wide spectrum range, low cost, and robustness to light scattering. Various algorithms have been proposed for SPI reconstruction, including the linear correlation methods, the alternating projection method (AP), and the compressive sensing based methods. However, there has been no comprehensive review discussing respective advantages, which is important for SPI's further applications and development. In this paper, we reviewed and compared these algorithms in a unified reconstruction framework. Besides, we proposed two other SPI algorithms including a conjugate gradient descent based method (CGD) and a Poisson maximum likelihood based method. Both simulations and experiments validate the following conclusions: to obtain comparable reconstruction accuracy, the compressive sensing based total variation regularization method (TV) requires the least measurements and consumes the least running time for small-scale reconstruction; the CGD and AP methods run fastest in large-scale cases; the TV and AP methods are the most robust to measurement noise. In a word, there are trade-offs between capture efficiency, computational complexity and robustness to noise among different SPI algorithms. We have released our source code for non-commercial use.

cs.CV↗

arXiv2016

FlyCap: Markerless Motion Capture Using Multiple Autonomous Flying Cameras

Aiming at automatic, convenient and non-instrusive motion capture, this paper presents a new generation markerless motion capture technique, the FlyCap system, to capture surface motions of moving characters using multiple autonomous flying cameras (autonomous unmanned aerial vehicles(UAV) each integrated with an RGBD video camera). During data capture, three cooperative flying cameras automatically track and follow the moving target who performs large scale motions in a wide space. We propose a novel non-rigid surface registration method to track and fuse the depth of the three flying cameras for surface motion tracking of the moving target, and simultaneously calculate the pose of each flying camera. We leverage the using of visual-odometry information provided by the UAV platform, and formulate the surface tracking problem in a non-linear objective function that can be linearized and effectively minimized through a Gaussian-Newton method. Quantitative and qualitative experimental results demonstrate the competent and plausible surface and motion reconstruction results

cs.CV↗

arXiv2016

Efficient single pixel imaging in Fourier space

Single pixel imaging (SPI) is a novel technique being able to capture 2D images using a bucket detector with high signal-to-noise ratio, wide spectrum range and low cost. Conventional SPI projects random illumination patterns to randomly and uniformly sample the entire scene's information. Determined by the Nyquist sampling theory, SPI needs either numerous projections or high computation cost to reconstruct the target scene, especially for high-resolution cases. To address this issue, we propose an efficient single pixel imaging technique (eSPI), which instead projects sinusoidal patterns for importance sampling of the target scene's spatial spectrum in Fourier space. Specifically, utilizing the centrosymmetric conjugation and sparsity priors of natural images' spatial spectra, eSPI sequentially projects two $\fracπ{2}$-phase-shifted sinusoidal patterns to obtain each Fourier coefficient in the most informative spatial frequency bands. eSPI can reduce requisite patterns by two orders of magnitude compared to conventional SPI, which helps a lot for fast and high-resolution SPI.

physics.optics↗

arXiv2016

Motion-corrected Fourier ptychography

Fourier ptychography (FP) is a recently proposed computational imaging technique for high space-bandwidth product imaging. In real setups such as endoscope and transmission electron microscope, the common sample motion largely degrades the FP reconstruction and limits its practicability. In this paper, we propose a novel FP reconstruction method to efficiently correct for unknown sample motion. Specifically, we adaptively update the sample's Fourier spectrum from low spatial-frequency regions towards high spatial-frequency ones, with an additional motion recovery and phase-offset compensation procedure for each sub-spectrum. Benefiting from the phase retrieval redundancy theory, the required large overlap between adjacent sub-spectra offers an accurate guide for successful motion recovery. Experimental results on both simulated data and real captured data show that the proposed method can correct for unknown sample motion with its standard deviation being up to 10% of the field-of-view scale. We have released our source code for non-commercial use, and it may find wide applications in related FP platforms such as endoscopy and transmission electron microscopy.

physics.optics↗

arXiv2016

Fourier ptychographic reconstruction using Poisson maximum likelihood and truncated Wirtinger gradient

Fourier ptychographic microscopy (FPM) is a novel computational coherent imaging technique for high space-bandwidth product imaging. Mathematically, Fourier ptychographic (FP) reconstruction can be implemented as a phase retrieval optimization process, in which we only obtain low resolution intensity images corresponding to the sub-bands of the sample's high resolution (HR) spatial spectrum, and aim to retrieve the complex HR spectrum. In real setups, the measurements always suffer from various degenerations such as Gaussian noise, Poisson noise, speckle noise and pupil location error, which would largely degrade the reconstruction. To efficiently address these degenerations, we propose a novel FP reconstruction method under a gradient descent optimization framework in this paper. The technique utilizes Poisson maximum likelihood for better signal modeling, and truncated Wirtinger gradient for error removal. Results on both simulated data and real data captured using our laser FPM setup show that the proposed method outperforms other state-of-the-art algorithms. Also, we have released our source code for non-commercial use.

cs.CV↗

arXiv2015

Scene-adaptive Coded Apertures Imaging

Coded aperture imaging systems have recently shown great success in recovering scene depth and extending the depth-of-field. The ideal pattern, however, would have to serve two conflicting purposes: 1) be broadband to ensure robust deconvolution and 2) has sufficient zero-crossings for a high depth discrepancy. This paper presents a simple but effective scene-adaptive coded aperture solution to bridge this gap. We observe that the geometric structures in a natural scene often exhibit only a few edge directions, and the successive frames are closely correlated. Therefore we adopt a spatial partitioning and temporal propagation scheme. In each frame, we address one principal direction by applying depth-discriminative codes along it and broadband codes along its orthogonal direction. Since within a frame only the regions with edge direction corresponding to its aperture code behaves well, we utilize the close among-frame correlation to propagate the high quality single frame results temporally to obtain high performance over the whole image lattice. To physically implement this scheme, we use a Liquid Crystal on Silicon (LCoS) microdisplay that permits fast changing pattern codes. Firstly, we capture the scene with a pinhole and analyze the scene content to determine primary edge orientations. Secondly, we sequentially apply the proposed coding scheme with these orientations in the following frames. Experiments on both synthetic and real scenes show that our technique is able to combine advantages of the state-of-the-art patterns for recovering better quality depth map and all-focus images.

cs.CV↗

arXiv2015

Fast and High Quality Highlight Removal from A Single Image

Specular reflection exists widely in photography and causes the recorded color deviating from its true value, so fast and high quality highlight removal from a single nature image is of great importance. In spite of the progress in the past decades in highlight removal, achieving wide applicability to the large diversity of nature scenes is quite challenging. To handle this problem, we propose an analytic solution to highlight removal based on an L2 chromaticity definition and corresponding dichromatic model. Specifically, this paper derives a normalized dichromatic model for the pixels with identical diffuse color: a unit circle equation of projection coefficients in two subspaces that are orthogonal to and parallel with the illumination, respectively. In the former illumination orthogonal subspace, which is specular-free, we can conduct robust clustering with an explicit criterion to determine the cluster number adaptively. In the latter illumination parallel subspace, a property called pure diffuse pixels distribution rule (PDDR) helps map each specular-influenced pixel to its diffuse component. In terms of efficiency, the proposed approach involves few complex calculation, and thus can remove highlight from high resolution images fast. Experiments show that this method is of superior performance in various challenging cases.

cs.CV↗

arXiv2015

Multispectral imaging using a single bucket detector

Current multispectral imagers suffer from low photon efficiency and limited spectrum range. These limitations are partially due to the technological limitations from array sensors (CCD or CMOS), and also caused by separative measurement of the entries/slices of a spatial-spectral data cube. Besides, they are mostly expensive and bulky. To address above issues, this paper proposes to image the 3D multispectral data with a single bucket detector in a multiplexing way. Under the single pixel imaging scheme, we project spatial-spectral modulated illumination onto the target scene to encode the scene's 3D information into a 1D measurement sequence. Conventional spatial modulation is used to resolve the scene's spatial information. To avoid increasing requisite acquisition time for 2D to 3D extension of the latent data, we conduct spectral modulation in a frequency-division multiplexing manner in the speed gap between slow spatial light modulation and fast detector response. Then the sequential reconstruction falls into a simple Fourier decomposition and standard compressive sensing problem. A proof-of-concept setup is built to capture the multispectral data (64 pixels $\times$ 64 pixels $\times$ 10 wavelength bands) in the visible wavelength range (450nm-650nm) with acquisition time being 1 minute. The imaging scheme is of high flexibility for different spectrum ranges and resolutions. It holds great potentials for various low light and airborne applications, and can be easily manufactured production-volume portable multispectral imagers.

physics.optics↗

arXiv2015

Sampling-based Causal Inference in Cue Combination and its Neural Implementation

Causal inference in cue combination is to decide whether the cues have a single cause or multiple causes. Although the Bayesian causal inference model explains the problem of causal inference in cue combination successfully, how causal inference in cue combination could be implemented by neural circuits, is unclear. The existing method based on calculating log posterior ratio with variable elimination has the problem of being unrealistic and task-specific. In this paper, we take advantages of the special structure of the Bayesian causal inference model and propose a hierarchical inference algorithm based on importance sampling. A simple neural circuit is designed to implement the proposed inference algorithm. Theoretical analyses and experimental results demonstrate that our algorithm converges to the accurate value as the sample size goes to infinite. Moreover, the neural circuit we design can be easily generalized to implement inference for other problems, such as the multi-stimuli cause inference and the same-different judgment.

cs.NE↗

arXiv2014

Multi-frame denoising of high speed optical coherence tomography data using inter-frame and intra-frame priors

Optical coherence tomography (OCT) is an important interferometric diagnostic technique which provides cross-sectional views of the subsurface microstructure of biological tissues. However, the imaging quality of high-speed OCT is limited due to the large speckle noise. To address this problem, this paper proposes a multi-frame algorithmic method to denoise OCT volume. Mathematically, we build an optimization model which forces the temporally registered frames to be low rank, and the gradient in each frame to be sparse, under logarithmic image formation and noise variance constraints. Besides, a convex optimization algorithm based on the augmented Lagrangian method is derived to solve the above model. The results reveal that our approach outperforms the other methods in terms of both speckle noise suppression and crucial detail preservation.

cs.CV↗

arXiv2014

Fourier ptychographic reconstruction using Wirtinger flow optimization

Recently Fourier Ptychography (FP) has attracted great attention, due to its marked effectiveness in leveraging snapshot numbers for spatial resolution in large field-of-view imaging. To acquire high signal-to-noise-ratio (SNR) images under angularly varying illuminations for subsequent reconstruction, FP requires long exposure time, which largely limits its practical applications. In this paper, based on the recently reported Wirtinger flow algorithm, we propose an iterative optimization framework incorporating phase retrieval and noise relaxation together, to realize FP reconstruction using low SNR images captured under short exposure time. Experiments on both synthetic and real captured data validate the effectiveness of the proposed reconstruction method. Specifically, the proposed technique could save around 80% exposure time to achieve similar retrieval accuracy compared to the conventional FP. Besides, we have released our source code for non-commercial use.

physics.optics↗

arXiv2014

Content adaptive sparse illumination for Fourier ptychography

Fourier Ptychography (FP) is a recently proposed technique for large field of view and high resolution imaging. Specifically, FP captures a set of low resolution images under angularly varying illuminations and stitches them together in Fourier domain. One of FP's main disadvantages is its long capturing process due to the requisite large number of incident illumination angles. In this letter, utilizing the sparsity of natural images in Fourier domain, we propose a highly efficient method termed as AFP, which applies content adaptive sparse illumination for Fourier ptychography by capturing the most informative parts of the scene's spatial spectrum. We validate the effectiveness and efficiency of the reported framework with both simulations and real experiments. Results show that the proposed AFP could shorten the acquisition time of conventional FP by around 30%-60%.

physics.optics↗

arXiv2014

Self-synchronizing scheme for high speed computational ghost imaging

Computational ghost imaging needs to acquire a large number of correlated measurements between reference patterns and the scene for reconstruction, so extremely high acquisition speed is crucial for fast ghost imaging. With the development of technologies, high frequency illumination and detectors are both available, but their synchronization needs technique demanding customization and lacks flexibility for different setup configurations. This letter proposes a self-synchronization scheme that can eliminate this difficulty by introducing a high precision synchronization technique and corresponding algorithm. We physically implement the proposed scheme using a 20kHz spatial light modulator to generate random binary patterns together with a 100 times faster photodiode for high speed ghost imaging, and the acquisition frequency is around 14 times faster than that of state-of-the-arts.

physics.optics↗

arXiv2012

Low-Rank Structure Learning via Log-Sum Heuristic Recovery

Recovering intrinsic data structure from corrupted observations plays an important role in various tasks in the communities of machine learning and signal processing. In this paper, we propose a novel model, named log-sum heuristic recovery (LHR), to learn the essential low-rank structure from corrupted data. Different from traditional approaches, which directly utilize $\ell_1$ norm to measure the sparseness, LHR introduces a more reasonable log-sum measurement to enhance the sparsity in both the intrinsic low-rank structure and in the sparse corruptions. Although the proposed LHR optimization is no longer convex, it still can be effectively solved by a majorization-minimization (MM) type algorithm, with which the non-convex objective function is iteratively replaced by its convex surrogate and LHR finally falls into the general framework of reweighed approaches. We prove that the MM-type algorithm can converge to a stationary point after successive iteration. We test the performance of our proposed model by applying it to solve two typical problems: robust principal component analysis (RPCA) and low-rank representation (LRR). For RPCA, we compare LHR with the benchmark Principal Component Pursuit (PCP) method from both the perspectives of simulations and practical applications. For LRR, we apply LHR to compute the low-rank representation matrix for motion segmentation and stock clustering. Experimental results on low rank structure learning demonstrate that the proposed Log-sum based model performs much better than the $\ell_1$-based method on for data with higher rank and with denser corruptions.

math.NA↗