Passive compressive ghost imaging with low rank clustering

As computational ghost imaging is widely used in the military, radar, and other fields, its security and efficiency became more and more important. In this paper, we propose a compressive ghost imaging encryption scheme based on the hyper-chaotic system, DNA encoding, and KSVD algorithm for the first time. First, a 4-dimensional hyper-chaotic system is used to generate four long pseudorandom sequences and diffuse the sequences with DNA operation to get the phase mask sequence, and then N phase mask matrixes are generated from the sequences. Second, in order to improve the reconstruction efficiency, KSVD algorithm is used to generate dictionary D to sparse the image. The transmission key of the proposed scheme includes the initial values of hyper-chaotic and dictionary D, which has plaintext correlation and big key space. Compared with the existing compressive ghost imaging encryption scheme, the proposed scheme is more sensitive to initial values and more complexity and has smaller transmission key, which makes the encryption scheme more secure, and the reconstruction efficiency is higher too. Simulation results and security analysis demonstrate the good performance of the proposed scheme.

The underwater environment is extremely complex and variable, which makes it difficult for underwater robots detecting or recognizing surroundings using images acquired with cameras. Ghost imaging as a new imaging technique has attracted much attention due to its special physical properties and potential for imaging of objects in optically harsh or noisy environments. In this work, we experimentally study three categories of image reconstruction methods of ghost imaging for objects of different transmittance. For high-transmittance objects, the differential ghost imaging is more efficient than traditional ghost imaging. However, for low-transmittance objects, the reconstructed images using traditional ghost imaging and differential ghost imaging algorithms are both exceedingly blurred and cannot be improved by increasing the number of measurements. A compressive sensing method named augmented Lagrangian and alternating direction algorithm (TVAL3) is proposed to reduce the background noise imposed by the low-transmittance. Experimental results show that compressive ghost imaging can dramatically subtract the background noise and enhance the contrast of the image. The relationship between the quality of the reconstructed image and the complexity of object itself is also discussed.

For lower sampling rate and better imaging quality, a compressive adaptive ghost imaging is proposed by adopting the sharing mechanism and fellow relationship in the wavelet tree. The sharing mechanisms, including intrascale and interscale sharing mechanisms, and fellow relationship are excavated from the wavelet tree and utilized for sampling. The shared coefficients, which are part of the approximation subband, are localized according to the parent coefficients and sampled based on the interscale sharing mechanism and fellow relationship. The sampling rate can be reduced owing to the fact that some shared coefficients can be calculated by adopting the parent coefficients and the sampled sum of shared coefficients. According to the shared coefficients and parent coefficients, the proposed method predicts the positions of significant coefficients and samples them based on the intrascale sharing mechanism. The ghost image, reconstructed by the significant coefficients and the coarse image at the given largest scale, achieves better quality because the significant coefficients contain more detailed information. The simulations demonstrate that the proposed method improves the imaging quality at the same sampling rate and also achieves a lower sampling rate for the same imaging quality for different types of target object images in noise-free and noisy environments.

Compressive ghost imaging (CSGI) combines structured illumination and a bucket detector for obtaining the light intensity signal from an unknown object. Light fluctuations are generated by few measurements and then an image is reconstructed using optimization algorithms such as compressive sensing (CS) by finding its sparse representation. The measured light fluctuations are not sensitive to scattering degradation. Consequently, an absorbing object completely embedded in a scattering media can be imaged. To speed up the sequential loading of illumination patterns on a digital micromirror device and achieve data compression, the sampling number should be reduced because more than 90% of the time in CS reconstruction is usually spent in getting a frame of image. In this study, we propose a novel strategy to realize a speedy and reliable reconstruction procedure for obtaining a high image quality by using prior knowledge during the acquisition of light intensity signal in CSGI. The prior knowledge is established by extracting the features of a local target area, which is designed by descattering of images with extra noise using fast Fourier single-pixel imaging. The proposed method facilitates a reliable image quality even under the reduction in the compression ratio, thereby overcoming the limitation of the dependence of sampling ratio on the image quality in CSGI.

Speckle patterns arise when coherent light reflects from rough surfaces or propagates through complex scattering media, such as disordered materials or multimode fibers. These patterns exhibit a random granular structure, with their statistical properties typically following Rayleigh statistics. The probability density function (PDF) of the complex field conforms to a circular Gaussian distribution, while the intensity PDF follows a negative exponential distribution. Wavefront shaping techniques can modify these statistical properties by controlling wavefront intensity, polarization, or phase [1], enabling diverse applications, including advanced imaging, cryptography, and optical communications. Compressive ghost imaging (CGI) leverages speckle patterns for image reconstruction using a bucket detector instead of a traditional camera [2]. This technique relies on compressive sensing, which exploits object sparsity to achieve accurate image reconstruction with fewer measurements. CGI is particularly advantageous in challenging environments, such as imaging through highly scattering or dynamic media.

With the rapid development of computer technology, information security has attracted more and more attention. It is not only related to the information and property security of individuals and enterprises, but also to the security and social stability of a country. Identity authentication is the first line of defense in information security. In authentication systems, response time and security are the most important factors. An optical authentication technology based on compressive ghost imaging with QR codes is proposed in this paper. The scheme can be authenticated with a small number of samples. Therefore, the response time of the algorithm is short. At the same time, the algorithm can resist certain noise attacks, so it offers good security.

