---
title: Single-Pixel Imaging (SPI) Overview
url: https://www.emergentmind.com/topics/single-pixel-imaging-spi
type: topic
---

# Single-Pixel Imaging (SPI) Overview

Single-pixel imaging (SPI) is a computational imaging technique in which a scene is illuminated by a sequence of known spatial patterns and a single-pixel detector measures only the total transmitted or reflected intensity for each pattern, rather than a spatially resolved image. In the formulations used across the literature, SPI reconstructs spatial information from sequentially encoded optoelectrical signals without pixelated detector arrays, typically through a linear forward model such as $\mathbf{y}=\mathbf{\Phi x}$ or $\mathbf{A}\mathbf{x}=\mathbf{b}$, where the measurements are inner products between the scene and projected patterns. Reported advantages include high signal-to-noise ratio, wide spectrum range, low cost, compactness, and applicability where conventional array sensors are expensive, unavailable, or impractical [1811.03455], [1707.03164], [2606.01731].

## 1. Measurement principle and forward models

The canonical SPI architecture consists of a spatial light modulator, commonly a digital micromirror device (DMD), a sequence of structured illumination patterns, and a single bucket detector. For each projected pattern, the detector records one scalar response. In its conventional vectorized form, the measurement model is written as
\[
\mathbf{y}=\mathbf{\Phi x},
\]
where $\mathbf{x}$ is the unknown image, $\mathbf{\Phi}$ is the sensing matrix formed by the vectorized patterns, and $\mathbf{y}$ is the measurement vector. Each measurement is therefore the inner product between the scene and one projected pattern [1811.03455].

This linear description appears in multiple algorithmic families. In Fourier SPI, the projected masks are sinusoidal Fourier basis functions, and the detector sequence corresponds to ordered acquisition of Fourier coefficients. For an object $O(x,y)$, the Fourier coefficient at spatial frequency $(u,v)$ is measured through cosine and sine illuminations, so the detector sequence itself becomes a feature vector in the measurement domain [1805.07582]. In Hadamard-based SPI, the image is represented in a Walsh-ordered basis, with coefficients recovered through basis scans or through complementary positive and inverse binary patterns suited to DMD hardware [2109.02333].

A more structured two-dimensional formulation appears in Kronecker SPI, where the image is kept as a matrix instead of being fully vectorized:
\[
Y=\Phi_h X \Phi_v^\top.
\]
This yields a tensor reconstruction problem
\[
\hat{X}=\arg\min_X \frac{1}{2}\|Y-\Phi_h X \Phi_v^\top\|_F^2+\lambda\mathcal{R}(X),
\]
and avoids the computational overheads associated with previous gradient-descent modules based on vectorized SPI [2404.05001].

Complementary and differential measurements are recurring implementation devices. Because DMDs display binary or nonnegative patterns, a signed mask $P_i\in\{\pm1\}$ is often split into
\[
P_i^+=\frac{1+P_i}{2},\qquad P_i^-=\frac{1-P_i}{2},
\]
and the corresponding measurements are differenced to recover a signed coefficient while improving detection SNR [2203.04659], [2109.02333]. This measurement-level normalization and differencing also underpins several ghost-imaging-style and instant reconstruction schemes [2002.00126].

## 2. Bases, ordering strategies, and inverse reconstruction

SPI reconstruction is typically underdetermined, so priors and basis design are central. Conventional compressive SPI commonly uses global sparsity priors in the DCT domain or total variation (TV), while correlation-based methods and direct inverse transforms remain attractive when the measurement basis is orthogonal or highly structured [1811.03455]. In a unified experimental comparison of reconstruction algorithms, the reported conclusions were that, to obtain comparable reconstruction accuracy, the compressive-sensing-based TV method 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; and the TV and AP methods are the most robust to measurement noise [1707.03164].

The choice of measurement basis strongly affects both acquisition efficiency and reconstruction complexity. Random matrices are described as causing measurement blindness, computational difficulty, storage burden, and sampling-rate limitation. Deterministic Hadamard bases became an alternative because they are orthogonal, binary-valued, easy to implement on spatial modulators, and compatible with fast transforms and complementary modulation [2203.04659]. The same work introduced the concept of selection history to encode the recursive folding process of Hadamard rows and columns, thereby explaining the formation mechanisms and conversion relationships of several orderings, including natural order, sequency, Russian dolls, origami, and cake-cutting. On that basis it proposed a weight sort (WH), with simulation and experimental results showing the ordering performance
\[
\text{NA worst}<\text{SE}<\text{RD}<\text{OR}<\text{CC}<\text{WH},
\]
especially at low sampling ratios [2203.04659].

