Fundamental Recovery Bounds for SPAD Signals under Stationary Flux
Single-photon avalanche diodes (SPADs) record light as a discrete stream of individual detections. The signal is stochastic. Its statistical structure depends on the sensor's operation mode: binary detection in fixed bins, timestamped detection in fixed bins, or free-running timestamped detection. We derive the likelihood score function for each of these three passive modes. From this single object, stem both fundamental limits of recovery (Cramer-Rao bounds) and practical recovery algorithms based on diffusion posterior sampling. The paper further generalizes fundamental limits to Bayesian Cramer-Rao lower bounds. This generalization makes use of a learned approximation of the score function of signal priors. In prior art, analyses and diffusion-based reconstruction for SPAD data have treated individual modes in isolation. Our unified treatment shows a qualitative high-flux gap between modes: binary counts saturate exponentially, while timestamped modes degrade only linearly. We further extend diffusion posterior sampling, previously restricted to binary SPAD data, to a full timestamped case using the suitable score function. We demonstrate experimentally that matching the score to the operation mode is beneficial for high-fidelity reconstruction. By tying the recovery bounds and diffusion to the score function, this work aims to establish a common foundation for both asking what is recoverable in single-photon sensing, and building methods that approach the bound.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On the accuracy of l1-filtering of signals with block-sparse structure
We discuss new methods for the recovery of signals with block-sparse structure, based on l1-minimization. Our emphasis is on the efficiently computable error bounds for the recovery routines. We optimize these bounds wit…
Randomized Space-Time Sampling for Affine Graph Dynamical Systems
This paper investigates the problem of dynamical sampling for graph signals influenced by a constant source term. We consider signals evolving over time according to a linear dynamical system on a graph, where both the i…
Improved RIP-Based Bounds for Guaranteed Performance of two Compressed Sensing Algorithms
Iterative hard thresholding (IHT) and compressive sampling matching pursuit (CoSaMP) are two types of mainstream compressed sensing algorithms using hard thresholding operators for signal recovery and approximation. The …
4kcompressed sensingSupport Recovery in the Phase Retrieval Model: Information-Theoretic Fundamental Limits
The support recovery problem consists of determining a sparse subset of variables that is relevant in generating a set of observations. In this paper, we study the support recovery problem in the phase retrieval model co…
RetrievalLearning to Suppress SPAD-based LiDAR Flare
Single-Photon Avalanche Diode (SPAD)-based Light Detection and Ranging (LiDAR) is emerging for autonomous vehicles due to its high sensitivity and precise depth sensing capabilities. However, flare caused by excessive ph…
Semantic SegmentationAutonomous VehiclesDepth EstimationPoint Clouds