Split Covariance Intersection (SCI)

• Split Covariance Intersection (SCI) is a fusion methodology that decomposes local error covariances into uncorrelated and unknown correlated parts, ensuring consistent and optimal estimation.
• It employs convex optimization over weight parameters to minimize cost functions such as the trace or log-determinant, producing tighter bounds than standard Covariance Intersection.
• SCI is widely applied in multisensor fusion, distributed filtering, and robotics, offering up to 20-26% improvements in error bounds under partial independence assumptions.

Split Covariance Intersection (SCI) is a methodology for fusing multiple random vector estimates when the cross-covariances between estimation errors are unknown, but part of each covariance is known to be uncorrelated with the rest. SCI generalizes the standard Covariance Intersection (CI) approach by leveraging partial independence between components of the local error distributions, producing strictly less conservative fusion results while guaranteeing consistency. SCI is now established as the optimal conservative fusion rule under partial decorrelation assumptions, yielding provable improvements over CI in distributed and cooperative estimation, distributed filtering, and multisensor data fusion settings (Cros et al., 2023, Cros et al., 14 Jan 2025, Cros et al., 2024).

1. Problem Formulation and Motivation

In distributed or multisensor estimation, each agent (sensor, filter, or robot) forms an unbiased estimate $\hat x_i \in \mathbb R^n$ of a true state $x \in \mathbb R^n$, with associated error covariance $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$. The optimal linear fusion of these estimates would require the full centralized error covariance matrix, including all cross-covariances $P_{ij} = \mathbb E[(\hat x_i - x)(\hat x_j - x)^T]$. In practical networked systems, these cross-covariances are either computationally intractable or completely unknown.

Standard Covariance Intersection (CI) forms a conservative solution by treating the entire $P_i$ as potentially correlated with all others and produces a family of upper bounds for the fused covariance using a weight parameter $\omega_i \in [0,1]$:

$$B_{\mathrm{CI}}^{-1} = \sum_{i=1}^N \omega_i P_i^{-1}$$

However, in applications such as distributed Kalman filtering, process and measurement noise components are often statistically independent across agents, creating a decomposition:

$\tilde x_i = \tilde x_i^{(1)} + \tilde x_i^{(2)}$

where $$\mathbb E[\tilde x_i^{(2)}(\tilde x_j^{(2)})^T] = 0$$ for $i \neq j$. SCI exploits this partial independence, improving fusion performance and reducing conservatism relative to CI (Cros et al., 2023, Cros et al., 14 Jan 2025).

2. SCI Fusion Rule: Decomposition and Formulas

The SCI methodology decomposes each local error covariance as

$x \in \mathbb R^n$0

where $x \in \mathbb R^n$1 is the "unknownly correlated" component and $x \in \mathbb R^n$2 is the known mutually uncorrelated component. The fusion is then carried out by introducing convex weights $x \in \mathbb R^n$3 on the ($x \in \mathbb R^n$4)-simplex:

$x \in \mathbb R^n$5

The fused estimate is

$x \in \mathbb R^n$6

This procedure can be interpreted as CI applied to inflated, partially decorrelated block-covariances, where only the unknownly correlated parts are treated with maximal caution. This construction is supported by a minimal-volume ellipsoid argument showing that the SCI bound is the unique optimal conservative bound under these independence assumptions (Cros et al., 2023, Cros et al., 14 Jan 2025, Cros et al., 2024).

SCI parameters are selected by minimizing a monotone cost function $x \in \mathbb R^n$7 (e.g., $x \in \mathbb R^n$8 or $x \in \mathbb R^n$9) over the simplex, typically via convex or line search techniques (Li, 2021, Cros et al., 2024):

$P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$0

3. Optimality, Theoretical Properties, and Extensions

SCI is proven to be the family-optimal conservative fusion rule for two estimators under any monotone cost $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$1, circumscribing the minimal set of conservative covariance bounds for the admissible set of unknown cross-covariances (Cros et al., 2023, Cros et al., 14 Jan 2025). The SCI ellipsoids $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$2 are the unique tight circumscription of the reachable fusion volumes, with equality for every tangent direction.

SCI generalizes to the $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$3-estimate setting by extending the weight vector and performing the same decomposition, though the volume-optimality proof is most complete for $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$4 (Cros et al., 14 Jan 2025, Cros et al., 2024). The method can be extended to more general correlation structures, leading to "Extended SCI" (ESCI), which incorporates known correlated components such as common process noise—in these cases the admissible covariance set includes blocks with arbitrary (but known) inter-agent correlations (Cros et al., 14 Jan 2025, Cros et al., 2024).

