Efficient Fourier single-pixel imaging with Gaussian random sampling
- URL: http://arxiv.org/abs/2108.02317v1
- Date: Tue, 29 Jun 2021 01:23:33 GMT
- Title: Efficient Fourier single-pixel imaging with Gaussian random sampling
- Authors: Ziheng Qiu, Xinyi Guo, Tianao Lu, Pan Qi, Zibang Zhang, Jingang Zhong
- Abstract summary: We propose a new sampling strategy for Fourier single-pixel imaging (FSI)
It allows FSI to reconstruct a clear and sharp image with a reduced number of measurements.
We experimentally demonstrate compressive FSI combined with the proposed sampling strategy is able to reconstruct a sharp and clear image of 256-by-256 pixels with a sampling ratio of 10%.
- Score: 1.2355696607086075
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Fourier single-pixel imaging (FSI) is a branch of single-pixel imaging
techniques. It uses Fourier basis patterns as structured patterns for spatial
information acquisition in the Fourier domain. However, the spatial resolution
of the image reconstructed by FSI mainly depends on the number of Fourier
coefficients sampled. The reconstruction of a high-resolution image typically
requires a number of Fourier coefficients to be sampled, and therefore takes a
long data acquisition time. Here we propose a new sampling strategy for FSI. It
allows FSI to reconstruct a clear and sharp image with a reduced number of
measurements. The core of the proposed sampling strategy is to perform a
variable density sampling in the Fourier space and, more importantly, the
density with respect to the importance of Fourier coefficients is subject to a
one-dimensional Gaussian function. Combined with compressive sensing, the
proposed sampling strategy enables better reconstruction quality than
conventional sampling strategies, especially when the sampling ratio is low. We
experimentally demonstrate compressive FSI combined with the proposed sampling
strategy is able to reconstruct a sharp and clear image of 256-by-256 pixels
with a sampling ratio of 10%. The proposed method enables fast single-pixel
imaging and provides a new approach for efficient spatial information
acquisition.
Related papers
- Misalignment-Robust Frequency Distribution Loss for Image Transformation [51.0462138717502]
This paper aims to address a common challenge in deep learning-based image transformation methods, such as image enhancement and super-resolution.
We introduce a novel and simple Frequency Distribution Loss (FDL) for computing distribution distance within the frequency domain.
Our method is empirically proven effective as a training constraint due to the thoughtful utilization of global information in the frequency domain.
arXiv Detail & Related papers (2024-02-28T09:27:41Z) - On Optimal Sampling for Learning SDF Using MLPs Equipped with Positional
Encoding [79.67071790034609]
We devise a tool to determine the appropriate sampling rate for learning an accurate neural implicit field without undesirable side effects.
It is observed that a PE-equipped has an intrinsic frequency much higher than the highest frequency component in the PE layer.
We empirically show in the setting of SDF fitting, this recommended sampling rate is sufficient to secure accurate fitting results.
arXiv Detail & Related papers (2024-01-02T10:51:52Z) - Filtering Pixel Latent Variables for Unmixing Noisy and Undersampled Volumetric Images [6.2916043414599]
In experimental physics, enhancing the acquisition resolution or expanding the number of detection channels often leads to diminished sampling rate and signal-to-noise ratio.
We propose applying band-pass filters to the latent space of a multi-dimensional convolutional neural network to disentangle overlapping signal components.
Using multi-dimensional convolution kernels to process all dimensions simultaneously enhances the network's ability to extract information from adjacent pixels, time- or spectral-bins.
arXiv Detail & Related papers (2023-12-08T20:34:37Z) - FourLLIE: Boosting Low-Light Image Enhancement by Fourier Frequency
Information [19.478293277978935]
We propose a two-stage Fourier-based Low-Light Image Enhancement (LLIE) network (FourLLIE)
In the first stage, we improve the lightness of low-light images by estimating the amplitude transform map in the Fourier space.
In the second stage, we introduce the Signal-to-Noise-Ratio (SNR) map to provide the prior for integrating the global Fourier frequency and the local spatial information.
arXiv Detail & Related papers (2023-08-06T06:14:14Z) - Contextual Learning in Fourier Complex Field for VHR Remote Sensing
Images [64.84260544255477]
transformer-based models demonstrated outstanding potential for learning high-order contextual relationships from natural images with general resolution (224x224 pixels)
We propose a complex self-attention (CSA) mechanism to model the high-order contextual information with less than half computations of naive SA.
By stacking various layers of CSA blocks, we propose the Fourier Complex Transformer (FCT) model to learn global contextual information from VHR aerial images.
arXiv Detail & Related papers (2022-10-28T08:13:33Z) - Deep Fourier Up-Sampling [100.59885545206744]
Up-sampling in the Fourier domain is more challenging as it does not follow such a local property.
We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
arXiv Detail & Related papers (2022-10-11T06:17:31Z) - Sigma-Delta and Distributed Noise-Shaping Quantization Methods for
Random Fourier Features [73.25551965751603]
We prove that our quantized RFFs allow a high accuracy approximation of the underlying kernels.
We show that the quantized RFFs can be further compressed, yielding an excellent trade-off between memory use and accuracy.
We empirically show by testing the performance of our methods on several machine learning tasks that our method compares favorably to other state of the art quantization methods in this context.
arXiv Detail & Related papers (2021-06-04T17:24:47Z) - Deep Unfolded Recovery of Sub-Nyquist Sampled Ultrasound Image [94.42139459221784]
We propose a reconstruction method from sub-Nyquist samples in the time and spatial domain, that is based on unfolding the ISTA algorithm.
Our method allows reducing the number of array elements, sampling rate, and computational time while ensuring high quality imaging performance.
arXiv Detail & Related papers (2021-03-01T19:19:38Z) - Scale factor point spread function matching: Beyond aliasing in image
resampling [4.81150027600776]
Imaging devices exploit the Nyquist-Shannon sampling theorem to avoid both aliasing and redundant oversampling by design.
In medical image resampling, images are considered as continuous functions, are warped by a spatial transformation, and are then sampled on a regular grid.
This paper shows that this oversight introduces artefacts, including aliasing, that can lead to important bias in clinical applications.
arXiv Detail & Related papers (2021-01-16T11:40:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.