Fourier-space acquisition provides a different route to efficiency. Efficient SPI (eSPI) projects sinusoidal patterns for importance sampling of the scene’s spatial spectrum, exploits the centrosymmetric conjugation property $F(-u,-v)=F^*(u,v)$ of real-valued images, and sequentially projects two $\pi/2$-phase-shifted sinusoidal patterns to obtain each Fourier coefficient in the most informative spatial-frequency bands. The reported consequence is a reduction in requisite patterns by two orders of magnitude compared with conventional SPI, while avoiding large inverse optimizations in favor of direct spectral acquisition followed by inverse Fourier transform [1504.03823].

These developments clarify a recurrent distinction in SPI research. One class of methods improves the conditioning of the inverse problem by imposing stronger priors, such as TV, sparse representation, or structured denoisers. Another class improves the measurement process itself through deterministic bases, better orderings, and importance sampling. A plausible implication is that much of SPI performance derives from the co-design of sensing and inversion rather than from either component in isolation.

## 3. Learned priors, uncertainty estimation, and deep reconstruction

Learned priors entered SPI first as explicit sparse models and later as deep neural reconstructions. A representative intermediate step is convolutional sparse coding (CSC)-enhanced SPI, which combines a global prior $\|\Psi x\|_1$ with a learned local prior $\sum_k\|s_k\|_1$ under the constraint
\[
\mathbf{x}=\sum_{k=1}^K \mathbf{s}_k\ast \mathbf{d}_k.
\]
Here the overcomplete convolutional dictionary is learned from natural images, and the resulting reconstruction is solved by ADMM. Experiments on synthetic and real data reported PSNR improvements of about $3.27$ dB to $11.51$ dB when CSC is added to TV, and about $5.04$ dB to $23.33$ dB when CSC is added to DCT, with the gain often more pronounced for DCT than for TV [1811.03455].

Deep learning then shifted emphasis from handcrafted priors to learned inverse mappings. SPI-GAN reconstructs from a crude minimum-$\ell_2$-norm estimate using a ResNet-like generator and a VGG-like discriminator, with a composite loss combining MSE, perceptual similarity, and adversarial terms. It reported $17.92$ dB PSNR and $0.487$ SSIM at a $5\%$ sampling ratio, about a $3$ dB PSNR gain over the prior state of the art, and reconstruction speeds supporting about $15$–$22$ fps depending on the sampling ratio [2107.01330]. BCS-UNet combined block compressive sensing with a fully convolutional reconstruction model, using a strictly binary measurement matrix suitable for DMD-based SPI and showing that a model trained on natural images could reconstruct images obtained from an SPI setup while being priorly trained on a different domain [2207.06746].

Deep unfolding and transformer-based models further integrated the physics of acquisition into the network architecture. HATNet unfolds tensor ISTA on a Kronecker SPI model into alternating tensor gradient descent and hybrid-attention multiscale denoising. On Set11 it reported PSNR/SSIM values of $27.98/0.8382$ at $4\%$, $32.26/0.9182$ at $10\%$, $37.24/0.9634$ at $25\%$, and $42.05/0.9838$ at $50\%$, while also reducing GPU memory and inference time relative to vectorized SPI through the Kronecker formulation [2404.05001].

Reliability, however, became a separate problem. Bayesian CNNs were introduced to approximate pixel-wise uncertainty in SPI reconstructions by minimizing a negative log-likelihood during training and using Monte Carlo dropout during prediction. The predicted uncertainty maps were reported to correlate with absolute reconstruction error, with most errors concentrated at image edges, and the framework remained informative across varying compression ratios and noise levels [2107.11678]. This supports the narrower but important claim that deep SPI reconstruction is not only an image-synthesis problem but also a confidence-estimation problem.

A later synthesis of data-driven and self-supervised approaches appears in SPI-DNIO, which combines a pretrained data-driven network with a deep image prior network in a dual-network iterative optimization loop. The stated motivation is that DIP-Net often requires thousands of iterations, while DD-Net performs optimally only when the target resembles the training set; SPI-DNIO uses the DD-Net output as initialization and refines it with measurement consistency, with experiments using $400$ iterations and reporting strong indoor and outdoor long-range performance [2511.22088].

## 4. Hardware realizations, spectral extension, and high-resolution operation

SPI hardware has expanded well beyond visible-light proof-of-concept systems. A large-area black phosphorus–molybdenum disulfide (bP-MoS$_2$) photodiode was used to build a high-resolution visible-to-extended-shortwave-infrared SPI system, achieving $1023\times768$ pixels in the visible and $512\times512$ pixels in extended SWIR. This was reported as a $64\times$ increase in pixel count over earlier van der Waals material SPI demonstrations limited to $64\times64$, with visible LEDs at $0.45$, $0.565$, and $0.78\,\mu\text{m}$ and a $1.55\,\mu\text{m}$ laser for SWIR imaging. The same work introduced compressed sampling based on a cyclic S-matrix, enabling efficient reconstruction through circular convolution and Fourier transforms, a $4\times$ reduction in imaging time, and a simple edge-detection procedure obtained by high-pass filtering the photodiode output voltage [2510.02673].

