---
title: Empty-Signal Detection (ESD)
url: https://www.emergentmind.com/topics/empty-signal-detection-esd
type: topic
---

# Empty-Signal Detection (ESD)

Empty-Signal Detection (ESD) denotes the problem of deciding whether an observation is empty or non-empty, with the meaning of “empty” determined by the application domain. In the literature considered here, emptiness refers to an empty reference mask in medical image segmentation [2209.13008], a vacuum input at a quantum communication receiver [2509.15884], signal absence at all sensors in a network [1311.2336], or the absence of a Zero-Energy-Device beacon in ambient backscatter reception [2504.10695]. The practical role of ESD therefore varies: it may replace overlap scoring by classification-style evaluation, suppress dark-count-induced quantum bit errors before message measurement, drive a sequential hypothesis test, or set a Neyman–Pearson decision threshold. This suggests a family of domain-specific procedures unified by one principle: empty observations must be handled explicitly rather than absorbed into ordinary downstream inference.

## 1. Domain-specific meanings of emptiness

In medical image segmentation, an empty reference annotation means that the ground-truth mask contains no positive voxels. The USE-Evaluator framework treats such cases as qualitatively different from ordinary segmentation examples because overlap and surface metrics may be undefined, unstable, or clinically uninformative when the reference is empty, very small, or uncertain [2209.13008]. The same source also distinguishes low-signal pathology, where weak imaging contrast or poorly defined boundaries produce uncertain annotations and small lesion masks.

In quantum communication, empty signals are pulses that arrive at the receiver with no photon in the message-encoding degree of freedom. The quantum ESD proposal separates photon-existence information from the message-encoding degree of freedom by placing the existence flag on an auxiliary degree of freedom, so that vacuum events can be identified and excluded before message processing [2509.15884].

In unstructured sequential testing for sensor networks, emptiness is the null hypothesis that signal is absent everywhere. The alternative is composite: signal is present somewhere, but the subset of affected sensors is unknown and may be any non-empty subset of the network [1311.2336].

In ambient backscatter detection for Zero-Energy-Devices, emptiness is the hypothesis that no beacon is present, or that the device is transparent so that the backscatter term is zero. The detector must then distinguish that case from the presence of a coded backscatter beacon using non-coherent processing and an NP threshold selected for a target false alarm probability [2504.10695].

These usages are not interchangeable. In one case ESD is an evaluation protocol, in another a receiver-side physical-layer filter, in another a sequential fusion rule, and in another a classical detection test. A common misconception is therefore to treat ESD as a single algorithmic template. The cited work instead supports a broader interpretation in which ESD is a recurring decision problem instantiated differently across sensing and communication systems.

## 2. Decision structures and operational consequences

Across the four settings, ESD is implemented by explicit branching rules rather than by leaving empty cases inside a generic score.

| Domain | Empty condition | Operational consequence |
|---|---|---|
| Medical image segmentation | Ground-truth mask empty | Evaluate with image-classification metrics; report segmentation metrics as NA for truly empty cases |
| Quantum communication | Incoming signal vacuum in the message DOF | Discard events classified as empty before message measurement |
| Sensor networks | All sensors observe noise under $H_0$ | Stop sequentially for the null when evidence for signal absence is sufficient |
| Ambient backscatter | ZED absent or transparent | Threshold a detection statistic at a target false alarm probability |

In the segmentation setting, the recommended branch is between empty and non-empty cases. Empty cases are assessed by specificity, false positive rate, negative predictive value, positive predictive value, and balanced accuracy, while overlap or distance metrics are not reported for truly empty ground truth [2209.13008]. In the quantum setting, the branch is implemented through a $k$-of-$n$ auxiliary-measurement rule: a received event is accepted as non-empty only if at least $k$ out of $n$ auxiliary measurements report $|1\rangle$ [2509.15884]. In the sensor-network setting, the branch is sequential, with one stopping rule favoring $H_0$ and another favoring $H_1$ [1311.2336]. In ambient backscatter, the branch is classical NP detection based on a Gaussian test statistic and a threshold fixed by the desired $P_{FA}$ [2504.10695].

This shared structure clarifies why ordinary downstream metrics often fail in empty regimes. If emptiness is not handled separately, one obtains undefined overlap scores, dark-count-dominated QBER, intractable subset enumeration, or false-alarm behavior uncontrolled by design. The individual literatures differ in implementation, but each makes emptiness a first-class state of the system.

