In this section, we examine the impact of specific algorithmic choices on the resulting calculations. As before, we use
The algorithm description does not clarify how pixels are associated with the domain. While this may appear to be a minor technical detail, it has meaningful practical implications. The chosen method directly affects the calculation of both the background concentration and the downwind box — parameters to which the algorithm is highly sensitive.
To illustrate this issue, both the domain and each pixel can be treated as polygons. Under this framework, two interpretations of their relationship are possible: containment and intersection. A pixel can be considered part of the domain either when its polygon lies entirely within the domain, or when its polygon merely intersects the domain boundary. In the remainder of this report, these relationships are referred to as “CONTAINS” and “INTERSECTS”, respectively.
Another possible interpretation is to treat each pixel as a point defined by its centre. Under this approach, a pixel is considered within the domain if its centre lies inside the domain boundary. In the remainder of this report, this geometrical relationship is referred to as “CENTER”.

As illustrated in Figure 20 , the choice of geometrical relationship affects which pixels are included in the domain. Under INTERSECTS, all three pixels are included; under CENTER, only pixels (j,i) and (j,i+1) are included; and under CONTAINS, only pixel (j,i) falls within the domain. Physically, this means that using CENTER instead of CONTAINS effectively adds about half a pixel, and using INTERSECTS can add up to another half, depending on geometry. The exact magnitude of this change depends on pixel size, which varies with the viewing zenith angle. From mathematical perspective, these relationships are ordered: if CONTAINS is true, then CENTER is also true; and if CENTER is true, then INTERSECTS is necessarily true.
The impact of the chosen geometrical relationship on the background box pixel selection is illustrated in Figure 21 , and the resulting background values are summarised in Table 14. All calculated values satisfy the validity criterion of having more than 20 contributing pixels.

| Background geometry | Pixel count | Average |
|---|---|---|
| CONTAINS | 31 | 1812.373 |
| CENTER | 40 | 1812.343 |
| INTERSECTS | 54 | 1812.209 |
In the absence of independently measured background values, several approaches can be used to estimate the background. Common methods include:
- The average over a 0.5° x 0.5° box located 0.5° upwind of the source
Sadavarte, et al., 2021 - The average over a 0.5° x 0.5° box directly upwind of the source
Schneising, et al., 2023 - The domain median
Sadavarte, et al., 2021 - A data-driven quantile method, where the selected quantile is constrained such that the difference between it and the first decile is less than twice the measurement precision of the LGR UGGA
analyser for . See lines 221 - 241 of supplementary notes to Borchardt, et al., 2025 . - Proprietary background-estimation approaches (e.g.
Kayrros ,GHGSAT ).
In the supplementary notes of
All of the background-estimation methods described above are statistical in nature and reflect the absence of direct background measurements. However, the choice of background value critically influences both the determination of the downwind-box enhancement and the transect-level enhancement, making it one of the most sensitive parameters in plume-detection algorithms. To illustrate the non-linear consequences of selecting a particular background value, we consider a continuous synthetic mixing ratio profile representing the cross-plume signal along a transect, as defined in Equation 16 .
To approximate
In addition, we consider three different background values: 1841, 1839.5 and 1838

From this figure, we observe that with a background value of 1841.0
In this example, any further decrease of the background value below 1838
This example demonstrates that the choice of background value directly influences both the inferred plume shape and the resulting enhancement calculations.
In practice, this issue is further complicated by missing values (e.g., due to cloud cover). This requires maintaining a clear distinction between missing values—where no enhancement can be estimated—and valid measurements that fall below the background value, for which the enhancement should be set to zero while the pixel remains classified as valid.
The rotations selected by the algorithm under the different strategies are summarised in Table 15 and range from -10° to +15°, depending on the chosen configuration.
| Downwind box geometry | Downwind box mask | Rotation(°) |
|---|---|---|
| CONTAINS | NONE | 5.0 |
| CONTAINS | NEGATIVE | 10.0 |
| CENTER | NONE | -10.0 |
| CENTER | NEGATIVE | 15.0 |
| INTERSECTS | NONE | -5.0 |
| INTERSECTS | NEGATIVE | 10.0 |
The model downwind box lengths selected by the algorithm for the different geometrical relationships are listed in Table 16 and range from 77
| Downwind box geometry | Downwind box mask | Length |
|---|---|---|
| CONTAINS | NONE | 99.0 |
| CONTAINS | NEGATIVE | 99.0 |
| CENTER | NONE | 88.0 |
| CENTER | NEGATIVE | 99.0 |
| INTERSECTS | NONE | 77.0 |
| INTERSECTS | NEGATIVE | 99.0 |
The model downwind box widths selected by the algorithm for the different strategies are listed in Table 17 and range from 22
| Downwind box geometry | Downwind box mask | Width |
|---|---|---|
| CONTAINS | NONE | 44.0 |
| CONTAINS | NEGATIVE | 66.0 |
| CENTER | NONE | 66.0 |
| CENTER | NEGATIVE | 55.0 |
| INTERSECTS | NONE | 22.0 |
| INTERSECTS | NEGATIVE | 44.0 |
Finally, we calculated emission rates for all 18 combinations of geometrical relationships and masking strategies. The results, summarised in Table 18, range from 20.03
| Background geometry | Downwind box geometry | Downwind box mask | q |
|---|---|---|---|
| CONTAINS | CONTAINS | NONE | 32.256 |
| CONTAINS | CONTAINS | NEGATIVE | 34.041 |
| CONTAINS | CENTER | NONE | 60.584 |
| CONTAINS | CENTER | NEGATIVE | 30.222 |
| CONTAINS | INTERSECTS | NONE | 20.030 |
| CONTAINS | INTERSECTS | NEGATIVE | 31.618 |
| CENTER | CONTAINS | NONE | 32.356 |
| CENTER | CONTAINS | NEGATIVE | 34.164 |
| CENTER | CENTER | NONE | 60.740 |
| CENTER | CENTER | NEGATIVE | 30.326 |
| CENTER | INTERSECTS | NONE | 20.090 |
| CENTER | INTERSECTS | NEGATIVE | 31.717 |
| INTERSECTS | CONTAINS | NONE | 32.818 |
| INTERSECTS | CONTAINS | NEGATIVE | 34.731 |
| INTERSECTS | CENTER | NONE | 61.457 |
| INTERSECTS | CENTER | NEGATIVE | 30.799 |
| INTERSECTS | INTERSECTS | NONE | 20.370 |
| INTERSECTS | INTERSECTS | NEGATIVE | 32.165 |
The default case is shown in Figure 12 , while the differences between the two most extreme configurations are illustrated in Figure 23 and Figure 24 below.


It is difficult to establish what constitutes acceptable algorithmic stability. In the examples above, we introduced small perturbations in how pixels are classified. Changing the geometry from CONTAINS to CENTER, and from CENTER to INTERSECTS, effectively expands the domain by at most half the pixel diagonal (approximately 4.5