Near-UV SPI has also been demonstrated with a one-step-fabricated, lead-free K$_2$CuBr$_3$ photoconductor. Under $405$ nm illumination, the detector showed low dark current on the order of $10^{-10}$ A, rise and recovery times of $38.82\,\mu\text{s}$ and $61.94\,\mu\text{s}$, and successful reconstruction of near-UV images, with signal-to-noise ratio improving from $16.4$ to $31.7$ dB as illumination irradiance increased [2606.01731].

At the system level, several works address the long-standing resolution bottleneck. Full native DMD resolution of $1024\times768$ has been reported for sparse scenes using binary, differential, non-adaptive sampling and fast regularized inversion. In one implementation, $k=3002$ measurements at a compression ratio of about $0.4\%$ yielded an acquisition time of about $0.14$ s and reconstruction time of about $0.3$ s, with particularly strong performance when the field of view is limited but a priori unknown [2206.02510]. A related framework for spatially sparse scenes reported $1024\times768$ resolution, a compression ratio of $0.41\%$, and an acquisition rate of $6.8$ Hz at $22$ kHz DMD operation, with reconstruction latency comparable to acquisition time on a mid-tier desktop GPU [2509.01497].

Real-time and on-chip SPI has been pursued along a different axis. Instant single-pixel imaging (ISPI) implements the instant ghost imaging algorithm
\[
G_{\mathrm{IGI}}(x)=\frac{1}{2N}\sum_{n=1}^{N}\left(S_{n+1}-S_n\right)\left[I_{n+1}(x)-I_n(x)\right]
\]
on an FPGA, so reconstruction occurs during acquisition rather than afterward. Using a $20$ kHz DMD and $N=800$ measurements for a $32\times32$ image, the reported frame rate was $25$ fps with almost zero reconstruction time and strong robustness to slowly varying optical background noise [2002.00126].

| Platform | Reported regime | Reported result |
|---|---|---|
| bP-MoS$_2$ SPI [2510.02673] | Visible to ex-SWIR | $1023\times768$ visible, $512\times512$ ex-SWIR |
| K$_2$CuBr$_3$ SPI [2606.01731] | Near-UV, $405$ nm | SNR improved from $16.4$ to $31.7$ dB |
| DMD-native sparse-scene SPI [2206.02510] | High resolution | $1024\times768$, about $0.4\%$ compression |
| Real-time sparse-scene SPI [2509.01497] | High resolution, dynamic | $6.8$ Hz at $22$ kHz DMD operation |
| ISPI FPGA system [2002.00126] | On-chip real time | $25$ fps at $32\times32$ |

A common misconception is that SPI is intrinsically low-resolution or confined to monochrome visible-light imaging. Reported systems span full-color photon-counting SPI, visible-to-extended-SWIR SPI, near-UV SPI, and native-$1024\times768$ sparse-scene acquisition, all using a single detector and structured modulation [2109.02333], [2510.02673], [2606.01731], [2206.02510].

## 5. Color, motion, 3D calibration, and non-image-domain tasks

SPI has expanded from monochrome still imaging to multiplexed color, motion compensation, 3D metrology, and tasks that bypass image reconstruction altogether. Full-color photon-counting SPI integrates time-correlated single-photon counting (TCSPC) with time-division multiplexing. Three monochromatic pulsed beams at $480$ nm, $550$ nm, and $670$ nm are assigned preset delays, separated in the TCSPC histogram by about $24$ ns with peak widths of about $3$ ns, and decoded into RGB Hadamard measurements in a single round of measurement. For a $64\times64$ image, differential Hadamard acquisition uses $8192$ patterns at a DMD projection rate of $1000$ Hz, yielding an acquisition time of $8.192$ s; only about $2\%$ of the laser pulses generate a photon count, confirming operation in the single-photon regime [2109.02333].

Motion presents a fundamental challenge because SPI assumes a stationary scene during the pattern sequence. Multi-channel SPI for a composite motion target addresses this by splitting the signal into RGB wavelength channels, estimating multiple centroids, and inferring the target’s full rigid 2D motion state from translation and rotation. Using six Fourier localization masks interleaved with imaging masks and a DMD flip rate of $20$ kHz, the reported theoretical perception frame rate reaches up to $2222$ Hz, while the pseudo-inverse transformation method enables fast motion-compensated reconstruction for translation, rotation, periodic, and non-periodic motion within a two-dimensional plane [2504.11742].