## 3. Quantum communication: auxiliary-DOF verification of non-vacuum events

The quantum ESD scheme is receiver-side and uses an auxiliary degree of freedom $L$ that is independent of the message degree of freedom $C$. The message qubit is denoted $\rho_C \in \mathbb{H}_C^2$, while the auxiliary degree of freedom is treated as a qutrit with basis $\{|0\rangle, |1\rangle, |\emptyset\rangle\}$, where $|\emptyset\rangle$ denotes vacuum in $L$ [2509.15884]. For a non-empty incoming signal, the receiver prepares
$$
\rho_C \otimes |1\rangle\langle 1|_L \otimes \left(\bigotimes_{i=1}^n |0\rangle\langle 0|_{L_i}\right),
$$
and then applies $n$ cascaded controlled gates $C(F)$ with $L$ as control and $L_i$ as targets.

The core decision rule is based on projective measurements of the auxiliary targets in the $\{|0\rangle,|1\rangle\}$ basis. Only $|1\rangle$ outcomes are registered, the control $L$ is discarded, and the message degree of freedom $C$ proceeds intact. An event is accepted as non-empty if at least $k$ of the $n$ auxiliary measurements return $|1\rangle$; otherwise it is rejected as empty. Because the gates act only on $L$ and $L_i$, the message state remains $\rho_C$ after the auxiliary operations and measurements [2509.15884].

The paper defines single-auxiliary acceptance probabilities for non-empty and vacuum inputs,
$$
P_s = (1-y)\left[P(\eta + (1-\eta)d) + (1-P)d\right] + yd,
$$
$$
Q_s = (1-y)\left[e_P(\eta + (1-\eta)d) + (1-e_P)d\right] + yd,
$$
and corresponding binomial-tail acceptance probabilities
$$
P_{\ge k|n} = \sum_{m \ge k} {n \choose m} P_s^m (1-P_s)^{n-m},
\qquad
Q_{\ge k|n} = \sum_{m \ge k} {n \choose m} Q_s^m (1-Q_s)^{n-m}.
$$
False acceptance and false rejection are then
$$
\alpha_{FA} = Q_{\ge k|n}, \qquad \alpha_{FR} = 1 - P_{\ge k|n}.
$$

The central feasibility condition is
$$
|\langle 1|F|0\rangle|^2 > e_P - \epsilon,
$$
which is equivalent to $P > e_P$ and to $P_s > Q_s$. Under this condition, increasing $n$ and choosing $k$ appropriately can make $Q_{\ge k|n}/P_{\ge k|n}$ arbitrarily small, so that the post-filter non-empty signal rate
$$
NESR = \frac{t P_{\ge k|n}}{t P_{\ge k|n} + (1-t)Q_{\ge k|n}}
= \frac{1}{1 + \frac{1-t}{t}\frac{Q_{\ge k|n}}{P_{\ge k|n}}}
$$
approaches $1$ even when the channel transmission rate $t$ is arbitrarily small [2509.15884].

The operational motivation is suppression of QBER growth caused by dark counts when empty signals dominate at long distance. With ESD, the QBER is expressed as
$$
QBER = \frac{ NESR \cdot e_t + (1-NESR) \cdot e_l}{ NESR \cdot (e_t + c_t) + (1-NESR) \cdot (e_l + c_l)},
$$
so vacuum-induced errors are attenuated as $NESR \to 1$. Simulations in the paper use $\eta = 0.78$, $d = 10^{-7}$, $e_P = 0.2\%$, $e_C = 1.5\%$, $y = 1-e^{-5}$, and $C(F)=\mathrm{CNOT}$. Under those settings, with $n=7$, $k=3$, and $P=0.99$, NESR increases by $8$ orders of magnitude and QBER remains below $3\%$ at $t=10^{-13}$; with $P=0.5$, NESR increases by $7$ orders of magnitude and QBER remains below $3\%$ at $t=10^{-12}$ [2509.15884].

The phrase “arbitrarily long-distance” is technically qualified in this work. The paper states that ESD does not change the repeaterless secret-key capacity, does not overcome the PLOB bound, and may leave the secret key rate extremely low because both acceptance and channel transmittance can vanish. The claim is instead that QBER can be kept within the secure regime for arbitrary distance in principle, provided a valid ESD block exists and the message-channel error satisfies the stated corollary bound on $e_C$ [2509.15884].

## 4. Sensor networks: unstructured sequential testing of empty versus non-empty activation

