Skip to content
DraconiticResearch
Search Sources API
201,683 studies31 sourcesUpdated 33 min ago
PreprintarXiv licencearXiv

Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations

Abstract

Decisions about dense populations depend on how much will cross a boundary by a deadline and when the first member arrives. Conventional radar forms a range-Doppler map, whose cells add noise and whose detections merge unresolved members. We introduce over-the-scene computation, where illumination makes the scene compute such functionals without resolving members. With random echo phases, a correlator's mean output energy sums member reflectivities weighted by a kernel set by the waveform and template. The waveform's ambiguity function is this computation's transfer function, determining computable functionals and their noise cost. One readout aggregates members over a small delay-Doppler area but along a line segment growing with duration, longest for the chirp of matching slope among constant-envelope waveforms. Members predicted to share a range lie on such a line, so a chirp's mean beat spectrum is the predicted range profile at a look-ahead horizon set by its rate. For unbiased estimation, a Cramer-Rao bound over all equal-energy waveforms favors resolving members above unit signal-to-noise ratio (SNR) and grouping weaker ones into unit-SNR sets. At 0.65 members per cell, -10 dB member SNR, and one sweep, the chirp's bin sum inside the boundary comes within 16% of this bound in root-mean-square error and, with 77 times fewer samples per horizon, outperforms every unbiased estimator from a coherent processing interval of equal dwell, bandwidth, and energy. No finite set of waveform-template probes determines an unconstrained Rayleigh-fluctuating population's first arrival, but bisection localizes it if first arrivals outweigh later arrivals' sidelobes.

Related

  1. Fractional illumination and the optimal exponential rate in Hadwiger's covering conjecture
    Yegor Gorodzha
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  2. GPU-Accelerated Robust MA--RIS Pre-Optimization for Communication and Target Illumination
    Tran Le Dung, Ho Viet Duc Luong
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Fractional-Order Dynamic Illumination Adjustment for Low-Light Enhancement Using Luminance Segmentation
    Bao Chen, Tianlan Xiong, Juanjuan Gao +1
    Fractal and FractionalPeer-reviewedCC BY 4.0Analysis & PDEsCrossref
  4. Intelligent Reflecting Surface Deployment for Low-Altitude Coverage: Illumination Geometry, Directional Characteristics, and Optimization
    Guoying Zhang, Qingqing Wu, Ailing Zheng +3
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. Relax and Follow: L0-Path Computation with L0-Bregman Relaxations
    Mhamed Essafri, Luca Calatroni, Emmanuel Soubies
    HALPreprintLicence not statedOptimisation & controlHAL
BibTeX
@misc{azimiabarghouyi2026overthescene,
  title = {{Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations}},
  author = {Seyed Mohammad Azimi-Abarghouyi and Christopher G. Brinton},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.07732},
  eprint = {2611.07732},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.07732},
}
RIS
TY  - UNPB
TI  - Over-the-Scene Computation: Illumination-Programmed Functional Sensing of Unresolvable Populations
AU  - Seyed Mohammad Azimi-Abarghouyi
AU  - Christopher G. Brinton
PY  - 2026
DA  - 2026/11/05
PB  - arXiv
DO  - 10.48550/arxiv.2611.07732
UR  - https://arxiv.org/abs/2611.07732
AB  - Decisions about dense populations depend on how much will cross a boundary by a deadline and when the first member arrives. Conventional radar forms a range-Doppler map, whose cells add noise and whose detections merge unresolved members. We introduce over-the-scene computation, where illumination makes the scene compute such functionals without resolving members. With random echo phases, a correlator's mean output energy sums member reflectivities weighted by a kernel set by the waveform and template. The waveform's ambiguity function is this computation's transfer function, determining computable functionals and their noise cost. One readout aggregates members over a small delay-Doppler area but along a line segment growing with duration, longest for the chirp of matching slope among constant-envelope waveforms. Members predicted to share a range lie on such a line, so a chirp's mean beat spectrum is the predicted range profile at a look-ahead horizon set by its rate. For unbiased estimation, a Cramer-Rao bound over all equal-energy waveforms favors resolving members above unit signal-to-noise ratio (SNR) and grouping weaker ones into unit-SNR sets. At 0.65 members per cell, -10 dB member SNR, and one sweep, the chirp's bin sum inside the boundary comes within 16% of this bound in root-mean-square error and, with 77 times fewer samples per horizon, outperforms every unbiased estimator from a coherent processing interval of equal dwell, bandwidth, and energy. No finite set of waveform-template probes determines an unconstrained Rayleigh-fluctuating population's first arrival, but bisection localizes it if first arrivals outweigh later arrivals' sidelobes.
ER  -