SDP-based generalizations further unify SCI and CI under the "overlapping covariance intersection" (OCI) framework, enabling family-optimal solutions with broader admissible covariance constraint sets (Pedroso et al., 20 Mar 2026). In this setting, the SCI solution is recovered as a special case and parametrized as a convex semidefinite program.

4. Practical Implementation and Computational Considerations

The SCI update is computationally tractable as its crucial optimization is one-dimensional for the two-estimator case, or a convex program over the simplex for $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$5 (still low-dimensional in typical cooperative estimation problems) (Li, 2021, Cros et al., 2024). The key algorithmic steps are:

1. Obtain the local error covariance splits $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$6.
2. Exchange these with peer agents if distributed.
3. Solve for the optimal weights $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$7 minimizing the chosen cost.
4. Compute the fused information matrix and estimate using the SCI fusion formula.
5. Use Cholesky factorization for numerical stability, avoid ill-conditioning at simplex boundaries, and, for real-time applications, cache repeated matrix computations when applicable (Li, 2021).

Convexity of the cost functions (e.g., $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$8 or $P_i = \mathbb E[(\hat x_i - x)(\hat x_i - x)^T]$9) with respect to $P_{ij} = \mathbb E[(\hat x_i - x)(\hat x_j - x)^T]$0 is rigorously proved, enabling global optimization by efficient search or gradient-based methods (Li, 2021). For higher agent counts, modern SDP solvers (MOSEK, SDPT3) efficiently handle the OCI formulation (Pedroso et al., 20 Mar 2026).

5. Applications and Empirical Results

SCI has been applied in a range of settings where cross-covariance estimation is infeasible but statistical independence of measurement or process error is available. Key use cases include:

• Multirobot cooperative localization (Chang et al., 2021): SCI enables explicit decoupling of motion propagation, observation, and communication steps, maintaining bounded covariance even under severe communication losses. Empirical results on real and synthetic datasets demonstrate that SCI maintains accuracy and bounded error in sparse or failing communication topologies, outperforming standard CI and block-diagonal approximations.
• Visual-inertial SLAM and robot navigation (Fang et al., 2023): SCI robustly fuses temporally correlated visual tag measurements with inertial and odometry data, implementing measurement-adaptive modeling for outlier rejection and dynamic reinitialization in "kidnapping" scenarios. SCI achieves bounded and less-conservative localization error compared to EKF or standard CI.
• General distributed filtering and sensor fusion (Cros et al., 2023, Cros et al., 2024): SCI yields up to 20% tighter error bounds compared to CI, conservatively but efficiently exploiting knowledge of uncorrelated measurement noise terms.
• Extensions to ESCI (correlated component fusion) further lower conservatism (up to 26% lower posterior covariance trace in simulation benchmarks) by explicitly modeling process noise shared across agents (Cros et al., 14 Jan 2025).

6. Limitations and Current Directions

Limitations of standard SCI include the requirement that the uncorrelated blocks are strictly uncorrelated and have known covariances. SCI, like CI, can be conservative especially if the "uncorrelated" components are small relative to the total uncertainty. ESCI-type extensions improve performance when there are known correlated noise components (common process noise), but require access to the full second-order statistics of these components (Cros et al., 14 Jan 2025, Cros et al., 2024).

Full minimal-volume optimality of SCI is rigorously proved only for $P_{ij} = \mathbb E[(\hat x_i - x)(\hat x_j - x)^T]$1; extension to $P_{ij} = \mathbb E[(\hat x_i - x)(\hat x_j - x)^T]$2 remains an active research area (Cros et al., 14 Jan 2025, Cros et al., 2024). Additional work focuses on distributed solutions, real-time efficient algorithms for large-scale networks, and systematic exploitation of more general correlation structures via optimization frameworks such as OCI (Pedroso et al., 20 Mar 2026).

7. Summary Table: SCI, CI, and ESCI Fusion Formulas

Method	Fused Covariance Formula	Use-case/Assumptions
CI	$P_{ij} = \mathbb E[(\hat x_i - x)(\hat x_j - x)^T]$3	No knowledge of cross-covariances; maximal conservatism (Cros et al., 2023)
SCI	$P_{ij} = \mathbb E[(\hat x_i - x)(\hat x_j - x)^T]$4	Known uncorrelated (measurement) and unknown correlated (prediction) noise (Cros et al., 2023, Cros et al., 14 Jan 2025)
ESCI	$P_{ij} = \mathbb E[(\hat x_i - x)(\hat x_j - x)^T]$5	Extension: known, possibly correlated, process noise components (Cros et al., 14 Jan 2025)

SCI provides a principled, consistent, and computationally efficient approach for conservative fusion of distributed estimates under partial independence, with ongoing work extending its theoretical guarantees, algorithmic scalability, and practical reach in large-scale networked systems.