One Photon, Many Worlds: Posteriors and Predictions with Single-Photon Cameras
Authors: Haejoon Lee, Mohit Gupta, Vijayakumar Bhagavatula, Aswin C. Sankaranarayanan
Organizations: Carnegie Mellon University · Carnegie Mellon University, Pittsburgh, PA, USA · University of Wisconsin-Madison · University of Wisconsin-Madison, Madison, WI, USA
Single-photon avalanche diode (SPAD) cameras operate fundamentally differently from conventional cameras due to their photon-counting nature. Each frame produces a binary image: pixels report zero if no photons arrived during exposure, and one if one or more photons arrived. Reconstructing a scene or inferring its properties from a single binary frame is difficult because many different images could produce the same measurement; thus, the inverse problem is fundamentally one-to-many. As we gather more binary measurements, the inherent uncertainty associated with the inverse problem and any associated inference diminishes. With sufficient photon counts, photon noise becomes negligible relative to the signal mean, enabling near-deterministic scene recovery and inference. This work characterizes the transition from stochastic to near-deterministic scene understanding as photon budget increases, analyzing how the stochasticity in photon arrival affects downstream inference tasks. Technically, we develop a conditional generative framework based on a Hypergeometric frame-thinning process for accumulated binary SPAD measurements. Generative models capture the one-to-many nature of photon-starved inverse problems, enabling empirical characterization of how this ambiguity diminishes with increasing measurements and its impact on downstream tasks like character recognition, QR code decoding, and facial analysis.
Figures & tables
Figure 1. SPAD cameras operated in binary-frame mode record at most one detection per pixel per exposure. The top four rows shows samples from the conditional posterior given a single (simulated) binary SPAD frame, shown in the first column where each pixel has measured, at most, one photon . In such photon starved regimes, the inverse problem of image reconstruction is one-to-many, leading to many worlds of possibilities in the output. This uncertainty reduces as we increase the number of binary SPAD frames, as seen in subsequent rows. The conditional samples were produced by training diffusion models for each of the four applications (digits, edges, QR codes, and faces), and empirically characterizes how uncertainty in photon arrivals map to uncertainty in reconstruction and inference. In the case of the faces data, notice how different features like sunglasses, gender, facial expression, and identity take different number of frames to resolve correctly.
Figure 2. Example MNIST images simulated with the SPAD sensor model. The maximum expected photon level per binary frame is set to τ=0.01 .
Figure 3. Deterministic restoration under photon starvation. For very small N , the same low-count SPAD observation is compatible with many high-count targets. A deterministic denoiser trained with a L2 reconstruction loss produces a single averaged output, which can be blurry and cannot represent the remaining conditional uncertainty.
Figure 4. The overall process of conditional generator for SPAD image restoration.
Figure 5. Overview of the proposed latent binomial model for a single step. The prior encoder takes in the source SPAD image xt+1 and the frame counts Nt and Nt+1 to predict the parameters of the Gaussian prior distribution of the latent variable z . The posterior encoder takes in the source SPAD image xt+1 , the increment image dt , and the frame counts Nt and Nt+1 to predict the parameters of the Gaussian posterior distribution. The decoder with a U-Net architecture takes in xt+1 , the frame counts Nt and Nt+1 , and z to predict the photon-detection probability map ρθ . During sampling, z is drawn from the prior, yt,i∼Binomial(Mt,ρθ,i) , and xt=xt+1+yt . Here z denotes the set of latent groups described in Section 4.3 .
xt
∼i∏Binomial(Nt,ρi),
xt+1
∼i∏Hypergeometric(Nt,xt,i,Nt+1)
ALGORITHM 1 Training the shared pairwise SPAD reverse model
z∼pψ(⋅∣xt+1,Nt,Nt+1)
ALGORITHM 2 Sampling by anchor-point Markov reversion
Figure 6. Conditional generation results for synthetic edge images. Each column fixes the same conditioning measurement xk at a given frame count Nk , followed by several high-count samples x1 generated conditioned on xk , their sample mean, and their sample normalized standard deviation.
Figure 7. Conditional generation results on a real SPAD capture of a printed edge target. For each column, the figure shows the generated samples, their sample mean, and their sample standard deviation. At the rightmost corner, we show the photo of the printed target.
Figure 8. Downstream edge-prediction results for generated samples as a function of the number of conditioning SPAD frames Nk . The red dotted line denotes performance on high-count target SPAD images with N1=10,000 frames.
Figure 9. Conditional generation results for MNIST. For each fixed conditioning measurement xk , the figure shows generated high-count samples, their sample mean, and their sample standard deviation.
Figure 10. Classification accuracy of generated MNIST samples as a function of the number of conditioning SPAD frames Nk .
Figure 11. Conditional generation results with real captures in OCR task. We exhibit the restored grid of digits with selected number of measurements.
Figure 12. Conditional QR-code generation results from the multistep model. Each column fixes the conditioning measurement xk at a given frame count Nk , followed by generated samples, their sample mean, and their sample standard deviation. Each standard deviation map is normalized to have maximum value of 1.
Figure 13. QR-code decoding accuracy of multistep generated samples compared with raw SPAD measurements. The generative model reaches stable decoding accuracy with far fewer conditioning frames.
Figure 14. Facial-geometry errors for generated FFHQ samples. We compare MediaPipe landmarks and head pose estimated from generated samples against those estimated from high-count target images with N1=100,000 frames.
Figure 15. MediaPipe landmark visualizations on generated FFHQ samples and raw SPAD measurements. The generated samples support landmark detection at much lower frame counts than the raw SPAD inputs.
Figure 16. Conditional generation results for real captured face images. For each fixed conditioning measurement xk , the figure shows generated high-count samples, their sample mean, and their sample standard deviation.
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 17. QR-code decoding accuracy of generated samples as a function of the number of conditioning SPAD frames Nk .
Figure 18. Comparison of single-step and multistep generated QR-code samples from the same low-count conditioning measurements.
Viterbi Faculty of Electrical and Computer Engineering, Technion-Israel Institute of Technology, Haifa 3200003, Israel · Department of Computer Sciences, University of Wisconsin-Madison, Madison, WI 53706, USA