Equipment requirement, quality of reconstructed image, and reconstruction time are important factors in the realization of thermal-light ghost imaging system. In this paper, we propose a new ghost imaging scheme with multiple speckle patterns, named multiple speckle patterns differential compressive ghost imaging scheme. In this scheme, the high temporal resolution requirements for detectors is reduced by continuously detecting multiple independent speckle patterns. We eliminate the background and other noises in ghost imaging system by using differential ghost imaging method. And the reconstruction time is effectively reduced simultaneously to improve the reconstructed image quality by introducing the compressive sensing techniques. Numerical results show that for the two-level grayscale “N” image, the mean square error, in using the proposed scheme with 8000 measurements, is reduced by 96.9%, and the peak signal to noise ratio has improved by 15.1 dB, in comparison with those using the original multiple speckle patterns ghost imaging scheme with 35000 measurements. For the eight-level grayscale “Pepper” image, the peak signal to noise ratio is enhanced by 11.4 dB. The proposed scheme also can decrease the requirements of detection equipment to improve the image quality, and reduce the reconstruction time. Therefore, it may have a broad application prospect.

Secret shared multiple-image encryption based on row scanning compressive ghost imaging and phase retrieval in the Fresnel domain

A hyperspectral image (HSI) can be described as a set of images with spatial information across different spectral bands. Compressive spectral imaging techniques (CSI) permit to capture a 3-dimensional hyperspectral scene using 2 dimensional coded and multiplexed projections. Recovering the original scene from a very few projections can be valuable in applications such as remote sensing, video surveillance and biomedical imaging. Typically, HSI exhibit high correlations both, in the spatial and spectral dimensions. Thus, exploiting these correlations allows to accurately recover the original scene from compressed measurements. Traditional approaches exploit the sparsity of the scene when represented in a proper basis. For this purpose, an optimization problem that seeks to minimize a joint e 2 − e 1 norm is solved to obtain the original scene. However, there exist some HSI with an important feature which does not have been widely exploited; HSI are commonly low rank, thus only a few number of spectral signatures are presented in the image. Therefore, this paper proposes an approach to recover a simultaneous sparse and low rank hyperspectral image by exploiting both features at the same time. The proposed approach solves an optimization problem that seeks to minimize the e 2 -norm, penalized by the e 1 -norm, to force the solution to be sparse, and penalized by the nuclear norm to force the solution to be low rank. Theoretical analysis along with a set of simulations over different data sets show that simultaneously exploiting low rank and sparse structures enhances the performance of the recovery algorithm and the quality of the recovered image with an average improvement of around 3 dB in terms of the peak-signal to noise ratio (PSNR).

Compressive sensing enables efficient acquisition of hyperspectral images (HSIs) by assuming high redundancy on natural scenes. Several reconstruction algorithms have been proposed to retrieve the underlying image, and most of them take advantage of the spatial and spectral correlations. However, reconstruction may not be necessary in certain applications such as land cover classification. Instead of knowing the full image, researchers are interested in features that could be extracted directly from the compressed measurements, which provide high inference capabilities. Low-rank (LR) matrix approximation has been widely used in feature extraction (FE), because it reduces the data dimension and computational cost. Therefore, in this paper, compressive hyperspectral imaging and FE are combined in a framework for HSI classification using an LR matrix approximation model. In the proposed framework, the compressed measurements are acquired from a single-pixel spectrometer. Instead of using the traditional high-complexity reconstruction model, an LR matrix factorization problem is formulated. The LR problem maximizes the posterior distribution with respect to the feature space and coefficients, and it is numerically solved based on an alternating optimization strategy. By incorporating spatial information, the numerical procedure minimizes the total variational of the feature coefficients subject to an orthogonality constraint for the feature space. Experiments on real HSIs show that the proposed approach can provide equally competitive classification results when compared to the traditional approach that performs FE and classification on the recovered images.

The topic of the rank minimization problem with affine constraints has been well studied in recent years. However, in many applications the data can exhibit other structures beyond simply being low rank. For example, images and videos present complex spatio-temporal structures, which are largely ignored by current affine rank minimization (ARM) methods. In this paper, we propose a novel approximate message passing (AMP)-based approach that is capable of capturing additional structures in the matrix entries, and can be implemented in a wide range of applications with little or no modification. Using probabilistic low-rank factorization, we derive our generalized AMP-based algorithm as an approximation of the loopy belief propagation algorithm. In addition, we apply a rank selection strategy and an expectation-maximization estimation strategy that adaptively obtain the optimal value of the algorithmic parameters. Then, we discuss the specializations of our proposed algorithm to the applications of structured ARM problems, such as compressive hyperspectral imaging and compressive video surveillance. Simulation results with both synthetic and real data demonstrate that the proposed algorithm yields the state-of-the-art reconstruction performance while maintaining competitive computational complexity.

Single-pixel imaging, which is also known as computational ghost imaging, can reconstruct an entire image using one non-spatially resolved detector. However, it often requires a large amount of sampling, severely limiting its application. In this paper, we discuss the implementation of secured regions of interest (SROIs) in single-pixel imaging and illustrate its application using two experiments. Under a limited number of sampling times, we improved the resolution and recovered spectral information of interest in the ROI. Meanwhile, this scheme has high information security with high encryption and has great potential for single-pixel video and compressive multi-spectral single-pixel imaging.