Three-dimensional SPI introduces an additional calibration burden because the system does not directly observe a conventional 2D image. A calibration-field approach, CaliF, uses a single fringe image of a cube to infer a dense 3D pointmap, enabling both projector-side and SPDG-side calibration from one image rather than hundreds. The paper compared calibration-image burden as $143$ images for Ma et al., $296$ images for Niu et al., and $1$ image for the CaliF method, with reported real-experiment reconstruction errors of $0.166$ mm RMSE for a cube and $0.431$ mm RMSE for a sphere [2410.07545].

Several works treat SPI not primarily as an imaging modality but as a measurement-domain inference or computation engine. In Fourier SPI, a naive Bayes classifier was trained directly on the single-pixel intensity sequence, reaching over $80\%$ accuracy with only $13$ illuminations, corresponding to a sampling ratio of about $0.3\%$, even though the reconstructed image at that sampling level is extremely poor [1805.07582]. SPI has also been used as an optoelectronic decision system for interactive Tic-Tac-Toe, where nine one-square illumination patterns infer the $3\times3$ board state and a precomputed Minimax lookup table yields an unbeatable move policy [2205.03663]. In a further abstraction, an optical Ising machine encodes a combinational optimization problem as a grayscale weight map and uses evolutionary illumination patterns to solve number partition and graph maximum cut through single-pixel inner-product measurements [2210.05923].

These examples support a broader interpretation of SPI as a structured measurement platform. When the scene, task, or latent state is sufficiently constrained, the scalar measurement stream may be used for inference, control, or optimization without forming a conventional image.

## 6. Trade-offs, assumptions, and recurring limitations

Despite its diversity, SPI research is organized by a stable set of trade-offs. The central inverse problem is ill-posed because the number of measurements is far smaller than the number of image pixels, so performance depends on the balance among capture efficiency, computational complexity, and robustness to noise [1707.03164]. The practical application of SPI has repeatedly been described as restricted by low reconstruction quality and large measurement count, particularly for correlation-based methods and under aggressive undersampling [1811.03455].

Algorithmic gains often rely on assumptions that delimit the operating regime. CSC-enhanced SPI assumes that the target scene shares structural statistics with the training database, that the learned dictionary is representative enough, and that the image can be expressed well as CSC plus a global sparse transform model; the same work explicitly notes that only $20$ natural images were used for dictionary training, so performance could improve with more training data or class-specific dictionary learning [1811.03455]. Deep data-driven methods have analogous dependence on training distribution. SPI-DNIO states that DD-Net performs optimally only when the target closely resembles the features present in its training set, while DIP-Net is more adaptable but often requires thousands of iterations and can overfit noise without early stopping [2511.22088]. BCS-UNet, by contrast, reported that pretraining on natural images could still transfer to real SPI data, which suggests that learned priors can generalize across domains when the acquisition model and reconstruction architecture are matched carefully [2207.06746].

Hardware and scene assumptions are equally consequential. High-resolution real-time frameworks at $1024\times768$ are targeted primarily at spatially sparse scenes, line art, handwritten digits, or scenes with large empty regions; the iterative enhancement is more versatile but more noise-sensitive, whereas the neural network enhancement is faster and often more accurate on familiar sparse scenes but less general and can introduce artifacts on out-of-distribution content [2509.01497]. The near-UV K$_2$CuBr$_3$ detector must respond in the sub-$100\,\mu\text{s}$ regime for a $10$ kHz structured illumination sequence, and the bP-MoS$_2$ photodiode requires about $30\times$ higher optical intensity in SWIR/MWIR than in the visible because of lower responsivity [2606.01731], [2510.02673].

Noise robustness remains method dependent. TV and AP were reported as the most robust algorithms under measurement noise in a comparative study [1707.03164]. ISPI’s differencing-based robustness to optical background noise is explicitly conditioned on the background being a slow variation signal compared to the bucket signal [2002.00126]. For Bayesian deep SPI, uncertainty maps consistently highlight the edges of image features, where undersampling and noise make reconstruction most difficult [2107.11678].

A second common misconception is that SPI always requires full image reconstruction before any useful inference can be performed. Direct classification from the intensity sequence, measurement-domain edge extraction through high-pass filtering of the voltage stream, lookup-table game play, and optical Ising optimization all contradict that assumption within their stated operating conditions [1805.07582], [2510.02673], [2205.03663], [2210.05923].

Taken together, the literature indicates that SPI is best understood not as a single reconstruction algorithm but as a family of computational imaging systems built around structured illumination, one-dimensional sensing, and task-specific inversion. The technical frontier has therefore moved in several coupled directions at once: stronger priors, more structured measurements, broader spectral hardware, faster reconstruction, and tighter integration between sensing, inference, and control.

Source: https://www.emergentmind.com/topics/single-pixel-imaging-spi