In the sensor-network formulation, ESD is cast as a sequential hypothesis test with a simple null and a composite alternative. There are $K$ sensors, observations are independent across sensors, and the local log-likelihood ratio process is
$$
Z_t^k = Z_{t-1}^k + \log \frac{f_1^k(X_t^k)}{f_0^k(X_t^k)}, \qquad Z_0^k := 0.
$$
The empty-signal hypothesis is
$$
H_0:\; f^k = f_0^k,\quad 1 \le k \le K,
$$
while under the non-empty hypothesis the signal is present in an unknown subset $A$ with $1 \le |A| \le K$ [1311.2336].

The proposed global procedure uses two one-sided stopping rules. The downward statistic for $H_0$ is
$$
\check{T}_A := \min\{t:\check{Z}_t \le -A\}, \qquad \check{Z}_t := \max_{1 \le k \le K} Z_t^k.
$$
The upward statistic for $H_1$ is
$$
\hat{T}_B := \min\{t:\hat{Z}_t \ge B\}, \qquad \hat{Z}_t := \sum_{k=1}^K \hat{Z}_t^k,
$$
where the local statistics $\hat{Z}_t^k$ satisfy
$$
\hat{Z}_t^k \le M_t^k := \max_{1 \le s \le t} Z_s^k
$$
and
$$
\hat{Z}_t^k \ge \max\{Z_t^k - \Delta_k,\,0\}.
$$
The fusion center stops at
$$
T^* := \min\{\hat{T}_B,\check{T}_A\},
$$
with decision $d^*=1$ if $\hat{T}_B \le \check{T}_A$ and $d^*=0$ otherwise [1311.2336].

Thresholds are selected as
$$
A = |\log \beta|, \qquad B = F^{-1}(\alpha),
$$
where
$$
F(x) := e^{-x}\sum_{j=0}^{K-1}\frac{x^j}{j!}, \qquad x>0,
$$
is the survival function of an Erlang random variable with rate $1$ and shape $K$. With these thresholds, the paper proves that the type-I error is bounded by $\alpha$ and the worst-case type-II error by $\beta$, so $(T^*,d^*) \in C(P)$ [1311.2336].

The principal theoretical result is asymptotic optimality. Under $H_0$,
$$
\inf_{(T,d_T)\in C(P)} \mathbb{E}_0[T] \succ \frac{|\log \beta|}{\min_{1 \le k \le K} I_0^k},
\qquad
\mathbb{E}_0[T^*] \prec \frac{A}{\min_{1 \le k \le K} I_0^k},
$$
while under $H_1$, for any affected subset $A$,
$$
\inf_{(T,d_T)\in C(P)} \mathbb{E}_1^A[T] \succ \frac{|\log \alpha|}{I_1^A},
\qquad
\mathbb{E}_1^A[T^*] \prec \frac{B + \sum_{k \in A}\Delta_k}{I_1^A}.
$$
As $\alpha,\beta \to 0$ with $|\log \alpha|/|\log \beta| \to \text{constant} > 0$, the proposed test minimizes expected sample size asymptotically both under the null and uniformly over all non-empty subsets [1311.2336].

A distinctive feature of this ESD formulation is communication efficiency. The downward side is one-shot: each sensor transmits at most once when its local LLR crosses below $-A$. The upward side can be implemented by level-triggered sampling,
$$
\tau_n^k := \inf\{t \ge \tau_{n-1}^k:\; Z_t^k - Z_{\tau_{n-1}^k}^k \ge \Delta_k\}, \qquad \tau_0^k := 0,
$$
with either transmitted LLR increments or a one-bit scheme
$$
\hat{Z}_t^k := \Delta_k N_t^k.
$$
The paper shows that the one-bit scheme preserves asymptotic optimality under finite second moments, while computation remains $O(K)$ per time step and communication can be made sparse by increasing $\Delta_k$ slowly relative to $|\log \alpha|$ [1311.2336].

This formulation makes explicit that, in a network setting, ESD is not merely detection of a weak signal. It is detection of non-emptiness under uncertainty about where the signal is located, combined with stopping-time optimality and communication constraints.

## 5. Ambient backscatter: Neyman–Pearson ESD for Zero-Energy-Device beacons

