Sharp images from diffuse beams: factorisation of the discrete delta function
Discrete delta functions define the limits of attainable spatial resolution for all imaging systems. Here we construct broad, multi-dimensional discrete functions that replicate closely the action of a Dirac delta function under aperiodic convolution. These arrays spread the energy of a sharp probe beam to simultaneously sample multiple points across the volume of a large object, without losing image sharpness. A diffuse point-spread function applied in any imaging system can reveal the underlying structure of objects less intrusively and with equal or better signal-to-noise ratio. These multi-dimensional arrays are related to previously known, but relatively rarely employed, one-dimensional integer Huffman sequences. Practical point-spread functions can now be made sufficiently large to span the size of the object under measure. Such large arrays can be applied to ghost imaging, which has demonstrated potential to greatly improve signal-to-noise ratios and reduce the total dose required for tomographic imaging. The discrete arrays built here parallel the continuum self-adjoint or Hermitian functions that underpin wave theory and quantum mechanics.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Latent Painter
Latent diffusers revolutionized the generative AI and inspired creative art. When denoising the latent, the predicted original image at each step collectively animates the formation. However, the animation is limited by …
DenoisingBinary Matrix Factorisation and Completion via Integer Programming
Binary matrix factorisation is an essential tool for identifying discrete patterns in binary data. In this paper we consider the rank-k binary matrix factorisation problem (k-BMF) under Boolean arithmetic: we are given a…
Binary Matrix Factorisation via Column Generation
Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under B…
Dimensionality ReductionOptimality of the Discrete Fourier Transform for Beamspace Massive MU-MIMO Communication
Beamspace processing is an emerging technique to reduce baseband complexity in massive multiuser (MU) multiple-input multiple-output (MIMO) communication systems operating at millimeter-wave (mmWave) and terahertz freque…
SymmetricDiffusers: Learning Discrete Diffusion on Finite Symmetric Groups
Finite symmetric groups $S_n$ are essential in fields such as combinatorics, physics, and chemistry. However, learning a probability distribution over $S_n$ poses significant challenges due to its intractable size and di…
Denoising