For ambient backscatter Zero-Energy-Devices, ESD is the binary test of “no beacon present” versus “beacon present,” implemented on LTE/4G reference-signal observations at a smartphone receiver [2504.10695]. The received complex baseband sample on subcarrier $k$ and RS index $l$ is
$$
y(k,l) = e^{j\phi(k,l)} \sqrt{P_u}\left(\Gamma(k) + \Lambda(k)\Phi(k)\,x(k,l)\right) + \alpha(k,l),
$$
where $x(k,l)\in\{0,1\}$ denotes reflective versus transparent ZED state, and $\alpha(k,l)\sim \mathcal{CN}(0,\sigma^2)$.

Under $H_0$, the ZED is absent or transparent so the backscatter term is zero. Under non-coherent magnitude processing,
$$
|y(k,l)| \approx \sqrt{P_u}\,|\Gamma(k)| + \alpha_r(k,l),
$$
with $\alpha_r(k,l)\sim \mathcal{N}(0,\sigma^2/2)$. Under $H_1$,
$$
|y(k,l)| \approx \sqrt{P_u}\left(|\Gamma(k)| + \gamma(k)\right) + \alpha_r(k,l),
$$
where
$$
\gamma(k) = \mathrm{Re}\big(\Lambda(k)\Phi(k)e^{-j\varphi(\Gamma(k))}\big).
$$
The assumptions used are $|\Gamma(k)| \gg |\Phi(k)\Lambda(k)|$ and $\sqrt{P_u}|\Gamma(k)| \gg |\alpha|$ [2504.10695].

The detector exploits two orthogonal chip sequences $c_0$ and $c_1$ and corresponding pseudo-filters $g_0(t)$ and $g_1(t)$. Over a bit window, normalized non-coherent correlator outputs are formed as
$$
e_i(n) = \sum_{l:\, t(l)\in [t_n,t_n+T^b]}
\frac{y(k,l)}{a_i(n)}\,\mathds{1}_{x_i(t(l))=0}
-
\frac{y(k,l)}{b_i(n)}\,\mathds{1}_{x_i(t(l))=1}.
$$
If the active bit is $i$ and $j=1-i$, then
$$
e_i(n) = \sqrt{P_u}\,\gamma(k) + \alpha_i(n), \qquad e_j(n)=\alpha_j(n),
$$
with real-valued Gaussian noise terms whose variances depend on $a_i(n)$ and $b_i(n)$ [2504.10695].

A per-bit contrast is then defined as
$$
\tilde{\eta}(n) = |e_i(n)|^2 - |e_j(n)|^2 - \epsilon(n),
$$
where
$$
\epsilon(n)=\sigma^2\left(\frac{1}{a_i(n)}+\frac{1}{b_i(n)}-\frac{1}{a_j(n)}-\frac{1}{b_j(n)}\right).
$$
This is stated to be an unbiased ML estimator of the backscatter path power $\eta^2(k)=P_u|\gamma(k)|^2$. Correlation with the sync bit sequence $b$ yields
$$
R(n)=\frac{1}{N_b}\sum_{m=0}^{N_b-1}(2b_m-1)\left[|e_{b_m}(n+m\delta t)|^2-|e_{1-b_m}(n+m\delta t)|^2\right]-\epsilon(n+m\delta t).
$$
For large $N_b$, $R(n_0)$ is approximately Gaussian at the aligned beacon start $n_0$, with mean $\eta^2(k)$ under $H_1$ and mean $0$ under $H_0$ [2504.10695].

The NP-optimal multi-subcarrier statistic is
$$
T(\mathbf{R}) \triangleq R_M = \frac{1}{K}\sum_{k=1}^{K}\frac{R(n_0,k)}{\lambda_{n_0}(k)} \mathop{\gtrless}_{H_0}^{H_1} r^*,
$$
with
$$
R_M|H_0 \sim \mathcal{N}(0,\mathrm{var}), \qquad R_M|H_1 \sim \mathcal{N}(\mu_1,\mathrm{var}),
$$
where
$$
\mathrm{var} = \frac{\sigma^2}{K}\sum_{k=1}^{K}\frac{1}{\lambda_{n_0}(k)},
\qquad
\mu_1 = \frac{1}{K}\sum_{k=1}^{K}\frac{\eta^2(k)}{\lambda_{n_0}(k)}.
$$
For a target false alarm probability,
$$
P_{FA} = Q\!\left(\frac{r^*}{\sqrt{\mathrm{var}}}\right),
\qquad
r^* = \sqrt{\mathrm{var}}\,Q^{-1}(P_{FA}),
$$
and the detection probability is
$$
P_D = Q\!\left(\frac{r^*-\mu_1}{\sqrt{\mathrm{var}}}\right).
$$

The experimental setup uses FIT/CorteXlab in a two-node configuration, with bandwidth $B=2.5$ MHz, FFT length $128$, cyclic prefix length $8$ subcarriers, OFDM symbol duration including CP $T^{ofdm}=57.6\,\mu s$, FSK modulation with $f_0=125$ Hz and $f_1=500$ Hz, a $4$th-order Butterworth low-pass filter with cutoff $f_{cf}=100$ Hz, and $K=6$ observed subcarriers. A Barker $7$ code $bc_+(7)=[0001101]$ is used in the sync sequence [2504.10695]. The resulting combined statistic exhibits clear peaks, and the paper reports an experimental peak-to-lobe ratio of approximately $11$ dB.

A recurrent issue in this domain is the trade-off between stringent false-alarm control and detection probability. The paper makes this relation explicit through the NP threshold formula: lowering $P_{FA}$ raises $r^*$ and therefore reduces $P_D$ unless $\mu_1$ is increased by larger $K$, larger $L$, longer $N_b$, or lower $\sigma^2$ [2504.10695].

## 6. Medical image segmentation: ESD as explicit handling of empty reference annotations

In the USE-Evaluator framework, ESD is not a new segmentation model but a recommendation for evaluation and optimization when reference annotations are uncertain, small, or empty. The motivating problem is a mismatch between public datasets and clinical practice: BraTS 2019 is characterized as a high-signal benchmark with certain, larger, and no empty reference annotations, whereas clinical datasets may include low-signal pathology with uncertain, small, or empty ground truth [2209.13008]. Under those conditions, common overlap metrics can fail to represent clinical value.

The central operational claim is that “very small and empty reference annotations are better evaluated with image-classification metrics” [2209.13008]. For empty ground-truth masks, the synthesis recommends identifying emptiness explicitly and assessing it as an ESD classification problem. If $G$ is empty and the prediction $P$ is also empty, overlap formulations such as Dice and IoU are mathematically undefined in set form because numerator and denominator are both zero; these cases should instead count as correct absence in the classification subtask, and segmentation metrics should be marked as not applicable. If $G$ is empty and $P$ is non-empty, the result is a false detection contributing to false positive rate rather than a clinically meaningful segmentation error [2209.13008].

For non-empty but very small masks, the same source emphasizes the instability of overlap metrics. Dice,
$$
\mathrm{Dice} = \frac{2|P \cap G|}{|P|+|G|} = \frac{2TP}{2TP+FP+FN},
$$
and IoU,
$$
\mathrm{IoU} = \frac{|P \cap G|}{|P \cup G|} = \frac{TP}{TP+FP+FN},
$$
become highly sensitive to small voxel-level perturbations when $|G|$ is tiny. Hausdorff distance and surface-based metrics are also undefined if either boundary set is empty. The proposed remedy is stratified evaluation: use classification-style ESD metrics for empty and very small annotations, and evaluate segmentation quality separately on non-empty cases [2209.13008].

For non-empty cases, the preferred metric is Surface Dice at Tolerance,
$$
\mathrm{Surface\ Dice}_\tau(P,G)=
\frac{|\{x\in S(P): d(x,S(G))\le \tau\}| + |\{y\in S(G): d(y,S(P))\le \tau\}|}{|S(P)| + |S(G)|},
$$
which is described as facilitating clinically meaningful evaluation better than classical overlap metrics when annotations are uncertain, small, or empty [2209.13008]. The rationale given is reduced sensitivity to small boundary shifts and greater independence from reference volume size.

The framework also introduces a U-score to quantify uncertainty in reference annotations. The available description does not specify the exact U-score formula, but it explicitly validates the USE-Evaluator for models trained on uncertain annotations and motivates uncertainty-aware losses or weighted Soft Dice when confidence maps are available [2209.13008]. This leaves the exact operationalization of uncertainty as a domain-dependent component rather than a fixed universal definition.

A key misconception addressed by this work is that a single pooled Dice score remains adequate when empty or tiny lesions are common. The paper argues the opposite: pooled overlap scores can be misleading because they collapse detection and segmentation into one number, while empty cases require classification-style reporting and non-empty cases require boundary-aware or uncertainty-aware segmentation evaluation [2209.13008].

Source: https://www.emergentmind.com/topics/empty-signal-detection-esd