betaFeedback

WorksComputer Science

Learning from Automatic 3D Gaussian Splatting Edits for Online Bayesian Scene Change Detection

Abstract

Online scene change detection requires integrating incoming observations to determine which regions have changed relative to a reference scene. We update change beliefs as new images arrive using generalised Bayesian evidence fusion. However, the prior probability of change and evidence models are unknown beforehand, and numerical Bayesian inference can be costly. We address these challenges by learning offline from automatic edits to a reference 3D Gaussian Splatting (3DGS) model. These edits generate labelled training views without manual annotations. Together with unchanged reference observations, they provide supervision for learning scene-specific evidence models and estimating the effective pixel prior and response statistics. Online prediction combines current evidence with historical support, while closed-form local Bayes factors, parameterized by the learned response statistics, update an accumulated 3D Gaussian field. Object-guided refinement produces the final change masks. Our method achieves state-of-the-art accuracy on PASLCD and CCS3D, with 67.64%67.64\% and 75.82%75.82\% mIoU, respectively. On PASLCD, the complete pipeline runs at 17.217.2,FPS over complete query sequences, the fastest among the evaluated online methods. Project page: https://changruizhu96.github.io/work/lego-scd/

https://changruizhu96.github.io/work/lego-scd/

Introduction

Scene change detection identifies physical changes in an environment from images captured at different times. When captures follow different camera trajectories, viewpoint and visibility differences complicate direct image comparison [16, 24]. A reference 3D Gaussian Splatting (3DGS) model [12] enables rendering the earlier scene at query viewpoints, providing a common view for comparison. Recent methods, such as MV3DCD [6] and O-SCD [8], integrate multi-view change cues by optimizing per-Gaussian change parameters, using batch and online processing, respectively.

In O-SCD, processing each new image requires iterative optimization using current and replayed observations, adding computational overhead during online inference. However, updating predictions as new evidence arrives does not inherently require repeated parameter optimization. This motivates updating change beliefs as new images arrive. Generalised Bayesian inference [4] provides a framework to combine a prior probability of change with incoming evidence.

Putting this idea into practice requires a prior and models that translate image differences into change evidence, which are unknown beforehand. We estimate these quantities offline using automatic reference 3DGS edits and unchanged observations. The edits turn the reference representation into a source of labelled training views, supporting scene-specific learning without manual change annotations. This reduces dependence on large labelled datasets for training a single evidence model across diverse scene appearances and changes. The learned evidence models also support efficient Bayesian evidence accumulation. Evaluating Bayesian evidence can require numerical integration or sampling [11], adding substantial cost when repeated for incoming frames. We apply the learned evidence models to unchanged reference observations to estimate response statistics, which parameterize a local Bayesian model that admits closed-form Bayes factors. We combine current evidence with historical support for prediction and use these Bayes factors to update the accumulated field for subsequent queries. These updates require neither online backpropagation nor past-image replay. Finally, object-guided refinement sharpens boundaries and completes missed object regions.

Our method achieves state-of-the-art accuracy on PASLCD and CCS3D, with 67.64% and 75.82% mIoU, respectively. On PASLCD, it outperforms O-SCD Online by 18.40 mIoU points while running at 17.2 FPS, compared with 14.4 FPS for O-SCD Online. Without refinement, the pixel output achieves 60.36% mIoU at 27.9 FPS. Our complete method also exceeds GS-Diff’s reported 64.40% mIoU [7] without requiring a post-change reconstruction. Given an existing reference reconstruction, automatic editing and model fitting take approximately 3.6 minutes per PASLCD instance on average.

Related Work

Scene change detection. Image-pair methods identify changes through correspondence and appearance comparison. GeSCF uses SAM features and mask matching without task-specific training [13], while SceneDiff compares objects across before–after captures using semantic and geometric information [24]. A reference 3D representation additionally enables comparisons at matched viewpoints and integration across observations. 3DGS-CD associates image-level detections across views [16], and SCaR-3D combines change cues through multi-view voting and pruning [29]. MV3DCD optimizes Gaussian change channels from a collection of post-change images [6]; O-SCD extends this approach to streaming queries, updating change parameters using current and replayed observations [8]. CL-Splats uses detected changes to guide local updates of a Gaussian scene representation [1]. GS-Diff instead compares geometry and colour between independently reconstructed scene states [7]. Our method accumulates evidence on the reference Gaussians without online optimization or past-image replay.

Learning from synthetic changes and 3D editing. CYWS constructs training pairs from object segmentation data [21], while CYWS-3D generates paired observations from synthetic 3D scenes [22]. Both use synthetic supervision to train change detectors that generalize to unseen scenes, requiring training data to cover diverse scene appearances and changes. Advances in 3DGS segmentation [26, 30], editing [5, 14], and relighting [15, 9] enable controlled scene modifications. RoboSplat edits Gaussian scenes and varies their appearance to train robot policies [25], while Zanjani et al. (2025) insert Gaussian objects into driving scenes to train 3D detectors. Given a prebuilt reference 3DGS and its associated unchanged observations, we generate labelled changes through automatic edits and fit scene-specific evidence models and a prior offline. This allows learning to focus on the appearance and response statistics of each reference scene, rather than requiring a single evidence model to cover many different environments.

Bayesian evidence accumulation. Bayesian updates provide a way to combine successive observations with existing beliefs. In scene mapping, POCD updates probabilistic object states using geometric and semantic information to track changes and maintain volumetric maps [19]. Bissiri et al. (2016) provide a generalised Bayesian framework that connects observations to belief updates through a loss function. For online time-series changepoint detection, Altamirano et al. (2023) construct generalised Bayesian updates with closed-form posterior parameters using diffusion score matching. We apply generalised Bayesian prediction to scene change detection, using offline-learned response statistics to evaluate local Bayes factors in closed form for accumulation on reference Gaussians.

Preliminaries

Given a reference 3D Gaussian Splatting (3DGS) model G\mathcal{G} and its registered reference images Iref\mathcal{I}_{\mathrm{ref}}, we detect changes in incoming query images It\mathcal{I}_t relative to the reference scene. Comparing each query with the reference requires rendering the earlier scene from the query viewpoint. Following O-SCD [8], we first match XFeat keypoints [18] between the query and registered reference images to obtain 2D–3D correspondences, then estimate the query pose using PnP-RANSAC. At the estimated pose, the reference 3DGS renders image I^t\hat{\mathcal{I}}_t through front-to-back alpha compositing [12]. Each Gaussian g∈Gg \in\mathcal{G} contributes a view-dependent colour ctgc_{tg} with projected opacity αtug∈[0,1]\alpha_{tug} \in[0,1] at pixel uu, giving I^t(u)=∑gatugctg\hat{I}_t(u) = \sum_g a_{tug}c_{tg}. Here, atug=αtug∏h≺tg(1−αtuh)a_{tug} = \alpha_{tug} \prod_{h \prec_t g}(1-\alpha_{tuh}) denotes its rendering contribution, with h≺tgh \prec_t g identifying Gaussians preceding it along the viewing ray. These contributions also connect pixels to reference Gaussians for evidence aggregation in § 4. The reference reconstruction remains fixed during online inference.

Comparing ItI_t with I^t\hat{I}_t produces the initial change cues. Following O-SCD, we compute a photometric difference from RGB L1L_1 and D-SSIM [23], and a semantic difference from the channel-averaged absolute difference between frozen SAM2 encoder features [20]. Per-image normalization and upsampling of the semantic difference produce pixel-aligned cues D~trgb\tilde{D}^{\mathrm{rgb}}_t and D~tsem\tilde{D}^{\mathrm{sem}}_t. Their average gives the initial difference response Rt0=12(D~trgb+D~tsem)∈[0,1]R^0_t = \frac{1}{2}(\tilde{D}^{\mathrm{rgb}}_t + \tilde{D}^{\mathrm{sem}}_t) \in[0,1], which serves as the input to our evidence learning and online inference. Appendix § 11.§ 2 provides the detailed cue construction and normalization.

Method

Problem Formulation and Overview

Image differences mix physical changes with rendering artifacts and illumination shifts. Our method uses generalised Bayesian inference to interpret these responses and accumulate change evidence. For query image ItI_t, current-view evidence CtC_t is constructed from the initial difference response Rt0R^0_t, while historical support HtH_t summarizes evidence from earlier observations in the query view. We formulate change prediction as a generalised Bayesian update [4]: current and historical evidence modify the prior odds of change, determined by an effective pixel prior π\pi. The posterior change probability Qtpixel(u)≜qt(y=1∣u)Q_t^{\mathrm{pixel}}(u) \triangleq q_t(y=1 \mid u), where y=1y=1 denotes change, satisfies

Qtpixel(u)1−Qtpixel(u)=π1−π⋅Ct(u)1−Ct(u)⋅Ht(u)1−Ht(u)(1)\frac{Q_t^{\mathrm{pixel}}(u)}{1-Q_t^{\mathrm{pixel}}(u)} = \frac{\pi}{1-\pi} \cdot\frac{C_t(u)}{1-C_t(u)} \cdot\frac{H_t(u)}{1-H_t(u)} \tag*{(1)}

Neutral evidence, Ct(u)=Ht(u)=0.5C_t(u)=H_t(u)=0.5, leaves Qtpixel(u)=πQ_t^{\mathrm{pixel}}(u)=\pi.

However, the prior is unknown beforehand, and constructing CtC_t and HtH_t requires models that interpret image differences as change evidence and determine how this evidence contributes to history. To obtain these components, we fit the effective pixel prior π\pi and four scene-specific models using supervision from automatic reference 3DGS edits and unchanged reference observations. Of these four models, the response suppressor TT and log-likelihood-ratio mapping ℓimg\ell_{\mathrm{img}} construct CtC_t, while the unchanged-response model (μg,τg2,c)(\mu_g,\tau_g^2,c) supplies statistics for closed-form evidence accumulation underlying HtH_t. The contour filter ℓcontour\ell_{\mathrm{contour}} supports subsequent mask refinement. All five components are fitted offline and remain fixed during online inference. § 4.2 describes how they are used for prediction, history accumulation, and mask refinement (Figure 1), taking their fitted parameters as given. § 5.1 explains how automatic reference edits and unchanged observations are used to fit them (Figure 2).

Figure 1. Online evidence fusion pipeline. Current evidence CtC_t combines mapped image evidence PtP_t and Gaussian-aggregated support StS_t. Fusion with prior π\pi and history HtH_t from Ft−1F_{t-1} gives QtpixelQ_t^{\mathrm{pixel}}; refinement produces QtfullQ_t^{\mathrm{full}}. Thresholding at 0.5 gives masks Y^tpixel\hat{Y}_t^{\mathrm{pixel}} and Y^tfull\hat{Y}_t^{\mathrm{full}}, respectively. Local Bayes factors BtgB_{tg} update Ft−1F_{t-1} to FtF_t for subsequent queries. ⊕\oplus adds log odds.

Figure 2. Automatic reference editing and change evidence learning. Top: Reference 3DGS edits (recolouring, removal, translation) and relighting synthesize labelled change pairs without manual annotation. Bottom: Five scene-specific components are fitted in the order required by their inputs (grey arrows): response suppressor T\mathcal{T}, LLR mapping ℓimg\ell_{\mathrm{img}}, unchanged-response model (μg,τg2,c)(\mu_g,\tau_g^2,c), pixel prior π\pi, and contour filter ℓcontour\ell_{\mathrm{contour}}.

Causal Online Change Detection

For each incoming query image ItI_t, we construct current-view evidence CtC_t, which supports both prediction and history accumulation. For prediction, CtC_t combines with historical support HtH_t from earlier frames; for accumulation, it provides the Gaussian responses used to compute local Bayes factors. The updated history is used only by subsequent queries.

Current-view evidence. To suppress view-synthesis artifacts in initial response Rt0R^0_t (§ 3), two predictors give change log odds ℓbase\ell_{\mathrm{base}} from response features and ℓfull\ell_{\mathrm{full}} from response and reference rendering features. The response suppressor TT uses their difference to obtain corrected response RtR_t:

Rt=σ(logit⁡Rt0+T(ℓbase,ℓfull)).(2)R_t = \sigma\left(\operatorname{logit} R^0_t + T(\ell_{\mathrm{base}},\ell_{\mathrm{full}})\right). \tag*{(2)}

Here σ(x)=(1+e−x)−1\sigma(x)=(1+e^{-x})^{-1} is the sigmoid function and logit⁡(p)=log⁡[p/(1−p)]\operatorname{logit}(p)=\log[p/(1-p)]. Although per-frame normalization unifies diverse cues, independent scaling leaves RtR_t contrast-dependent. We therefore map RtR_t to a shared evidence scale learned from reference data via the monotonic LLR mapping ℓimg\ell_{\mathrm{img}}, giving probabilistic image evidence Pt=σ(ℓimg(Rt))∈(0,1)P_t=\sigma(\ell_{\mathrm{img}}(R_t))\in(0,1), where Pt=0.5P_t=0.5 represents neutral evidence. To suppress isolated pixel noise, we aggregate pixel evidence onto Gaussians and render it back to pixels using Gaussian blending weights atuga_{tug}. Specifically, aggregation AtA_t averages 2D pixel evidence XuX_u within each Gaussian’s footprint, while rendering RtR_t blends 3D Gaussian support VgV_g back into pixels:

[At(X)]g=∑uatugXustg,[Rt(V)]u=∑gatugVgχtu,(3)[A_t(X)]_g=\frac{\sum_u a_{tug}X_u}{s_{tg}},\qquad[R_t(V)]_u=\frac{\sum_g a_{tug}V_g}{\chi_{tu}}, \tag*{(3)}

where stg=∑uatugs_{tg}=\sum_u a_{tug} and χtu=∑gatug\chi_{tu}=\sum_g a_{tug} normalize the weights, preserving neutral evidence (0.5). We apply these operators to obtain the single-frame response field Ft0=At(Pt)F_t^0=A_t(P_t) with entries in [0,1][0,1], and Gaussian-aggregated support St=Rt(Ft0)S_t=R_t(F_t^0). Combining PtP_t with StS_t retains pixel detail while incorporating evidence shared through Gaussian footprints, giving current-view evidence CtC_t:

Ct=σ(logit⁡Pt+logit⁡St).(4)C_t=\sigma(\operatorname{logit}P_t+\operatorname{logit}S_t). \tag*{(4)}

3D evidence accumulation

To determine how current-view evidence CtC_t should contribute to history, we evaluate Gaussian responses relative to their expected behaviour under unchanged conditions. The unchanged-response model provides each Gaussian’s expected response μg\mu_g, the uncertainty in the estimated unchanged-response mean τg2\tau_g^2, and the spatial co-response coefficient cc. Each Gaussian’s aggregated response rtg=[At(Ct)]gr_{tg}=[A_t(C_t)]_g is standardized as ztg=(rtg−μg)/τg2+vtgz_{tg}=(r_{tg}-\mu_g)/\sqrt{\tau_g^2+v_{tg}}, where vtg=[At(Ct2)]g−rtg2v_{tg}=[A_t(C_t^2)]_g-r_{tg}^2 measures response variance within its footprint. The observation indicator Itg=I{stg≥1}I_{tg}=\mathbb{I}\{s_{tg}\ge1\} selects Gaussians with sufficient rendering contribution.

A high response from one Gaussian may reflect local noise. Since object changes can affect several neighbouring Gaussians, we combine nearby responses using the neighbourhood mean zˉtg=(∑jηgjItjztj)/(∑jηgjItj)\bar{z}_{tg}=(\sum_j \eta_{gj}I_{tj}z_{tj})/(\sum_j \eta_{gj}I_{tj}), where jj indexes neighbours of Gaussian gg on the reference 3D graph. Edge weights ηgj\eta_{gj} reflect spatial and colour similarity (Appendix, Eq. (23)), and Itj\mathbb{I}_{tj} applies the same observation rule to neighbour jj. Neighbours can also respond together without change. Under the unchanged hypothesis H0H_0, we model the central response ztgz_{tg} and neighbourhood mean zˉtg\bar{z}_{tg} as jointly Gaussian with zero means, unit central variance, and covariance approximated by cc. This gives the conditional expectation E[zˉtg∣ztg,H0]≈cztg\mathbb{E}[\bar{z}_{tg}\mid z_{tg},H_0]\approx cz_{tg}. Subtracting it yields the residual etg=zˉtg−cztge_{tg}=\bar{z}_{tg}-cz_{tg}, which measures neighbour response beyond that expected from the centre.

To quantify this residual as change evidence, we model etg∣H0∼N(0,νtg)e_{tg} \mid H_0 \sim\mathcal{N}(0,\nu_{tg}). The residual variance νtg=max⁡(Vtg−c2,ϵν)\nu_{tg} = \max(V_{tg} - c^2,\epsilon_\nu) uses the estimated variance VtgV_{tg} of the neighbourhood mean (Appendix, Eq. (29)); ϵν=10−4\epsilon_\nu= 10^{-4} prevents degenerate variance. Under the change hypothesis H1H_1, a shared response increase δ≥0\delta\ge0 at the centre and its neighbours gives etg∣δ,H1∼N((1−c)δ,νtg)e_{tg} \mid\delta,H_1 \sim\mathcal{N}((1-c)\delta,\nu_{tg}), with δ∼HalfNormal⁡(1)\delta\sim\operatorname{HalfNormal}(1) and density p+(δ)=2N(δ;0,1)p_+(\delta) = 2\mathcal{N}(\delta;0,1) for δ≥0\delta\ge0. We integrate over δ\delta to evaluate evidence for change. The Gaussian likelihood and half-normal prior give an exponent quadratic in δ\delta, so completing the square evaluates this integral analytically. With htg=(1−c)etg/νtgh_{tg} = (1-c)e_{tg}/\nu_{tg} and Jtg=(1−c)2/νtg+1J_{tg} = (1-c)^2/\nu_{tg} + 1, the local Bayes factor BtgB_{tg} is

Btg=p(etg∣H1)p(etg∣H0)=∫0∞N(etg;(1−c)δ,νtg)p+(δ) dδN(etg;0,νtg)=2Jtgexp⁡(htg22Jtg)Φ(htgJtg),(5)B_{tg} = \frac{p(e_{tg}\mid H_1)}{p(e_{tg}\mid H_0)} = \frac{\int_0^\infty\mathcal{N}(e_{tg};(1-c)\delta,\nu_{tg})p_+(\delta)\,\mathrm{d}\delta}{\mathcal{N}(e_{tg};0,\nu_{tg})} = \frac{2}{\sqrt{J_{tg}}}\exp\left(\frac{h_{tg}^2}{2J_{tg}}\right)\Phi\left(\frac{h_{tg}}{\sqrt{J_{tg}}}\right), \tag*{(5)}

where Φ\Phi is the standard normal cumulative distribution function. This expression requires neither numerical integration nor iterative optimization; its derivation and log form are given in Appendix § 13, Eqs. (32)–(33). Values Btg>1B_{tg} > 1 support change and Btg<1B_{tg} < 1 oppose it, with neutral evidence Btg=1B_{tg} = 1 when no neighbours are observed. Adding these log Bayes factors to the previous accumulated field Ft−1F_{t-1} gives the updated log-evidence field FtF_t for subsequent queries, with real-valued entries FtgF_{tg} at Gaussians gg:

Ftg=Ft−1,g+Itglog⁡Btg.(6)F_{tg} = F_{t-1,g} + I_{tg}\log B_{tg}. \tag*{(6)}

Historical fusion and causal prediction. To predict pixel-level changes on query ItI_t, historical support HtH_t is rendered from the previous accumulated field Ft−1F_{t-1} (with F0=0F_0 = 0):

Ht=Rt(σ(Ft−1)),(7)H_t = \mathcal{R}_t(\sigma(F_{t-1})), \tag*{(7)}

where σ\sigma maps accumulated log evidence into (0,1)(0,1). Rendering accounts for view-dependent visibility and occlusion; unobserved Gaussians (F=0F = 0) give neutral support 0.5 on covered pixels. Using Equation (1), we combine CtC_t from Equation (4), HtH_t above, and the effective pixel prior π\pi fitted offline. Converting the resulting odds to probabilities gives the pixel scores QtpixelQ_t^{\mathrm{pixel}}. The binary change mask is Ytpixel(u)=1{Qtpixel(u)≥0.5}Y_t^{\mathrm{pixel}}(u) = \mathbb{1}\{Q_t^{\mathrm{pixel}}(u) \ge0.5\}.

Object-guided mask refinement. Gaussian overlap and alpha-blending can blur rendered change boundaries. We use connected components of YtpixelY_t^{\mathrm{pixel}} to prompt the SAM2 decoder on both query and reference renderings. 3DGS-CD ([16]) fuses prompted segmentations into 3D object masks; our contour refinement retains the original scores of unprompted pixels. The contour model predicts log odds ℓcontour(u)\ell_{\mathrm{contour}}(u) from paired mask features. Their non-positive part penalizes pixel change scores, giving the contour-filtered score Qtcontour(u)Q_t^{\mathrm{contour}}(u):

Qtcontour(u)=σ(logit⁡Qtpixel(u)+min⁡(ℓcontour(u),0)).(8)Q_t^{\mathrm{contour}}(u) = \sigma\left(\operatorname{logit}Q_t^{\mathrm{pixel}}(u) + \min(\ell_{\mathrm{contour}}(u),0)\right). \tag*{(8)}

To recover missed object parts, surviving components prompt SAM2 on the query for candidate masks MM. Their mean log-odds evidence is L‾M=mean⁡u∈Mlogit⁡Qtpixel(u)\overline{L}_M = \operatorname{mean}_{u\in M}\operatorname{logit}Q_t^{\mathrm{pixel}}(u). We retain masks with LM≥0L_M \ge0 and raise covered pixels to at least their mask score, giving the refined change score Qtfull(u)Q_t^{\mathrm{full}}(u):

Qtfull(u)=max⁡(Qtcontour(u),max⁡M∋uσ(L‾M)),(9)Q_t^{\mathrm{full}}(u) = \max\left(Q_t^{\mathrm{contour}}(u),\max_{M\ni u}\sigma(\overline{L}_M)\right), \tag*{(9)}

where the inner maximum is over retained masks covering uu and is set to 0 if none cover it. Thresholding at 0.5 gives the refined mask YtfullY_t^{\mathrm{full}} (Appendix § 16).

Learning from Automatic 3DGS Edits

Figure 2 illustrates our framework for learning from automatic 3DGS edits: we first synthesize object-level edits on the reference 3DGS to generate labelled training views, and then fit the scene-specific components in the order required by their inputs.

Automatic reference editing. We split reference cameras approximately 5:1 into an editing subset for learning and an unchanged-only subset for estimating unchanged-response statistics. A regular grid of automatic point prompts drives the SAM2 mask decoder ([20]) on reference views, and masks are matched across views through their contributing Gaussians. Aggregating matched masks XX via [At(X)]g[A_t(X)]_g (Eq. (3)) yields object membership mg∈[0,1]m_g \in[0,1], measuring the fraction of each Gaussian’s rendering footprint inside the object. We select objects based on their consistency across held-out views. Recolouring blends colours towards the palette colour furthest from the object’s median colour with mixing coefficient 0.45mg0.45m_g; removal scales opacity by 1−mg1-m_g; translation applies a shared 3D displacement to Gaussians with mg≥0.5m_g \ge0.5. Edits modify duplicate models, preserving the original reference. For reference image Itref∈IrefI_t^{\mathrm{ref}} \in I_{\mathrm{ref}}, original and edited models render I^t\hat{I}_t and I^tedit\hat{I}_t^{\mathrm{edit}} at its registered pose; here tt indexes reference views. Synthetic query Itsyn=Itref+(I^tedit−I^t)I_t^{\mathrm{syn}} = I_t^{\mathrm{ref}} + (\hat{I}_t^{\mathrm{edit}}-\hat{I}_t) transfers changes to real reference images while preserving differences between reference images and their renderings. Regions covered by edit masks are labelled changed (1); valid regions outside are labelled unchanged (0), with ambiguous boundaries ignored. We introduce lighting variations using affine colour transforms, optionally augmented with normal-dependent directional shading, fitted to differences between unchanged reference images and their renderings. These transformations preserve the change labels (details and additional examples in Appendix § 11.§ 1, Figure 4).

Figure 4. Selected examples from the editing subset, showing recolouring, removal, and translation in four scenes. Each row uses the same crop across the real reference image, synthetic query, relit synthetic query, and edit mask. White marks regions labelled changed; translation includes both original and displaced locations. Relighting preserves these labels. Condition-specific ignore masks are omitted.

Response suppression. We fit the response suppressor T\mathcal{T} using two pixel-wise logistic classifiers on the editing subset. Base uses initial response Rt0R_t^0 and its local texture statistics (mean, standard deviation, gradient). Full adds pixel-aligned reference rendering features at the same pose: coverage, depth, Gaussian contribution statistics, and their gradients and interactions. The fitted classifiers predict change log odds ℓbase\ell_{\mathrm{base}} and ℓfull\ell_{\mathrm{full}}. We suppress responses when adding rendering features lowers the predicted change odds, using

T(ℓbase,ℓfull)=min⁡(ℓfull−ℓbase,0).(10)\mathcal{T}(\ell_{\mathrm{base}},\ell_{\mathrm{full}})=\min(\ell_{\mathrm{full}}-\ell_{\mathrm{base}},0). \tag*{(10)}

Fitting details and feature groups are provided in Appendix § 11.§ 2 (Eq. (18)).

Log-likelihood-ratio mapping. Under Bayesian hypothesis testing, the corrected response RtR_t is mapped to evidence via the log-likelihood ratio (LLR) between change (H1\mathcal{H}_1) and no-change (H0\mathcal{H}_0). To estimate this mapping, we pool corrected responses across the editing subset and use isotonic regression [27] to partition responses into monotonic blocks bb. The unchanged distribution p(b∣H0)p(b \mid\mathcal{H}_0) is an equal mixture of distributions estimated from regions outside edits (H0edit\mathcal{H}_0^{\mathrm{edit}}) and unedited reference views (H0ref\mathcal{H}_0^{\mathrm{ref}}). This gives the block LLR:

ℓb=log⁡p^(b∣H1)p^(b∣H0)=log⁡p^(b∣H1)12p^(b∣H0edit)+12p^(b∣H0ref).(11)\ell_b=\log\frac{\hat{p}(b\mid\mathcal{H}_1)}{\hat{p}(b\mid\mathcal{H}_0)} =\log\frac{\hat{p}(b\mid\mathcal{H}_1)}{\frac{1}{2}\hat{p}(b\mid\mathcal{H}_0^{\mathrm{edit}})+\frac{1}{2}\hat{p}(b\mid\mathcal{H}_0^{\mathrm{ref}})}. \tag*{(11)}

Linearly interpolating ℓb\ell_b across block-mean responses yields the continuous monotonic mapping ℓimg\ell_{\mathrm{img}} (Appendix § 11.§ 2).

Unchanged-response modelling. To fit the unchanged-response model (μg,τg2,c)(\mu_g, \tau_g^2, c), we estimate its response statistics over reference views tt in the unchanged-only subset. We place a Beta prior on each Gaussian’s latent mean response and treat bounded observations rtg∈[0,1]r_{tg} \in[0,1] as fractional counts. Taking the prior concentration to zero from above yields the mean μg\mu_g and uncertainty in the estimated unchanged-response mean τg2\tau_g^2. The reference graph is built from eight-nearest-neighbour candidates, then symmetrized and weighted by spatial and colour similarity ηgj\eta_{gj}. Co-observed neighbour pairs estimate the spatial co-response coefficient cc:

μg=∑tItgrtg∑tItg,τg2=μg(1−μg)1+∑tItg,c=∑t,(g,j)ωtgjfitz~tgz~tj∑t,(g,j)ωtgjfit,(12)\mu_g = \frac{\sum_t I_{tg}r_{tg}}{\sum_t I_{tg}}, \qquad\tau_g^2 = \frac{\mu_g(1-\mu_g)}{1+\sum_t I_{tg}}, \qquad c = \frac{\sum_{t,(g,j)} \omega^{\mathrm{fit}}_{tgj}\tilde{z}_{tg}\tilde{z}_{tj}}{\sum_{t,(g,j)} \omega^{\mathrm{fit}}_{tgj}}, \tag*{(12)}

where z~tg\tilde{z}_{tg} and z~tj\tilde{z}_{tj} denote responses of Gaussian gg and neighbour jj standardized across unchanged reference views, ωtgjfit=ηgjmin⁡(Itg,Itj)\omega^{\mathrm{fit}}_{tgj} = \eta_{gj}\min(I_{tg}, I_{tj}) weights co-observed neighbour pairs, and unobserved Gaussians (∑tItg=0)(\sum_t I_{tg}=0) revert to scene-level priors (details in Appendix B, Eqs. (24)–(25)).

Pixel prior fitting. To fit the pixel prior π\pi (Eq. (1)) robustly against synthetic edit artifacts (e.g., exposed backgrounds or spillover), we introduce Cauchy reliability weights ρi∈(0,1]\rho_i \in(0,1] to downweight views with abnormal responses in labelled unchanged regions. For each training image ii, let YiY_i denote its binary change-label mask and Y^ipixel(π)\hat{Y}^{\mathrm{pixel}}_i(\pi) the pixel prediction obtained with prior π\pi. We determine the optimal prior π⋆\pi^\star by maximizing their reliability-weighted foreground IoU over the editing subset:

π⋆∈arg⁡max⁡π∈(0,1) ∑iρiIoU⁡(Y^ipixel(π),Yi)∑iρi.(13)\pi^\star\in\underset{\pi\in(0,1)}{\arg\max}\ \frac{\sum_i \rho_i \operatorname{IoU}\left(\hat{Y}^{\mathrm{pixel}}_i(\pi),Y_i\right)}{\sum_i \rho_i}. \tag*{(13)}

This objective fits π\pi as an effective prior that sets how much evidence is needed to predict change. We solve this one-dimensional search via branch-and-bound (Appendix E, Eqs. (42)–(43)).

Contour filter fitting. To learn the boundary penalty in Eq. (8), we first fit a linear classifier with score scontour(u)=wTfu+bs_{\mathrm{contour}}(u) = \mathbf{w}^{\mathsf{T}}\mathbf{f}_u + b over standardized features fu\mathbf{f}_u that are unchanged when the query and reference images are swapped. These view-symmetric features combine SAM2 mask logits, predicted IoUs, and their products using (max, min) across the two views. Across training image pairs ii and candidate pixels uu, the feature vectors are fiu\mathbf{f}_{iu} and edit-mask labels are yiu=Yi(u)∈{0,1}y_{iu}=Y_i(u) \in\{0,1\}. We fit w\mathbf{w} and bb by minimizing regularized binary cross-entropy:

min⁡w,b∑i,uwiuLCE(σ(wTfiu+b),yiu)+λ2∥w∥2,(14)\min_{\mathbf{w},b}\sum_{i,u} w_{iu}L_{\mathrm{CE}}\left(\sigma\left(\mathbf{w}^{\mathsf{T}}\mathbf{f}_{iu}+b\right),y_{iu}\right)+\frac{\lambda}{2}\lVert\mathbf{w}\rVert^2, \tag*{(14)}

where λ\lambda controls L2L_2 regularization. Excluding ignored pixels, we construct wiuw_{iu} by balancing classes within each image, multiplying by its reliability ρi\rho_i, and normalizing each class to total weight 0.50.5 within the fitting split. Platt scaling [17] fits a slope acala_{\mathrm{cal}} and intercept bcalb_{\mathrm{cal}} on held-out objects using the same weighting procedure, giving contour log odds ℓcontour(u)=acalscontour(u)+bcal\ell_{\mathrm{contour}}(u)=a_{\mathrm{cal}}s_{\mathrm{contour}}(u)+b_{\mathrm{cal}} (Appendix F).

Experiments

Protocol. Real-world PASLCD [6] is our primary benchmark (20 scene-instances, conventional 4×4\times downsampling), complemented by evaluation on four synthetic CCS3D scenes [29]. Following O-SCD’s mask definition, we evaluate our method and O-SCD on both datasets using masks covering pre- and post-state changes, including vacated and newly occupied regions. Tables 1–Table 2 compare our method with official-code O-SCD results and other published online/offline baselines. We report foreground mIoU and F1 for Ours (pixel) (Y^tpixel)(\hat{Y}^{\mathrm{pixel}}_t) and Ours (full) (Y^tfull)(\hat{Y}^{\mathrm{full}}_t) at threshold 0.50.5 (Figure 1). Models are fitted offline from reference data without test-time tuning. Our comparisons average two complete runs per dataset (Appendix G.5).

MethodVenueModemIoU ↑F1 ↑
Paper-reported
MV3DCDCVPR 2025offline30.4044.10
CL-SplatsICCV 2025offline39.9053.80
3DGS-CDRA-L 2025offline41.6051.20
SCaR-3D3DV 2026offline65.0072.40
Our evaluation
O-SCD(O)CVPR 2026online49.9464.61
O-SCD(R)CVPR 2026offline43.5957.82
Ours (pixel)—online66.8379.47
Ours (full)—online75.8285.90

Table 2. CCS3D (four scenes, %). Our method and O-SCD are evaluated locally; other results are taken from SCaR-3D.

Complete evaluation. Our method achieves state-of-the-art accuracy on PASLCD with 67.64% mIoU and 78.87% F1 (Table 1), exceeding O-SCD(O) by 18.40 mIoU points and offline GS-Diff [7] by 3.24 points without a post-change reconstruction. Ours (pixel) also exceeds both O-SCD variants. On CCS3D, our method exceeds O-SCD(O) by 25.88 mIoU points under the same union-mask evaluation (Table 2). Figure 3 shows more complete object masks in

Figure 3. Visual results on representative scenes. Columns show reference renderings, queries, ground truth, O-SCD(R) (offline), and our complete method (online). correct detections; false positives; missed changes. Numbers give per-frame foreground IoU from one complete sequence run. Additional visual results, including remaining errors, are shown in Appendix § 18.

MethodVenueModemIoU ↑F1 ↑
Paper-reported
SCaR-3D3DV 2026offline19.1028.90
3DGS-CDRA-L 2025offline20.9033.90
MV3DCDCVPR 2025offline47.8062.80
GS-DiffarXiv 2026offline64.4075.80
Our evaluation
O-SCD(O)CVPR 2026online49.2464.60
O-SCD(R)CVPR 2026offline55.9970.27
Ours (pixel)—online60.3673.80
Ours (full)—online67.6478.87

Table 1. PASLCD (20 scene-instances, %). Our method and O-SCD are evaluated locally; other results are taken from GS-Diff.

Porch, fewer boundary false positives in Pots, and fewer missed changes in Playground than O-SCD(R). Appendix § 17 provides per-instance results.

Cross-instance reference reuse. We reuse each reference reconstruction and its fitted parameters to process the other instance of the same PASLCD scene, without refitting. Overall pixel and full-output mIoU remain close to the original pairing: 59.93% versus 60.36%, and 67.15% versus 67.64%, respectively. These results support reference reuse between closely related instances of the same scene. Appendix § 17.§ 1 provides the protocol and per-pair results (Table 6).

Table 6: Same-scene cross-instance reference reuse on PASLCD (%). Original pairing uses each instance’s own reference; cross-instance pairing uses the other instance’s reference and fitted parameters. Both average two runs of 20 sequences.

OutputOriginal pairing mIoUOriginal pairing F1Cross-instance mIoUCross-instance F1
Ours (pixel)60.3673.8059.9373.39
Ours (full)67.6478.8767.1578.41

Table 6.

Independent component ablations. Removing any evaluated component reduces mean mIoU (Table 3), with the pixel prior π\pi having the largest effect in the pixel pipeline: its removal causes a 16.47-point drop. This highlights the importance of using reference data to determine how much evidence is needed to predict change. Appendix § 17.§ 2 reports the fitted priors and performance by change area. Gaussian-aggregated support contributes 1.89 points, supporting the use of spatially shared evidence. Response suppression and likelihood-ratio mapping provide additional gains. Historical support connects each prediction to a shared 3D field that accumulates change evidence from earlier views. Removing it reduces mean pixel mIoU by 2.56 points. To evaluate how this shared evidence should be accumulated, we replace our Bayes-factor updates with a temporal average of each Gaussian’s observed responses, reducing pixel mIoU by 4.42 points (Appendix, Table 10). Con-

Pixel pipelineOutput refinement
ConfigurationmIoU ↑F1 ↑ConfigurationmIoU ↑F1 ↑
Full pixel pipeline60.3673.80Full method67.6478.87
w/o response suppression58.6272.17w/o contour filtering63.1575.78
w/o likelihood-ratio mapping59.2373.12w/o object completion62.5675.32
w/o Gaussian-aggregated support58.4772.27w/o contour image weights67.3878.67
w/o historical support57.8171.67
w/o pixel prior43.9058.26

Table 3. Independent component ablations on 20 PASLCD instances (%). Each component is removed separately from the corresponding complete pipeline with the decision threshold fixed at 0.5. Removing the pixel prior is equivalent to using a neutral prior, π=0.5\pi= 0.5.

tour filtering suppresses excess responses, while object completion recovers missed object regions. Removing them reduces mean mIoU by 4.49 and 5.08 points, respectively, while contour image weights provide a smaller gain of 0.26 points.

Relighting strength. Removing the relighting during data generation reduces full-output mIoU by 0.66 points, while doubling its strength gives similar aggregate results (Appendix, Table 9).

StrengthmIoU ↑F1 ↑mIoU ↑F1 ↑
K=0K = 060.0473.5466.9878.45
K=1K = 1 (default)60.3673.8067.6478.87
K=2K = 260.4073.8367.5778.85

Table 9. Relighting strength on PASLCD, averaged over 20 instances (%). All settings retain the same training records; KK scales the lighting perturbation about the identity transform. Pixel output and Full output.

Runtime. We measure runtime on an NVIDIA RTX 5090 over all 25 frames of all 20 PASLCD instances after initialization (Table 4). Including frontend processing, our complete method reaches 17.2 FPS, compared with 14.4 FPS for O-SCD(O), while improving mIoU by 18.40 points. Without refinement, our pixel pipeline reaches 27.9 FPS at 60.36% mIoU, still exceeding the offline refined O-SCD(R) result of 55.99%. The learned models enable efficient online evidence accumulation through closed-form local Bayes factors, avoiding online backpropagation and past-image replay. Given an existing reference reconstruction, offline preparation averages 215.82 s (∼3.6 minutes) per instance, including automatic editing and model fitting. Appendices § 17.§ 6 and § 17.§ 7 provide the timing protocol and offline cost breakdown.

MethodModePost-frontend (ms) ↓End-to-end (ms) ↓FPS ↑
O-SCD(R)†offline169.41201.344.97
O-SCD(O)online37.6569.3314.42
Ours (pixel)online4.7935.8127.93
Ours (full)online25.6458.2317.17

Table 4. Runtime on PASLCD (RTX 5090; 20 instances). Post-frontend covers detection, state updates, and refinement. Timing definitions and protocols are given in Appendix § 17.§ 6.

Conclusion and Limitations

Our method learns scene-specific evidence models and statistics from automatic reference 3DGS edits, using the reference scene as a source of supervision for online change detection. These learned quantities enable closed-form local Bayes factors and generalised Bayesian history accumulation without online backpropagation or past-image replay. It outperforms O-SCD on PASLCD and CCS3D, achieving 67.64% mIoU at 17.2 FPS on PASLCD. However, our direct object edits and simple relighting prioritize short offline preparation and may not cover real changes or unusual lighting conditions. Accumulating evidence on the unchanged reference geometry limits how accurately newly introduced objects and occlusion boundaries can be represented in the field. The response uncertainty and spatial covariance models are working approximations. Although local Bayes factors are evaluated analytically under the residual model, the fused scores combine dependent evidence and are not guaranteed to be calibrated probabilities of real-world changes. Future work will explore more advanced 3DGS segmentation, editing, and relighting to improve object masks and broaden the generated changes, while assessing whether the resulting detection gains justify the additional offline preparation time.

AI Use Statement

In this work, generative AI tools were used to assist with initial methodology discussions and exploratory brainstorming, algorithm and code implementation, preliminary manuscript drafting, and textual refinement for grammar, phrasing, and readability. Generative AI tools were not used for formulating theoretical claims, deriving mathematical formulations, collecting benchmark observations, or interpreting empirical results. All AI-assisted contributions were rigorously reviewed, tested, and vetted by the authors: all algorithmic implementations and evaluation pipelines were independently executed and verified, all mathematical derivations were checked manually, and all experimental results and claims were thoroughly audited. The authors assume full responsibility for the entirety of this paper and its claims.

Ethics Statement

This work uses existing scene-change benchmarks. Incorrect predictions can lead to missed changes or unnecessary follow-up inspections.

Reproducibility Statement

The implementation records reference camera assignments, synthetic events, fitted scene models, effective-prior parameters, and per-image results. All scene-specific parameters are frozen before target evaluation. The appendices specify the observation transformations, statistical approximations, update order, and effective-prior estimation used for the reported method.

Image Evidence Processing and Gaussian Aggregation

Automatic reference editing and data generation

The inputs are the fixed reference 3DGS and its registered images. Object selection, edit parameters, labels, and filtering are determined automatically from these inputs. We use SAM2.1 Hiera-Tiny automatic masks, images with a maximum side length of 1008 pixels, and random seed 0. The following settings are shared by all 20 scene instances.

Reference camera assignment. We implement the approximately 5:1 camera split described in § 5.1. The unchanged-only subset contains ⌈N/6⌉\lceil N/6\rceil cameras for unchanged-response estimation, where NN is the total number of reference cameras. We select these cameras to represent the scene’s visible surfaces with a limited number of observations. For camera tt, let VtV_t denote its observable reference Gaussians. We measure the distance between cameras tt and ll by the Jaccard distance 1−∣Vt∩Vl∣/∣Vt∪Vl∣1-\lvert V_t\cap V_l\rvert/\lvert V_t\cup V_l\rvert, so cameras observing similar surfaces are close. Greedy facility-location selection adds cameras one at a time to minimise the total distance from all reference cameras to their nearest selected camera. We then apply medoid swaps, replacing a selected camera with an unselected one whenever this reduces the total distance. Both steps require the editing subset to retain at least one available view of every synthetic object/change event. The editing subset provides labelled examples generated by automatic 3DGS edits for learning response suppression, the likelihood-ratio mapping, the effective pixel prior, and the contour filter. Examples are included only where the corresponding edit is available. With the image-evidence pipeline fixed, the unchanged-only subset provides unchanged reference images for estimating the Gaussian unchanged-response model and spatial co-response. The two subsets contain different cameras but may observe overlapping surfaces.

Object proposals and cross-view association. We first generate candidate regions in each reference image using SAM2: automatically placed point prompts produce masks, followed by filtering of low-quality and duplicate results. To determine whether masks in different views describe the same object, we associate each mask with the reference Gaussians that mainly contribute to it.

For reference view tt, let atuga_{tug} be the rendering contribution defined in § 3. At each pixel, we retain only the two largest contributions and set the others to zero; denote these retained weights by a~tug\tilde{a}_{tug}. For a mask MM, Gaussian gg’s contributions inside and outside it are

Atgin=∑u∈Ma~tug,Atgout=∑u∈Ωt∖Ma~tug,(15)A^{\mathrm{in}}_{tg}=\sum_{u\in M}\tilde{a}_{tug},\qquad A^{\mathrm{out}}_{tg}=\sum_{u\in\Omega_t\setminus M}\tilde{a}_{tug}, \tag*{(15)}

where Ωt\Omega_t is the reference image domain. We assign gg to the mask when it contributes more to the inside than the outside, allowing ties:

St(M)={g:Atgin>0,Atgin≥Atgout}.(16)S_t(M)=\{g:A^{\mathrm{in}}_{tg}>0,\quad A^{\mathrm{in}}_{tg}\ge A^{\mathrm{out}}_{tg}\}. \tag*{(16)}

This support set therefore contains Gaussians with at least half of their retained contribution inside the mask. Masks with empty support sets are discarded.

To exploit view continuity in sequentially captured reference images, we match each view with the next KK views in the reference sequence. This reduces pairwise comparisons while allowing matches to be linked through intermediate views into longer tracks. We use K=2K=2. We match masks across views by comparing the Gaussians assigned to them. For each candidate pair, we use a hypergeometric test to determine whether the two masks share more Gaussians than expected by chance. The test accounts for both support-set sizes and uses all Gaussians visible in either view, Vt∪Vl\mathcal{V}_t \cup\mathcal{V}_l, as the population. We apply the Benjamini–Hochberg procedure [3] at level 0.01 to filter chance overlaps across the candidate pairs. Among the surviving pairs, we rank matches by Jaccard overlap (intersection size divided by union size), breaking ties by the number of shared Gaussians. We retain a pair only if each mask is the other’s highest-ranked match in the corresponding view. Finally, we link these matches into cross-view tracks, where each track is a collection of masks associated with the same candidate object across reference views, with at most one mask per view.

Membership and edit-view validation. We estimate how strongly each editable Gaussian belongs to the candidate object using the masks in its representative track. We use all available views of this track, adding views from strongly linked tracks if fewer than two are available. For each editable Gaussian gg, we sum its rendering contributions inside these masks and divide by its total contribution across the selected views. This ratio defines its soft membership mg∈[0,1]m_g \in[0, 1]: larger values indicate that more of its contribution falls inside the object masks. Gaussians unobserved in these views receive mg=0m_g = 0.

Rendering these membership values produces a 2D object-support map in each selected view. We convert the maps into binary masks using a shared threshold chosen to maximise mean IoU with the corresponding SAM2 masks. To limit search cost, we divide the quantile range [0,1][0, 1] into 256 equal intervals for support values above 10−710^{-7}. The boundary quantiles serve as candidate thresholds; we select the one maximising mean IoU with the SAM2 masks, breaking ties in favour of larger thresholds.

To check consistency across views, we repeat this procedure while leaving out one view at a time: both membership and the threshold are fitted using the remaining views, then used to predict the object mask in the omitted view. We retain candidates with mean IoU at least 0.65 and minimum IoU at least 0.5 against the omitted SAM2 masks. For accepted candidates, we refit membership and the threshold using all selected views. All validation uses automatically generated reference masks and requires no manually annotated change masks. Gaussian recolouring. We compute a channelwise median RGB colour in the first selected view over object Gaussians with membership weight at least 0.5, falling back to all selected object Gaussians if none meet this criterion. The target maximises Euclidean RGB distance from this median over the palette (0.90,0.15,0.18)(0.90, 0.15, 0.18), (0.12,0.72,0.24)(0.12, 0.72, 0.24), (0.12,0.35,0.92)(0.12, 0.35, 0.92), (0.92,0.72,0.10)(0.92, 0.72, 0.10), (0.82,0.16,0.82)(0.82, 0.16, 0.82), and (0.08,0.76,0.82)(0.08, 0.76, 0.82). For each selected Gaussian, we interpolate its view-dependent RGB colour towards this shared target with coefficient 0.45 times its object membership weight. The target is fixed across the object’s rendered views.

Gaussian removal and translation. Removal replaces Gaussian gg’s opacity parameter σg\sigma_g by (1−mg)σg(1-m_g)\sigma_g for every selected Gaussian. Translation moves Gaussians with mg≥0.5m_g \ge0.5 by a common displacement, leaving their other attributes fixed. Its magnitude is relative to object extent. The search uses core Gaussians supported by at least half of the anchor-track masks, intersected with the moved set; it falls back to the moved set if that intersection is empty. The centre is their coordinatewise median, and directional extents are measured between the 1st and 99th percentiles, using extrema when fewer than eight points are available.

We select up to four evenly spaced seed views. In each seed view, eight equally spaced directions, with a seeded random angular offset, lie in the plane perpendicular to the centre’s viewing direction. The initial translation magnitude is 1.5 times the object’s 3D extent along the candidate direction. Up to six scaling steps increase it to obtain a projected centre displacement of 1.5 projected object extents in the seed view, corresponding to an extent-relative clearance parameter of 0.5. A view passes the geometric check when both projected centres and at least two core points before and after translation are valid, some moved core points remain in frame, the old–new projected interval overlap is at most 0.01, and the centre displacement is at least 1.5×0.9951.5 \times0.995 original projected extents. Interval overlap is divided by the shorter interval length.

Within each seed, valid directions are ranked by retained in-frame fraction, image-border margin, smaller overlap, and shorter translation, in that order. Each seed’s selected displacement is then checked across all supporting views. The final choice maximizes the number of valid views, followed by the same ranking criteria using the worst valid view. At least one valid view is required.

A final rendering check requires a nonempty moved mask and intersection with the original mask below 1% of the smaller mask area. Only passing views produce translation examples; an object without a valid translation may still provide recolouring and removal examples.

Changed, unchanged, and ignored regions. Let MM denote the candidate changed region: the reference SAM2 object mask for recolouring and removal, or its union with the thresholded moved Gaussian-support map for translation. Let DD be the channel-mean absolute RGB difference between edited and original renders. Sorting DD in descending order defines an effect footprint EE containing at least 99% of its summed mass, including ties at the cutoff. This footprint identifies edit effects extending beyond the object mask.

Removal also checks the newly exposed background. For each Gaussian, background reliability is the fraction of its observed contribution outside the object’s masks across the selected reference views. Rendering these reliabilities after removal and dividing by remaining coverage gives a background-provenance map. Pixels with remaining coverage below 0.05 or provenance below 0.5 are invalid. For removal and translation, let UU contain such pixels inside the original object mask; for recolouring, UU is empty. The changed region is M∖UM \setminus U, and the ignored region is U∪(E∖M)U \cup(E \setminus M). All other pixels are labelled unchanged. Changed and ignored regions are disjoint.

We also store soft edited-Gaussian footprint maps. For recolouring and removal this is the rendered membership; for translation it is 1−(1−fold)(1−fnew)1-(1-f_{\mathrm{old}})(1-f_{\mathrm{new}}), where the two ff maps render membership of the moved Gaussian set at its original and translated positions. The hard masks, ignore masks, and soft maps remain associated with the same object, camera, and edit.

Filtering individual edits. At the generated image resolution, an original-lighting edit is retained only if all conditions below hold. A five-pixel boundary neighbourhood is formed by dilating the change mask with an 11×1111 \times11 elliptical kernel; ignored pixels outside this dilation are called distant ignored pixels.

QuantityAcceptance condition
Changed pixel count>0> 0
Ignored area / image area≤0.03\le0.03
Ignored area / changed area≤20\le20
Distant ignored area / changed area≤1\le1
RGB edit-effect mass outside MM / total effect mass≤0.20\le0.20
Invalid background area / original object-mask area (removal)≤0.50\le0.50

Table 1 (PDF p. 15).

The effect-mass check uses MM before invalid interior pixels are excluded. Translation requires at least one retained view. The filters operate on reference-derived masks and render differences.

Reference-fitted lighting variations. We fit a colour transform to explain differences between unchanged reference images and their renders. Its affine component maps the view-dependent Gaussian colour ctg\mathbf{c}_{tg} to γ⊙ctg+β\gamma\odot\mathbf{c}_{tg}+\boldsymbol{\beta}, with three channel gains γ\gamma and offsets β\boldsymbol{\beta}; ⊙\odot denotes componentwise multiplication. An optional directional component adds (dTng)ctg(\mathbf{d}^{\mathsf{T}}\mathbf{n}_g)\mathbf{c}_{tg}, where d∈R3\mathbf{d}\in\mathbb{R}^{3} is fitted and ng\mathbf{n}_g is the Gaussian’s smallest-axis direction, oriented towards the mean reference camera position. Transformed colours are restricted to [0,1][0,1] before rendering.

We select whether to include the directional component using six reference views, sampled at evenly spaced indices in the reference camera list. For each view, both models are fitted at a maximum side length of 320 pixels on even-parity checkerboard pixels with coverage above 0.05, excluding reliably tracked objects. Fewer than 64 fitting pixels triggers a fallback to all covered even-parity pixels. Four iteratively reweighted least-squares steps use per-pixel RGB residual norms rr, scale s=max⁡(median⁡r,10−4)/0.6745s=\max(\operatorname{median}r,10^{-4})/0.6745, and weights min⁡(1,1.345s/r)\min(1,1.345s/r). A ridge term towards the identity transform has strength ϵfp32max⁡(tr⁡(XTWX),1)\epsilon_{\mathrm{fp32}}\max(\operatorname{tr}(X^{\mathsf{T}}WX),1), where XTWXX^{\mathsf{T}}WX is the rendered colour-basis design matrix, WW contains fitting weights, and ϵfp32=2−23\epsilon_{\mathrm{fp32}}=2^{-23} is the machine epsilon for float32. For model selection, predictions are evaluated on odd-parity covered object pixels at the original resolution, falling back to non-object pixels when fewer than 16 object pixels are available. The comparison averages squared RGB errors capped at their per-view 90th percentile. We enable the directional component when its mean error across the six views does not exceed the affine model’s. This is a fixed-size model-selection check; the selected views are not chosen to optimize spatial coverage. It enables the directional component for 7 of the 20 evaluated scene instances.

After model selection, coefficients are fitted separately for every reference camera represented in the generated event list (43–108 cameras per instance in our data). Thus, the six-view check does not limit the views used for coefficient fitting or event generation. We retain three representative coefficient vectors: the first is closest to the componentwise median, followed by farthest-point selection after scaling by median absolute deviation, with each scale bounded below by 10−410^{-4}. For each camera, a fixed seeded choice selects one of the two representatives farthest from its own fitted coefficients. That transform is applied to both edited and unedited Gaussians, producing a relighting condition alongside the identity condition. Relighting preserves the parent change masks and soft targets; additional edit effects outside the changed regions are included in the ignore mask. All lighting fitting and selection use reference data before deployment.

Paired-condition and object-level filtering. Relighting is applied only to edits that pass the individual-edit filters. Its change masks and soft targets are inherited; the ignore mask also includes any new edit-effect footprint outside the changed regions. We measure this footprint from the relit edited–unedited rendering pair, so lighting itself does not define changed pixels. A relit sample requires nonempty changed regions and at most 20% of edit-effect mass outside the union of changed and ignored regions. We then retain an object–camera–edit tuple only when both identity and relighting records are present exactly once, and both have distant ignored area no larger than changed area. A failed condition removes the pair.

Among objects with surviving pairs, more than half of the original object–camera–edit records must have passed the individual-edit filters, with at least two passing edit types. This fraction is computed before relighting expansion. Finally, two candidates are linked as duplicates if their anchor Gaussian sets have intersection over the smaller set at least 0.9, or Jaccard overlap at least 0.6. We retain one candidate per connected duplicate group, ranked by passing fraction, passing-record count, and the number of Gaussians with membership at least 0.5, with the object identifier breaking any remaining tie. Only then are retained records assigned to the reference camera subsets described above.

Synthetic training observations. We transfer rendered interventions to the corresponding real reference image. For reference image I^tref\hat{I}^{\mathrm{ref}}_t, original rendering I^t\hat{I}_t, and edited rendering I^tedit\hat{I}^{\mathrm{edit}}_t, the synthetic observation is Itsyn=Itref+I^tedit−I^tI^{\mathrm{syn}}_t = I^{\mathrm{ref}}_t + \hat{I}^{\mathrm{edit}}_t - \hat{I}_t, restricted to [0,1][0,1]. This retains the reference image’s image–render discrepancies while adding the rendered edit. An unchanged control uses the unedited rendering under the same lighting condition in place of I^tedit\hat{I}^{\mathrm{edit}}_t. The image-evidence pipeline compares each resulting observation with the original reference rendering. Applying the camera assignment above gives 11,384 edited training records across the 20 instances: 5,692 identity and 5,692 relighting records. These are object–view–edit observations, not distinct camera views.

Image evidence processing and aggregation

Query relocalisation. We follow O-SCD [8] to construct a database of registered reference keyframes. XFeat keypoints [18] are matched across reference images and triangulated with their known poses to obtain 3D points. For each query, reference keyframes are selected by descriptor-match count, and fundamental-matrix RANSAC rejects inconsistent matches. Query matches to reference keypoints with known 3D positions establish 2D–3D correspondences. PnP-RANSAC estimates the query pose, followed by reprojection-error refinement with camera intrinsics and reference points held fixed. The fixed reference 3DGS is then rendered at the estimated pose.

Input response and renderer-conditioned response suppression. The initial response uses the photometric and feature cues of O-SCD [8], rescaling their sum to [0,1][0,1]:

Rt0(u)=12[D~trgb(u)+D~tsem(u)].(17)R_t^0(u) = \frac{1}{2}\left[\widetilde{D}_t^{\mathrm{rgb}}(u) + \widetilde{D}_t^{\mathrm{sem}}(u)\right]. \tag*{(17)}

The photometric cue is Dtrgb(u)=(1−λrgb)L1,t(u)+λrgbLD-SSIM,t(u)D_t^{\mathrm{rgb}}(u) = (1-\lambda_{\mathrm{rgb}})L_{1,t}(u) + \lambda_{\mathrm{rgb}}L_{\mathrm{D\text{-}SSIM},t}(u), where L1,tL_{1,t} is the mean absolute RGB difference, LD-SSIM,t=1−SSIMtL_{\mathrm{D\text{-}SSIM},t}=1-\mathrm{SSIM}_t, and λrgb=0.2\lambda_{\mathrm{rgb}}=0.2. For encoder ϕ\phi with KK channels, the semantic discrepancy at feature-grid location ξ\xi is Dtsem(ξ)=K−1∥ϕ(I^t)ξ−ϕ(I^tref)ξ∥1D_t^{\mathrm{sem}}(\xi)=K^{-1}\lVert\phi(\hat{I}_t)_\xi-\phi(\hat{I}^{\mathrm{ref}}_t)_\xi\rVert_1. The SAM2 encoder is frozen, and both images are resized to 1024×10241024 \times1024 before feature extraction, following the O-SCD input construction. RGB values lie in [0,1][0,1]. SSIM is channel-averaged over an 11×1111 \times11 window [23], and 1/K1/K averages the feature-channel absolute differences. The tildes in (17) denote min–max normalization for RGB, and min–max normalization followed by bilinear upsampling for semantic differences. The semantic cue is then rescaled with the RGB extrema and restricted to [0,1][0,1].

Renderer-conditioned response suppression uses two logistic models with standardized inputs. Their outputs ℓbase(x)\ell_{\mathrm{base}}(x) and ℓfull(x,z)\ell_{\mathrm{full}}(x,z) are predicted change log odds. The vector xx contains the fused response, its 21×2121 \times21 mean, 7×77 \times7 standard deviation, and gradient magnitude. The full model additionally uses renderer features zz: coverage, gradients, ray-composition statistics, depth dispersion, and response–renderer interactions. The correction rule T(ℓbase,ℓfull)=min⁡{ℓfull−ℓbase,0}T(\ell_{\mathrm{base}},\ell_{\mathrm{full}})=\min\{\ell_{\mathrm{full}}-\ell_{\mathrm{base}},0\} acts on response log odds:

Rt=σ(logit⁡Rt0+T(ℓbase(xt),ℓfull(xt,zt))).(18)R_t=\sigma\left(\operatorname{logit}R_t^0+T\left(\ell_{\mathrm{base}}(x_t),\ell_{\mathrm{full}}(x_t,z_t)\right)\right). \tag*{(18)}

Both regressions use L2 regularization. The correction is lower-bounded by the 1st percentile of training logit differences and upper-bounded by zero; it is disabled where rendered coverage is at most 10−310^{-3}. Fitting and deployment use this same corrected RtR_t.

Response-to-evidence mapping. The mapping ℓimg\ell_{\mathrm{img}} is a monotone log likelihood ratio. Following § 5.1, we separately normalize response histograms for changed regions of edited images H1\mathcal{H}_1, unchanged regions of those images H0edit\mathcal{H}_0^{\mathrm{edit}}, and unedited reference controls H0ref\mathcal{H}_0^{\mathrm{ref}}. Changed regions from all edit types contribute to H1\mathcal{H}_1. The unchanged likelihood is their fixed mixture p0=12p0edit+12p0refp_0=\frac{1}{2}p_0^{\mathrm{edit}}+\frac{1}{2}p_0^{\mathrm{ref}}. These coefficients specify the relative contributions of unchanged regions in edited images and unedited controls. Isotonic regression [27] of the class-balanced changed fraction, weighted by pooled histogram mass, determines contiguous response blocks. For source s∈{1,edit,ref}s \in\{1,\mathrm{edit},\mathrm{ref}\} and block BbB_b, let MsbM_{sb} be its normalized histogram mass and NsN_s its effective training-record count. Smoothed block probabilities and the corresponding log likelihood ratio are

p^sb=NsMsb+12Ns+12KB,ℓb=log⁡p^1b12p^edit,b+12p^ref,b(19)\widehat{p}_{sb} = \frac{N_s M_{sb} + \frac{1}{2}}{N_s + \frac{1}{2}K_B}, \qquad\ell_b = \log\frac{\widehat{p}_{1b}}{\frac{1}{2}\widehat{p}_{\mathrm{edit},b} + \frac{1}{2}\widehat{p}_{\mathrm{ref},b}} \tag*{(19)}

where KBK_B is the number of current blocks. Effective counts respect training-record grouping: object–camera units for edited-image classes and camera units for unchanged controls. Violations of monotonicity after smoothing are merged and re-estimated. We interpolate the block values onto a 4,096-entry lookup table and keep the tails constant. For a response block bb, define p^0b=12p^edit,b+12p^ref,b\widehat{p}_{0b} = \frac{1}{2}\widehat{p}_{\mathrm{edit},b} + \frac{1}{2}\widehat{p}_{\mathrm{ref},b}. With equal prior weights for changed and unchanged regions, Bayes’ rule gives

Pemp,b=p^1bp^1b+p^0b=σ(ℓb).(20)P_{\mathrm{emp},b} = \frac{\widehat{p}_{1b}}{\widehat{p}_{1b} + \widehat{p}_{0b}} = \sigma(\ell_b). \tag*{(20)}

Applying the interpolated mapping gives Pt=σ(ℓimg(Rt))P_t = \sigma(\ell_{\mathrm{img}}(R_t)). These equal prior weights define the image-evidence scale. The scene-specific effective pixel prior π\pi is fitted separately using the causal prediction and field update in Eqs. (1) and (6).

Gaussian response moments. Both aggregation and support rendering use the rasterizer contributions defined in § 3. Zero denominators are guarded numerically. Pixels with insufficient reference coverage receive zero change probability but remain included in evaluation. For the second aggregation, define

rtg=[At(Ct)]g,vtg=[At(Ct2)]g−rtg2.(21)r_{tg} = [\mathcal{A}_t(C_t)]_g,\qquad v_{tg} = [\mathcal{A}_t(C_t^2)]_g - r_{tg}^2. \tag*{(21)}

Thus vtgv_{tg} measures dispersion across the current image footprint. It is not a variance of the estimated mean across independent images. The first aggregation applies the same operator to the current image evidence PtP_t.

Observation indicators. Neighbourhood evidence and history accumulation use binary support indicators,

Itg=I{stg≥1},(22)\mathbb{I}_{tg} = \mathbb{I}\{s_{tg} \ge1\}, \tag*{(22)}

where stgs_{tg} is the rendering contribution summed over the image (§ 4.2). The same rule is used in synthetic sequence replay for effective-prior estimation and in online inference. Every sufficiently supported Gaussian contributes one observation.

Unchanged-response fitting applies Eq. (22) to reference images in the unchanged-only subset. Thus each sufficiently supported observation receives equal fitting weight; observations below the support threshold are excluded. The resulting unchanged-response model and spatial co-response coefficient cc are frozen before effective-prior estimation and online inference.

Reference neighbourhoods. We first retrieve eight nearest Gaussian centres, make the candidate edges undirected, and remove duplicates and self-edges. Geometry and colour affinities then filter and weight these connections. The final undirected degree can exceed eight. For centre displacement Δxgj\Delta x_{gj}, spatial covariances Σg,Σj\Sigma_g,\Sigma_j, and reference RGB colours kg,kjk_g,k_j from the zeroth-order spherical harmonic coefficients, the affinity is

ηgj=exp⁡[−12ΔxgjT(Σg+Σj)−1Δxgj−∥kg−kj∥22scolour2].(23)\eta_{gj} = \exp\left[-\frac{1}{2}\Delta x_{gj}^{\mathsf{T}}(\Sigma_g+\Sigma_j)^{-1}\Delta x_{gj} - \frac{\lVert k_g-k_j\rVert^2}{2s_{\mathrm{colour}}^2}\right]. \tag*{(23)}

The colour scale scolours_{\mathrm{colour}} is the median nonzero colour distance among geometrically overlapping candidates, floored at 0.001. The covariance solve is regularized numerically, and the geometric squared distance is capped at 50. Edges with combined affinity no greater than 10−410^{-4} are removed. The spatial covariance matrices describe Gaussian shape. The resulting connections define each Gaussian’s local reference neighbourhood.

Unchanged-Scene Response Statistics

The frozen image-evidence pipeline is applied to the smaller camera group’s unchanged images. For image tt, aggregating current evidence CtC_t gives the Gaussian response rtg=[At(Ct)]gr_{tg} = [\mathcal{A}_t(C_t)]_g, observation indicator Itg\mathbb{I}_{tg} from Eq. (22) in Appendix § 11. All subsequent unchanged-response statistics refer to this normalized response coordinate, including current-view Gaussian-aggregated support.

Unchanged-response mean and uncertainty. All sums below use reference observations from the unchanged-only subset. The scene mean is μscene=(∑t,gItgrtg)/(∑t,gItg)\mu_{\mathrm{scene}} = \left(\sum_{t,g} \mathbb{I}_{tg}r_{tg}\right)/\left(\sum_{t,g} \mathbb{I}_{tg}\right), clipped to [10−3,1−10−3][10^{-3}, 1-10^{-3}]. To derive the response moments, start with a Beta(κμscene,κ(1−μscene))(\kappa\mu_{\mathrm{scene}}, \kappa(1-\mu_{\mathrm{scene}})) prior for response level θg\theta_g, with κ>0\kappa> 0. Updating it with fractional response counts gives

αg=κμscene+∑tItgrtg,βg=κ(1−μscene)+∑tItg(1−rtg).(24)\alpha_g = \kappa\mu_{\mathrm{scene}} + \sum_t \mathbb{I}_{tg}r_{tg}, \qquad\beta_g = \kappa(1-\mu_{\mathrm{scene}}) + \sum_t \mathbb{I}_{tg}(1-r_{tg}). \tag*{(24)}

This follows from multiplying the prior density by ∏g[θgrtg(1−θg)1−rtg]Itg\prod_g [\theta_g^{r_{tg}}(1-\theta_g)^{1-r_{tg}}]^{\mathbb{I}_{tg}} using Beta conjugacy [10]; continuous responses make this a soft-count approximation. We use the limit κ→0+\kappa\to0^{+} of the mean and variance, αg/(αg+βg)\alpha_g/(\alpha_g+\beta_g) and αgβg/[(αg+βg)2(αg+βg+1)]\alpha_g\beta_g/[(\alpha_g+\beta_g)^2(\alpha_g+\beta_g+1)]:

μg={∑tItgrtg∑tItg,∑tItg>0,μscene,∑tItg=0,τg2=μg(1−μg)1+∑tItg.(25)\mu_g = \begin{cases} \dfrac{\sum_t \mathbb{I}_{tg}r_{tg}}{\sum_t \mathbb{I}_{tg}}, & \sum_t \mathbb{I}_{tg} > 0,\\ \mu_{\mathrm{scene}}, & \sum_t \mathbb{I}_{tg} = 0, \end{cases} \qquad \tau_g^2 = \dfrac{\mu_g(1-\mu_g)}{1+\sum_t \mathbb{I}_{tg}}. \tag*{(25)}

Thus observed Gaussians use their own mean without shrinkage, while unobserved Gaussians retain the limiting scene-based moments. The implementation evaluates these moments directly, including zero limiting variance when all observed responses are zero or one. The variance represents uncertainty in this soft-count construction, not the empirical predictive variance of a new image. At inference, we use the approximate standardized coordinate

ztg=rtg−μgτg2+vtg.(26)z_{tg} = \dfrac{r_{tg}-\mu_g}{\sqrt{\tau_g^2+v_{tg}}}. \tag*{(26)}

The denominator combines uncertainty in the fitted unchanged-response level with dispersion within the current image footprint to define a working standardization scale.

Spatial co-response in unchanged scenes. To estimate spatial correlation, first standardize reference responses by each Gaussian’s empirical weighted mean and across-view standard deviation, giving z~tg\widetilde{z}_{tg}. These empirical statistics are used for estimating cc, and are distinct from Eq. (26). For neighbourhood affinity ηgj\eta_{gj} and edge weight ωtgjfit=ηgjmin⁡(Itg,Itj)\omega_{tgj}^{\mathrm{fit}}=\eta_{gj}\min(\mathbb{I}_{tg},\mathbb{I}_{tj}), summing over the unchanged-only subset gives

c=∑t,(g,j)ωtgjfitz~tgz~tj∑t,(g,j)ωtgjfit.(27)c = \dfrac{\sum_{t,(g,j)} \omega_{tgj}^{\mathrm{fit}}\widetilde{z}_{tg}\widetilde{z}_{tj}}{\sum_{t,(g,j)} \omega_{tgj}^{\mathrm{fit}}}. \tag*{(27)}

Conditional Neighbourhood Bayes Factor

Weighted neighbourhood statistics. For neighbours jj of Gaussian gg, let ωtgj=ηgjItj\omega_{tgj}=\eta_{gj}\mathbb{I}_{tj} and Wtg=∑jωtgjW_{tg}=\sum_j\omega_{tgj}. For Wtg>0W_{tg}>0,

z‾tg=∑jωtgjztjWtg,dtg=∑jωtgj(ztj−z‾tg)2Wtg,ntg=Wtg2∑jωtgj2.(28)\overline{z}_{tg}=\dfrac{\sum_j\omega_{tgj}z_{tj}}{W_{tg}}, \qquad d_{tg}=\dfrac{\sum_j\omega_{tgj}(z_{tj}-\overline{z}_{tg})^2}{W_{tg}}, \qquad n_{tg}=\dfrac{W_{tg}^2}{\sum_j\omega_{tgj}^2}. \tag*{(28)}

Here z‾tg\overline{z}_{tg} is the weighted mean, dtgd_{tg} the weighted dispersion, and ntgn_{tg} the effective neighbour count. The working variance VtgV_{tg} of that mean accounts for dispersion and correlation; νtg\nu_{tg} is the conditional residual variance used by the Bayes factor:

Vtg=max⁡(1,dtg)max⁡(1,ntg)[1+c(ntg−1)],νtg=max⁡(Vtg−c2,ϵν).(29)V_{tg}=\dfrac{\max(1,d_{tg})}{\max(1,n_{tg})}\left[1+c(n_{tg}-1)\right], \qquad\nu_{tg}=\max(V_{tg}-c^2,\epsilon_\nu). \tag*{(29)}

Here (x)+=max⁡(x,0)(x)_+=\max(x,0), and we use variance floor ϵν=10−4\epsilon_\nu=10^{-4}.

Why subtract the anchor response? Suppressing the frame and anchor indices, write z‾=z‾tg\overline{z}=\overline{z}_{tg}, zg=ztgz_g=z_{tg}, V=VtgV=V_{tg}, and ν=νtg\nu=\nu_{tg}. We use a zero-mean Gaussian working model under unchanged conditions. Setting Var⁡(zg∣H0)=1\operatorname{Var}(z_g\mid\mathcal{H}_0)=1 and approximating Cov⁡(z‾,zg∣H0)\operatorname{Cov}(\overline{z},z_g\mid\mathcal{H}_0) by cc gives the conditional mean

E[z‾∣zg,H0]=Cov⁡(z‾,zg∣H0)Var⁡(zg∣H0)zg≈czg.(30)\mathbb{E}[\overline{z}\mid z_g,\mathcal{H}_0]=\dfrac{\operatorname{Cov}(\overline{z},z_g\mid\mathcal{H}_0)}{\operatorname{Var}(z_g\mid\mathcal{H}_0)}z_g\approx cz_g. \tag*{(30)}

The corresponding conditional variance is V−c2V-c^2. Unit anchor variance is a fixed modelling scale: Eq. (26) does not guarantee that the empirical variance of zgz_g equals one. Using cc transfers the spatial co-response estimated in Eq. (27) to this working model as a covariance approximation. The residual variance remains neighbourhood-dependent through Eq. (29). A shared increase δ\delta in the responses of the anchor and neighbours leaves residual mean (1−c)δ(1-c)\delta. This motivates e=zˉ−czge=\bar{z}-cz_g and loading a=1−ca=1-c.

Within this residual model, H0\mathcal{H}_0 denotes zero residual mean and H1\mathcal{H}_1 a shared increase in response, with half-normal prior scale τ\tau:

H0:e∼N(0,ν),H1:e∣δ∼N(aδ,ν),δ∼HalfNormal⁡(τ),τ=1.(31)\mathcal{H}_0:e\sim\mathcal{N}(0,\nu),\qquad\mathcal{H}_1:e\mid\delta\sim\mathcal{N}(a\delta,\nu),\qquad\delta\sim\operatorname{HalfNormal}(\tau),\qquad\tau=1. \tag*{(31)}

The variance floor in Eq. (29) also regularizes cases where the plug-in covariance approximation is not positive definite.

Integrating over the response increase. We evaluate the marginal likelihood of the residual ee with aa and ν>0\nu>0 held fixed. For δ≥0\delta\ge0, the half-normal density p+(δ)p_+(\delta) is

p+(δ)=2N(δ;0,τ2)=22πτ2exp⁡(−δ22τ2).p_+(\delta)=2\mathcal{N}(\delta;0,\tau^2)=\frac{2}{\sqrt{2\pi\tau^2}}\exp\left(-\frac{\delta^2}{2\tau^2}\right).

Here τ>0\tau>0 is the enhancement prior scale, fixed to 1 in our method; it is distinct from the fitted uncertainty τg2\tau_g^2. Since the enhancement δ\delta is unknown, the marginal likelihood p(e∣H1)p(e\mid\mathcal{H}_1) integrates over this prior:

p(e∣H1)=∫0∞N(e;aδ,ν)p+(δ) dδ.p(e\mid\mathcal{H}_1)=\int_0^\infty\mathcal{N}(e;a\delta,\nu)p_+(\delta)\,\mathrm{d}\delta.

The local Bayes factor BB therefore becomes

B=p(e∣H1)p(e∣H0)=∫0∞N(e;aδ,ν)N(e;0,ν)p+(δ) dδ.B=\frac{p(e\mid\mathcal{H}_1)}{p(e\mid\mathcal{H}_0)}=\int_0^\infty\frac{\mathcal{N}(e;a\delta,\nu)}{\mathcal{N}(e;0,\nu)}p_+(\delta)\,\mathrm{d}\delta.

Both likelihoods have variance ν\nu, so their normalization factors cancel. Expanding the squared terms gives

N(e;aδ,ν)N(e;0,ν)=exp⁡(−(e−aδ)22ν+e22ν)=exp⁡(−e2−2aeδ+a2δ2−e22ν)=exp⁡(aeνδ−a22νδ2).\begin{aligned} \frac{\mathcal{N}(e;a\delta,\nu)}{\mathcal{N}(e;0,\nu)} =\exp\left(-\frac{(e-a\delta)^2}{2\nu}+\frac{e^2}{2\nu}\right) \\ &=\exp\left(-\frac{e^2-2ae\delta+a^2\delta^2-e^2}{2\nu}\right) \\ &=\exp\left(\frac{ae}{\nu}\delta-\frac{a^2}{2\nu}\delta^2\right). \end{aligned}

Multiplying by the half-normal prior yields

B=22πτ2∫0∞exp⁡[aeνδ−12(a2ν+τ−2)δ2] dδ.B=\frac{2}{\sqrt{2\pi\tau^2}}\int_0^\infty\exp\left[\frac{ae}{\nu}\delta-\frac{1}{2}\left(\frac{a^2}{\nu}+\tau^{-2}\right)\delta^2\right]\,\mathrm{d}\delta.

Define the coefficients h=ae/νh=ae/\nu and J=a2/ν+τ−2>0J=a^2/\nu+\tau^{-2}>0. Completing the square gives

hδ−12Jδ2=−J2(δ2−2hJδ)=−J2[(δ−hJ)2−h2J2]=−J2(δ−hJ)2+h22J.\begin{aligned} h\delta-\frac{1}{2}J\delta^2=-\frac{J}{2}\left(\delta^2-\frac{2h}{J}\delta\right) \\ &=-\frac{J}{2}\left[\left(\delta-\frac{h}{J}\right)^2-\frac{h^2}{J^2}\right] \\ &=-\frac{J}{2}\left(\delta-\frac{h}{J}\right)^2+\frac{h^2}{2J}. \end{aligned}

The last term does not depend on δ\delta, so

B=22πτ2exp⁡(h22J)∫0∞exp⁡[−J2(δ−hJ)2] dδ.B=\frac{2}{\sqrt{2\pi\tau^2}}\exp\left(\frac{h^2}{2J}\right)\int_0^\infty\exp\left[-\frac{J}{2}\left(\delta-\frac{h}{J}\right)^2\right]\,\mathrm{d}\delta.

To evaluate the remaining integral, substitute x=J(δ−h/J)x = \sqrt{J}(\delta- h/J), giving dδ=dx/J\mathrm{d}\delta= \mathrm{d}x/\sqrt{J}. The lower limit δ=0\delta= 0 becomes x=−h/Jx = -h/\sqrt{J}, while the upper limit remains infinity. Thus

B=2τJexp⁡(h22J)[12π∫−h/J∞e−x2/2 dx].B = \frac{2}{\tau\sqrt{J}}\exp\left(\frac{h^2}{2J}\right)\left[\frac{1}{\sqrt{2\pi}}\int_{-h/\sqrt{J}}^{\infty}e^{-x^2/2}\,\mathrm{d}x\right].

Writing Φ\Phi for the standard normal cumulative distribution function, the bracketed term equals

1−Φ(−hJ)=Φ(hJ),1-\Phi\left(-\frac{h}{\sqrt{J}}\right)=\Phi\left(\frac{h}{\sqrt{J}}\right),

by symmetry of the standard normal distribution. The resulting Bayes factor BB is

B=2τJexp⁡(h22J)Φ(hJ).(32)B=\frac{2}{\tau\sqrt{J}}\exp\left(\frac{h^2}{2J}\right)\Phi\left(\frac{h}{\sqrt{J}}\right). \tag*{(32)}

Taking logarithms gives the log evidence log⁡B\log B:

log⁡B=log⁡2−log⁡τ−12log⁡J+h22J+log⁡Φ(hJ).(33)\log B=\log2-\log\tau-\frac{1}{2}\log J+\frac{h^2}{2J}+\log\Phi\left(\frac{h}{\sqrt{J}}\right). \tag*{(33)}

With τ=1\tau=1, restoring the indices gives htg=(1−c)etg/νtgh_{tg}=(1-c)e_{tg}/\nu_{tg} and Jtg=(1−c)2/νtg+1J_{tg}=(1-c)^2/\nu_{tg}+1, recovering Eq. (5). The Gaussian likelihood and half-normal prior make the exponent quadratic in δ\delta, reducing marginalization to a standard normal CDF evaluation. The integral is therefore evaluated analytically under the specified residual model, without numerical integration or iterative optimization. If no neighbour has positive observation weight, we use neutral evidence B=1B=1, so the log evidence is zero.

Implementation bounds. We evaluate log⁡Φ(h/J)\log\Phi(h/\sqrt{J}) directly using the numerically stable log_ndtr function, avoiding an explicit CDF floor. The implementation floors τg2+νtg\tau_g^2+\nu_{tg} at 10−610^{-6} to avoid division by zero, while ϵν=10−4\epsilon_\nu=10^{-4} prevents a degenerate residual variance.

We clip standardized responses and per-observation log Bayes factors to [−12,12][-12,12] to limit the influence of extreme observations. These bounds are fixed across scenes. The dispersion floor and correlation adjustment in Eq. (29) are part of the working model.

Accumulated Support and Causal Decoding

Generalized pixel posterior. Let y=1y=1 denote pixel change and y=0y=0 no change. For a support value p∈(0,1)p\in(0,1), define the binary cross-entropy loss and the sum used for fusion:

BCE⁡(y,p)=−ylog⁡p−(1−y)log⁡(1−p),\operatorname{BCE}(y,p)=-y\log p-(1-y)\log(1-p),
Lt(y,u)=BCE⁡(y,Ct(u))+BCE⁡(y,Ht(u)).(34)\mathcal{L}_t(y,u)=\operatorname{BCE}(y,C_t(u))+\operatorname{BCE}(y,H_t(u)). \tag*{(34)}

The two terms assign unit weight to agreement with current evidence and historical support. Let qt(y∣u)q_t(y\mid u) denote the generalised posterior distribution over the two labels at pixel uu, formed from Ct(u)C_t(u), Ht(u)H_t(u), and prior π\pi. A loss-based Bernoulli update (Bissiri et al. [4]) gives

qt(y∣u)=πy(1−π)1−yexp⁡[−Lt(y,u)]∑v∈{0,1}πv(1−π)1−vexp⁡[−Lt(v,u)].(35)q_t(y\mid u)=\frac{\pi^y(1-\pi)^{1-y}\exp[-\mathcal{L}_t(y,u)]}{\sum_{v\in\{0,1\}}\pi^v(1-\pi)^{1-v}\exp[-\mathcal{L}_t(v,u)]}. \tag*{(35)}

Taking the ratio of the two label probabilities gives

qt(1∣u)qt(0∣u)=π1−πCt(u)1−Ct(u)Ht(u)1−Ht(u).(36)\frac{q_t(1\mid u)}{q_t(0\mid u)}=\frac{\pi}{1-\pi}\frac{C_t(u)}{1-C_t(u)}\frac{H_t(u)}{1-H_t(u)}. \tag*{(36)}

The scalar map Qtpixel(u)=qt(y=1∣u)Q_t^{\mathrm{pixel}}(u)=q_t(y=1\mid u) contains the generalised posterior probability of change; qt(y=0∣u)=1−Qtpixel(u)q_t(y=0\mid u)=1-Q_t^{\mathrm{pixel}}(u). This gives the odds update in Eq. (1), equivalently Qtpixel=σ(logit⁡π+logit⁡Ct+logit⁡Ht)Q_t^{\mathrm{pixel}}=\sigma(\operatorname{logit}\pi+\operatorname{logit}C_t+\operatorname{logit}H_t). The implementation evaluates this closed form; the loss representation adds no training step. It specifies a composite evidence update rather than a factorization into independent observations. Selecting π\pi by synthetic training IoU is a separate optimization objective from Lt\mathcal{L}_t; neither that selection nor normalization guarantees exact probabilities on the target distribution.

Accumulated neighbourhood evidence. After pixel prediction, each sufficiently supported observation adds its log Bayes factor to the previous accumulated field Ft−1F_{t-1}, giving the updated accumulated field FtF_t:

Ftg=Ft−1,g+Itglog⁡Btg.(37)F_{tg}=F_{t-1,g}+I_{tg}\log B_{tg}. \tag*{(37)}

The accumulator starts at zero; the decoded support depends directly on FtgF_{tg}. Neither initial image responses nor final pixel posteriors are written into this state. An observed Gaussian without usable neighbours contributes zero log evidence and leaves the accumulator unchanged.

Rendering the previous support. The previous accumulated field Ft−1F_{t-1} is decoded per Gaussian before rendering:

Ht(u)=∑gatugσ(Ft−1,g)χtu.(38)H_t(u)=\frac{\sum_g a_{tug}\sigma(F_{t-1,g})}{\chi_{tu}}. \tag*{(38)}

The sigmoid is applied to each Gaussian before spatial averaging; only then do we take logit HtH_t for the pixel update. The normalized contributions atug/χtua_{tug}/\chi_{tu} mix support from reference Gaussians associated with the pixel. With no previous observations, F=0F=0, giving σ(F)=0.5\sigma(F)=0.5 and neutral history on covered pixels. The effective prior π\pi is applied after this rendering and leaves the Gaussian evidence accumulator unchanged.

Effective-prior search parameterization and storage. Let Z=logit⁡C+logit⁡HZ=\operatorname{logit} C+\operatorname{logit} H. The generalised posterior is σ(Z+logit⁡π)=σ(Z−bπ)\sigma(Z+\operatorname{logit}\pi)=\sigma(Z-b_\pi), where bπ=−logit⁡πb_\pi=-\operatorname{logit}\pi. For threshold search the implementation uses the equivalent coordinate s=Z/2s=Z/2, β=bπ/2\beta=b_\pi/2, so σ(Z−bπ)=σ(2(s−β))\sigma(Z-b_\pi)=\sigma(2(s-\beta)) and the mask is determined by s≥βs\ge\beta. The scale factor is retained when evaluating scores. The fitted prior is stored directly in log-odds form.

Before evaluating their logits, we clamp CC and HH to [ϵfp32,1−ϵfp32][\epsilon_{\mathrm{fp32}},1-\epsilon_{\mathrm{fp32}}], where ϵfp32=2−23\epsilon_{\mathrm{fp32}}=2^{-23} is the machine epsilon for float32, to avoid infinities at 0 and 1.2 Synthetic replay and online detection use the same floating-point probability maps, coverage mask, and decoding rule. Execution order. For each query image, the implementation:

  1. computes the image–render response, applies the learned response suppression, and applies the monotone evidence mapping;

  2. aggregates this score onto the Gaussians, renders Gaussian-aggregated support, and combines the two to obtain CtC_t;

  3. aggregates CtC_t once, standardizes against the unchanged-response model, and computes conditional neighbourhood evidence;

  4. renders history from the previous accumulated field Ft−1F_{t-1} and combines it with CtC_t using the fitted effective prior to obtain the pixel posterior;

  5. adds the current log Bayes factor to the evidence accumulator for each sufficiently supported Gaussian exactly once.

Object-guided mask refinement acts on the image prediction without modifying history. A new target sequence starts with empty state.

Insufficient reference coverage. The observation indicator ItgI_{tg} prevents history updates when Gaussian gg’s total rendering contribution is below one; without usable neighbours, log⁡Btg=0\log B_{tg}=0. Pixels with reference coverage at most 10−310^{-3} are assigned zero change probability and excluded from object completion, but remain in the evaluation domain. These rules avoid unsupported updates but cannot recover missing geometry, so changes in uncovered regions may be missed. The indicator measures rendering contribution, not geometric accuracy.

Reliability-Weighted Effective-Prior Estimation

The effective pixel prior is fitted for the synthetic training objective in Eq. (13); it specifies an operating point, not an estimate of deployment change frequency. We implement this optimization through the equivalent threshold coordinate b_\pi=-\logit\pi, using s=Z/2s=Z/2 and β=bπ/2\beta=b_\pi/2 for the deployment-matched search below. This one-to-one reparameterization preserves the objective and its optimality gap. For image ii, foreground IoU is IoU⁡(Y^pixel(π),Yi)=TP⁡i(π)/(Ni++FP⁡i(π))\operatorname{IoU}(\widehat{Y}^{\mathrm{pixel}}(\pi),Y_i)=\operatorname{TP}_i(\pi)/(N_i^{+}+\operatorname{FP}_i(\pi)), where Ni+N_i^{+} counts labelled changed pixels, and TP⁡i\operatorname{TP}_i and FP⁡i\operatorname{FP}_i count true and false positives before refinement.

Comparing unchanged-response tails across events. For synthetic image ii, let H0,iH_{0,i} be its labelled unchanged pixels and si(x)s_i(x) the decision score at pixel xx. For a score cutoff vv, the unchanged survival curve is the fraction of these pixels exceeding it:

Ti(v)=∣{x∈H0,i:si(x)≥v}∣∣H0,i∣.(39)T_i(v)=\frac{\left|\left\{x\in H_{0,i}:s_i(x)\ge v\right\}\right|}{\left|H_{0,i}\right|}. \tag*{(39)}

An edit event is an object/edit-type combination. First average TiT_i within each event ee to obtain T‾e\overline{T}_e. For an image from event ee, its reference curve is the pointwise median of T‾e′\overline{T}_{e'} over other events e′≠ee'\ne e, denoted T‾−e\overline{T}_{-e}. This forms an unchanged-response reference across events, limiting the influence of repeated images of any one event.

Let e(i)e(i) be image ii’s event and [vmin⁡,vmax⁡][v_{\min},v_{\max}] the range of training-score cutoffs used to compare tails. Excess high response is

di=1vmax⁡−vmin⁡∫vmin⁡vmax⁡[Ti(v)−T‾−e(i)ref(v)] dv.(40)d_i=\frac{1}{v_{\max}-v_{\min}}\int_{v_{\min}}^{v_{\max}}\left[T_i(v)-\overline{T}_{-e(i)}^{\mathrm{ref}}(v)\right]\,dv. \tag*{(40)}

The implementation evaluates this integral by the trapezoidal rule on the fixed training-score cutoffs. The subsequent decision-threshold search operates over the full score range.

Let De=median⁡i:e(i)=ediD_e=\operatorname{median}_{i:e(i)=e}d_i. For event ee, compute the centre m−em_{-e} and scale a−ea_{-e} from the other event medians:

m−e=median⁡e′≠eDe′,a−e=1.4826median⁡e′≠e∣De′−m−e∣,m_{-e}=\operatorname{median}_{e'\ne e}D_{e'},\qquad a_{-e}=1.4826\operatorname{median}_{e'\ne e}\left|D_{e'}-m_{-e}\right|,
zitail=[di−m−e(i)a−e(i)]+,ρi=11+(zitail)2.(41)z_i^{\mathrm{tail}}=\left[\frac{d_i-m_{-e(i)}}{a_{-e(i)}}\right]_{+},\qquad\rho_i=\frac{1}{1+\left(z_i^{\mathrm{tail}}\right)^2}. \tag*{(41)}

Images with zitail=0z_i^{\mathrm{tail}}=0 receive weight one; standardized excesses of one and two receive weights 1/21/2 and 1/51/5. The factor 1.4826 scales the median absolute deviation (MAD) to match the standard deviation under a Gaussian model. The deployed fit requires positive across-event MAD. We retain the original pixel counts and IoU definitions; ρi\rho_i weights each image’s contribution to the mean IoU according to its unchanged-response reliability.

Training sequences and fixed weights. Sequences of images from the editing subset use the same image-evidence pipeline, unchanged-response model, history update order, and pixel prediction rule as online inference. The weights in Eq. (41) are normalized as ρ~i=ρi/∑jρj\widetilde{\rho}_i=\rho_i/\sum_j\rho_j, computed once before searching for the threshold and remain fixed throughout optimization. Synthetic labels supply the unchanged regions used for reliability weighting and the changed regions used for IoU.

A valid branch-and-bound upper bound. Let J(v)J(v) be the reliability-weighted IoU at decision threshold vv in the ss coordinate. Increasing vv can only decrease both TP and FP. Consequently, for any interval [l,r][l,r] and any vv within it,

J(v)≤U(l,r)=∑iρ~iTP⁡i(l)Ni++FP⁡i(r).(42)J(v)\le U(l,r)=\sum_i\widetilde{\rho}_i\frac{\operatorname{TP}_i(l)}{N_i^{+}+\operatorname{FP}_i(r)}. \tag*{(42)}

The numerator at ll bounds candidate numerators from above, and the denominator at rr bounds denominators from below. Nonnegative weights preserve the bound under summation, even if no threshold attains it.

The search starts from a range enclosing the training scores, including all-positive and all-negative decisions. Sorted changed and unchanged scores support exact count queries by binary search. The optimizer maintains the best evaluated objective JbestJ_{\mathrm{best}}, splits the remaining interval with the highest bound, evaluates new candidates, and prunes intervals whose bound cannot improve the best objective value found so far. It stops when

max⁡remaining intervalsU(l,r)−Jbest≤10−4.(43)\max_{\text{remaining intervals}} U(l,r)-J_{\mathrm{best}}\le10^{-4}. \tag*{(43)}

This is 0.01 percentage points in the synthetic training IoU objective. Midpoint subdivision does not require IoU to be monotone or unimodal. The certificate applies to the recorded, weighted training objective with the deployment pixel prediction rule.

Object-Guided Mask Refinement

Object-guided mask refinement uses shared SAM2 image embeddings to suppress unsupported detections and complete retained object regions.

Contour learning from pixel proposals. We process sequences of images from the editing subset with the fixed pixel models, effective prior, and causal history. Thresholding the source pixel posterior at 0.5 produces connected components whose boxes prompt SAM2 on the synthetic query and reference rendering. Predictions supply prompts only: change masks from automatic reference edits (Appendix § 11.§ 1) supply pixel labels, and ignored pixels are excluded.

The classifier uses 18 query/reference-symmetric features. We rank SAM2’s three candidates independently in each view by predicted IoU and pair them by rank, forming paired mask logits, quality scores, and their per-side products. Each pair is replaced by its maximum and minimum, using the same transformation during fitting and inference. This retains support from either image regardless of which side contains the object. Within each source image, existing class-balanced pixel weights are multiplied once by its fixed prior-fitting reliability ρi\rho_i. Global balancing then gives each class total weight 0.5 within its fitting or validation split. These weights are used for feature standardization, L2L2-regularized logistic regression, and Platt sigmoid scaling (Platt [17]). At inference, standardization and both fitted affine transformations are folded into a single affine score ℓcontour\ell_{\mathrm{contour}} on the unstandardized symmetric features. The contour fitting/validation split is by edited object; upstream pixel models still use the larger camera group. The pixel parameters and prior are unchanged.

Online contour filtering. We decode masks on the query image and reference rendering using bounding-box prompts from detected connected components. The fitted classifier converts their mask-comparison features into ℓcontour(u)\ell_{\mathrm{contour}}(u). Its non-positive part gives the contour-filtered score Qtcontour(u)Q^{\mathrm{contour}}_t(u) through Eq. (8).

Object completion. Point prompts at response peaks of the surviving components produce SAM2 candidates in the query image. For each prompt, we select the candidate with highest predicted mask quality. For a candidate mask MM over covered pixels, its mean log-odds evidence is L‾M=∣M∣−1∑u∈Mlogit⁡Qtpixel(u)\overline{L}_M = |M|^{-1} \sum_{u\in M} \operatorname{logit} Q^{\mathrm{pixel}}_t(u), where ∣M∣|M| is the number of covered pixels in the mask. We retain masks with L‾M≥0\overline{L}_M \ge0 and combine their confidence σ(L‾M)\sigma(\overline{L}_M) with QtcontourQ^{\mathrm{contour}}_t to obtain the refined change score QtfullQ^{\mathrm{full}}_t using Eq. (9). The component filter skips regions smaller than the SAM feature cell, and empty or uncovered masks are excluded. The pixel prior is already included in QtpixelQ^{\mathrm{pixel}}_t; refinement modifies only the final output.

Additional Quantitative Results

Table 5 reports the full 20-instance comparison for the pixel and full outputs in Table 1.

Cross-instance Reference Reuse

Each PASLCD scene has two instances. We retain the reference reconstruction and all fitted parameters from one instance and evaluate queries from the other, in both directions. This gives 20 directed pairs, each with 25 frames. The reused parameters include response suppression, the LLR mapping, Gaussian-indexed unchanged-response statistics and spatial co-response, the pixel prior, and the contour filter. No parameters are refitted or selected using target data, and each sequence starts with empty history.

Queries are processed on the reference image canvas using reference-derived poses and initial difference cues. Query RGB is resized to this canvas for refinement, and the fixed reference model is rendered at the query pose. Predictions are evaluated against the target instance’s original masks using the same resizing and thresholding convention as the main experiments. Table 7 reports all pairs. The original and cross-instance aggregate comparisons each contain every target instance once. Because the paired query sets are highly similar, this experiment tests within-scene reference reuse rather than cross-scene generalization. Runtime was not measured.

SceneDirectionPixel outputFull output
mIoUF1mIoUF1
Cantina1→21 \to257.8272.6162.8776.17
Cantina2→12 \to154.8970.0857.8872.29
Garden1→21 \to267.2179.6573.7684.35
Garden2→12 \to166.9980.0374.5385.33
Lounge1→21 \to268.9481.4874.8885.47
Lounge2→12 \to148.1064.0658.4072.57
Lunch room1→21 \to247.5362.0948.5062.13
Lunch room2→12 \to146.3160.9849.6462.93
Meeting room1→21 \to256.7871.6864.2977.52
Meeting room2→12 \to152.9868.3363.6276.19
Playground1→21 \to252.4167.1357.2570.78
Playground2→12 \to150.5265.2156.3769.29
Porch1→21 \to274.0884.6482.1089.54
Porch2→12 \to163.1376.2969.8480.60
Pots1→21 \to273.1284.3887.3593.19
Pots2→12 \to155.7271.1674.6085.13
Printing area1→21 \to275.1185.5577.9287.37
Printing area2→12 \to159.7974.2964.0777.33
Zen1→21 \to267.6276.3075.3781.07
Zen2→12 \to159.4771.7669.6778.91
Mean59.9373.3967.1578.41

Table 7. Cross-instance results for all 20 directed PASLCD pairs (%). Direction denotes reference instance →\to query instance. Pixel and full outputs use the same fixed reference reconstruction and fitted parameters.

Fitted Priors and Change Area

We analyse the scene-specific priors fitted from reference edits.

Figure 5 shows the effective pixel priors π⋆\pi^\star fitted from reference data for the 20 PASLCD instances. They range from 0.00588 to 0.30471, with median 0.02368 and interquartile range [0.01487, 0.05489]. Each prior selects an instance-specific decision operating point and remains fixed during online inference; it does not estimate the fraction of changed pixels in a query image.

Figure 5. Fitted pixel priors on PASLCD. Each scene has a distinct colour; circles and squares denote its two instances, joined by a dashed line. The vertical dotted line marks the median over all 20 instances. The horizontal axis uses a logarithmic scale.

To examine performance across change sizes, we group the 500 evaluated frames by the fraction of ground-truth changed pixels, keeping all fitted parameters and predictions unchanged (Table 8). For each query, we average the metrics from the two complete runs, then average over queries within each group, with false-positive rate FPR = FP/(FP + TN) and false-negative rate FNR = FN/(TP + FN). Frames with less than 1% change have lower mIoU and higher FNR than the 1–5% group; refinement improves their mIoU while slightly increasing FNR. The observed change fractions span 0.17–20.13%, with only one frame above 20% and none at 30% or higher. Scene and viewpoint composition differ across groups, so this analysis describes fixed-prior performance rather than isolating the effect of change area or establishing robustness to prior drift.

Change areaFramesInstancesmIoU↑FPR↓FNR↓mIoU↑FPR↓FNR↓
< 1%881249.500.6436.1354.830.5837.74
1–5%2981861.180.9618.1870.110.6016.69
5–10%841266.390.9724.8871.120.6722.48
10–20%29467.351.6725.2771.101.4422.38
20–30%1163.445.1923.5066.874.8220.33

Table 8. PASLCD performance by ground-truth change area. Metrics average two runs over the same 500 queries (%). The 20–30% group contains only one frame; no evaluated frame has ≥ 30% change area. Pixel output and Refined output.

Relighting Strength

We vary the strength of the reference-fitted colour perturbation while retaining the object edits, labels, camera subsets, and query order. For each selected coefficient vector θ\theta, we use θK=θid+K(θ−θid)\theta_K = \theta_{\mathrm{id}} + K(\theta- \theta_{\mathrm{id}}), where θid\theta_{\mathrm{id}} gives the identity colour transform, and render the transformed Gaussian colours with the same clipping rule. The default is K=1K = 1; K=0K = 0 removes the relighting perturbation, and K=2K = 2 doubles it. At K=0K = 0, the relighting sample slots are retained with identity coefficients, so all settings contain the same 11,384 training records. For K=0K = 0 and K=2K = 2, we refit suppression, the likelihood-ratio mapping, unchanged-response statistics, image weights, the pixel prior, and the contour filter using only reference data and the same fitting settings. Table 9 reports pixel and full outputs on the same 20 PASLCD instances and 500 query frames, with K=1K = 1 reusing the main results.

Default relighting improves full-output mIoU by 0.66 points over K=0K = 0, with gains in 13 of 20 instances. Doubling the strength changes pixel and full mIoU by +0.03 and −0.07 points, respectively, relative to the default. These results indicate a modest benefit from the adopted augmentation, with similar aggregate performance at K=1K = 1 and K=2K = 2.

Construction of Historical Support

We compare two ways of constructing historical support: our Bayes-factor accumulation and temporal averaging, using pixel outputs on the same 20 PASLCD instances and 500 frames. Temporal averaging takes the mean of each Gaussian’s valid responses rtg=[At(Ct)]gr_{tg} = [A_t(C_t)]_g across earlier frames, selected by ItgI_{tg}, and assigns support 0.5 to unobserved Gaussians. These values are rendered to obtain HtH_t, with prediction preceding the current update as in our method. We retain the image-evidence pipeline and query order, and refit the pixel prior on the editing subset using the same fitting procedure, without target labels. Table 10 reuses the no-history and full-pixel results from Table 3. Our construction improves mean mIoU by 4.42 points over temporal averaging and performs better in 16 of 20 instances.

Table 10: Historical support on PASLCD, averaged over 20 instances (%, higher is better). Ours uses Bayes-factor accumulation. All results use pixel outputs without refinement.

Historical supportmIoU ↑F1 ↑
None57.8171.67
Temporal averaging55.9470.27
Ours60.3673.80

Table 10.

Evaluation and Runtime Details

Evaluation and repeatability. Queries are processed from raw images, with pose estimation and feature extraction performed online. The main PASLCD results (Tables 1 and Table 5) and ablations (Table 3, Table 9, and Table 10) average two complete runs over all 500 queries per configuration. For the full method, both runs achieve 67.64% mIoU; the largest per-instance difference is 0.019 percentage points. CCS3D uses all 18 queries across four scenes at 2×2{\times} downsampling. Binary predictions are resized to the union masks by nearest-neighbour interpolation; Table 2 averages per-scene metrics equally over two runs.

Table 5: PASLCD comparison using our evaluator over 20 scene-instances (%, higher is better). O-SCD(O) is online; O-SCD(R) includes offline refinement. Ours (pixel) is the pixel output; Ours (full) adds object-guided mask refinement. Our results average two complete runs; Total summarizes all 20 instances. Cell backgrounds mark first, second, and third place for each row and metric; these values are bold, and ties at the displayed precision share a rank.

SceneInst.O-SCD(O) mIoUO-SCD(O) F1O-SCD(R) mIoUO-SCD(R) F1Ours pixel mIoUOurs pixel F1Ours full mIoUOurs full F1
Cantina150.2465.8662.0576.0557.8472.6862.7976.23
249.3865.1654.7570.1955.2970.4858.9873.16
Garden149.5865.5252.2867.0768.3880.4375.3185.33
251.5467.7856.6272.2767.4480.3774.7785.51
Lounge154.7470.3860.0474.9168.9681.4175.1885.63
247.7564.1247.9663.7848.7464.6359.2873.31
Lunch room138.8553.9549.1964.3648.5363.1849.8363.59
238.1853.4849.1564.6047.6162.4751.1464.51
Meeting room149.1765.3955.4470.8357.2872.0762.9276.00
245.5361.8351.6667.5053.0768.3864.1476.62
Playground138.7454.1833.8949.6851.8966.6956.4770.08
236.2251.6431.1946.1351.2065.9857.2870.29
Porch157.0271.8271.4883.1473.6384.3381.4089.03
253.0368.5863.6077.4663.3076.7970.8381.89
Pots160.8375.3765.2078.4973.4884.6487.1193.05
257.6772.6363.0476.8955.7571.0474.8485.17
Printing area160.6974.6069.6881.8275.9786.1178.0687.46
252.1167.9457.8673.0361.9576.2466.9579.82
Zen147.4260.7262.2372.3367.4676.1575.5581.31
246.1760.9762.5474.8859.5271.9270.0179.47
Total49.2464.6055.9970.2760.3673.8067.6478.87

Table 5.

Continuous sequence timing. After initialization, synchronized wall-clock timing starts before the first query is retrieved and ends when the final mask is ready. Input prefetching starts during initialization for both methods; remaining input waits and all inter-frame work are included. O-SCD also waits for GPU work to complete at its stage synchronization points; these waits are included in the timed sequence. Mask export and metric evaluation occur outside timing. FPS is the total number of processed frames divided by summed sequence duration: 1,000 frames across two runs for each of our output modes and 500 frames for O-SCD(O). The pixel runs achieve 27.88 and 27.98 FPS; the full runs achieve 17.15 and 17.19 FPS.

Batch refinement timing. O-SCD(R) first processes the query images sequentially, then jointly refines its change representation using all views and renders the final masks. Its timing covers this complete procedure, from the first input retrieval to the last refined mask, excluding initialization and file export. We divide total sequence time by the number of frames for Table 4; the resulting per-frame time and equivalent FPS describe batch processing, not online prediction latency. Over the same 20 instances, complete processing averages 5.03 s per 25-frame sequence, including 3.29 s of post-sequence optimization and 6.48 ms of final mask rendering.

Initialization. Initialization comprises loading scene and model parameters, preparing reference matching data, and pre-executing model and GPU operations using non-test inputs. Both methods run SAM on all-zero inputs. Our method additionally processes a fixed reference-edit observation twice through the complete detection pipeline, using synthetic data already available from offline editing. We then restore the detector history, reference matching state, and random-generator states before processing the query sequence. Initialization averages 14.08 s for our pixel pipeline, 15.54 s for our full pipeline, and 7.16 s for O-SCD(O). The two reference-edit passes take 0.111 and 0.168 s for the pixel and full pipelines. Mean first-frame latency is 35.55, 58.24, and 110.38 ms, respectively.

Stage-wise timing. The frontend comprises query relocalisation, reference rendering, and initial change-cue computation (§ 3). Post-frontend time covers detection, temporal-state updates, and refinement where applicable. Table 11 averages synchronized profiles over all 25 frames of all 20 instances. Detection includes the pixel decision and history update; refinement includes its RGB transfer. Input waits and inter-frame work are reported separately. Our profiles use a separate pass from the continuous throughput measurements in Table 4; O-SCD(O) uses its synchronized sequence records.

Table 11: Online runtime breakdown on PASLCD (RTX 5090; 20 instances, frames 1–25; ms/frame). Total sums all listed intervals. Post-frontend in Table 4 sums detection and refinement.

MethodFrontendDetectionRefinementInput/loopTotal
O-SCD(O)31.6237.650.000.0669.33
Ours (pixel)31.244.790.000.0736.10
Ours (full)31.515.3420.290.1057.24

Table 11.

Offline Preparation and Component Timing Breakdown

Offline preparation includes fitting the pixel prior and contour filter from reference edits.

Table 12 details the offline preparation and component fitting time across all 20 PASLCD scene-instances, measured on an NVIDIA RTX 5090 using wall-clock timing with GPU synchronization. The offline workflow comprises two main phases: (1) synthetic edit generation, which extracts multi-view object proposals with SAM2, performs 3D Gaussian edits (recolouring, removal, translation), renders lighting-varied views, and forms training observation pairs; and (2) scene component fitting, which executes reference preprocessing, fits the pixel pipeline components (response suppression, log-likelihood ratio mapping, unchanged response moments, and 1D branch-and-bound prior search π⋆\pi^{\star}), and trains the 18-dimensional symmetric contour filter with Platt scaling. Across all instances, the complete offline workflow averages 215.82 s (∼3.6 minutes; median 197.13 s, ranging from 142.15 s to 440.69 s), given an existing reference reconstruction.

SceneInst.Retained objectsGenerated recordsGeneration (s) ↓Preprocess (s) ↓Pixel (s) ↓Contour (s) ↓Total (s) ↓
Cantina122366106.958.2141.6818.84175.68
228602112.197.9956.9222.93200.02
Garden1371080119.427.5783.2330.48240.69
235752121.058.2569.6133.54232.46
Lounge118384112.078.2642.3919.14181.86
21834079.136.9237.2418.85142.15
Lunch_room1561744226.4411.28119.2747.17404.16
2642034231.6711.16131.8965.96440.69
Meeting_room11741090.876.7844.8228.05170.52
22148485.337.0948.8435.81177.07
Playground131718114.457.8566.8850.15239.34
233642117.927.6863.8374.38263.81
Porch144842102.777.1167.4634.04211.38
243788122.447.8167.8934.49232.63
Pots11428074.387.9538.1822.04142.55
22040075.647.4446.2323.70153.02
Printing_area123756107.857.5062.3522.07199.77
22341685.966.7641.1719.43153.33
Zen12456491.228.2758.6836.32194.49
21837877.347.5848.6427.11160.68
Mean—29.45699.0112.757.9761.8633.23215.82
Median—23.50583.0107.407.7457.8029.26197.13

Table 12. Complete offline preparation and fitting runtime breakdown across 20 PASLCD scene-instances (seconds, measured on an NVIDIA RTX 5090). Generation includes automatic object proposals, 3DGS edits, and synthetic paired observation rendering. Generated records are counted before the camera split. Fitting covers reference preprocessing, pixel models, prior search, and contour filter fitting.

Additional Visual Results

Figure 7. Additional qualitative comparisons on PASLCD. Examples are from Printing area, Lounge, Lunch room, and another view of Cantina. The layout and colours follow Figure 6. Refinement recovers the cabinet region in Printing area, while false positives near the ceiling in Lounge and missed object regions in Lunch room remain. Numbers report per-frame foreground IoU.

Comparison on CCS3D

Figure 8. Qualitative comparison on CCS3D. Examples are from Livingroom, Desk, Bookcase, and Bedroom. Rows and colours follow Figure 6. Ground truth is the union of pre- and post-state masks, as in Table 2. Our full method reduces excess responses around displaced objects in Livingroom and Desk and on unchanged regions in Bedroom; boundary errors remain in Bookcase. Numbers report per-frame foreground IoU.

Figure 6. Qualitative comparison on PASLCD. Examples are from Cantina, Garden, Meeting room, and Porch. Each column shows one query, with reference, query, ground truth, and method outputs arranged vertically. Both O-SCD variants and our pixel and full outputs are shown. Green, orange, and pink denote correct detections, false positives, and missed changes, respectively. Numbers report per-frame foreground IoU. Thin structures remain partly missed in Garden.

Evidence Fusion and Component Ablations

Figure 9 illustrates evidence fusion. Current-view evidence CtC_t gives strong responses around candidate changes, including some unchanged regions. Historical support HtH_t adjusts these responses using earlier observations, while the scene-fitted prior π\pi determines the evidence threshold for predicting change. The fused pixel probability QtpixelQ_t^{\mathrm{pixel}} reduces false positives but can also suppress true changes, as frame 25 illustrates. Across this 25-frame sequence, mean IoU increases from 47.31% with CtC_t alone to 57.84% after fusion. Figure 10 complements the quantitative component ablations in Table 3.

Figure 9. Evidence fusion in Cantina. Columns show frames 1, 13, 18, and 25 from one sequence. Log-odds maps share a colour scale saturated at ±6\pm6 for display; white denotes zero and grey marks uncovered pixels. The CtC_t-only mask sets Ht=π=0.5H_t = \pi= 0.5, giving Qtpixel=CtQ_t^{\mathrm{pixel}} = C_t. Both masks threshold QtpixelQ_t^{\mathrm{pixel}} at 0.5; fusion combines the same CtC_t, historical support HtH_t from Ft−1F_{t-1}, and the fitted prior π\pi (Eq. (1)). Mask colours follow Figure 6; numbers report per-frame foreground IoU.

Figure 10. Qualitative component ablations. Examples are from Cantina, Porch, Garden, and Meeting room in PASLCD. (a) Five pixel-pipeline ablations and the full pixel pipeline. The no-prior variant uses π=0.5\pi= 0.5; spatial support denotes Gaussian-aggregated support StS_t. (b) Three output-refinement ablations and the full method. The image-weight ablation omits image weighting during contour fitting. Both groups use the same queries. Colours follow Figure 6; numbers report per-frame foreground IoU.

References

  1. [1]Jan Ackermann, Jonas Kulhanek, Shengqu Cai, Haofei Xu, Marc Pollefeys, Gordon Wetzstein, Leonidas J. Guibas, and Songyou Peng. CL-Splats: Continual learning of gaussian splatting with local optimization. In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), pp. 7808–7817, October 2025. URL https://openaccess.thecvf.com/content/ICCV2025/html/Ackermann_CL-Splats_Continual_Learning_of_Gaussian_Splatting_with_Local_Optimization_ICCV_2025_paper.html.openaccess.thecvf.com/content/ICCV2025/html/Ackermann_CL-Splats_Continual_Learning_of_Gaussian_Splatting_with_Local_Optimization_ICCV_2025_paper.html
  2. [3]Yoav Benjamini and Yosef Hochberg. Controlling the false discovery rate: A practical and powerful approach to multiple testing. Journal of the Royal Statistical Society: Series B (Methodological), 57(1):289–300, 1995. doi: 10.1111/j.2517-6161.1995.tb02031.x.DOI
  3. [4]P. G. Bissiri, C. C. Holmes, and S. G. Walker. A general framework for updating belief distributions. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 78(5):1103–1130, 2016. doi: 10.1111/rssb.12158. URL https://arxiv.org/abs/1306.6430.
  4. [5]Yiwen Chen, Zilong Chen, Chi Zhang, Feng Wang, Xiaofeng Yang, Yikai Wang, Zhonggang Cai, Lei Yang, Huaping Liu, and Guosheng Lin. GaussianEditor: Swift and controllable 3D editing with gaussian splatting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 21476–21485, 2024. URL https://openaccess.thecvf.com/content/CVPR2024/html/Chen_GaussianEditor_Swift_and_Controllable_3D_Editing_with_Gaussian_Splatting_CVPR_2024_paper.html.openaccess.thecvf.com/content/CVPR2024/html/Chen_GaussianEditor_Swift_and_Controllable_3D_Editing_with_Gaussian_Splatting_CVPR_2024_paper.html
  5. [6]Galappaththige, C. J., Lai, J., Windrim, L., Dansereau, D., Sündermann, N., & Miller, D. (2025). Multi-view pose-agnostic change localization with zero labels. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (pp. 11600–11610). https://openaccess.thecvf.com/content/openaccess.thecvf.com/content
  6. [7]Galappaththige, C. J., Lai, J., Patten, T., Dansereau, D., Sünderhauf, N., & Miller, D. (2026). From pixels to primitives: Scene change detection in 3D gaussian splatting. In arXiv preprint. https://arxiv.org/abs/2605.07203
  7. [8]Chamuditha Jayanga Galappaththige, Jason Lai, Lloyd Windrim, Donald Dansereau, Niko Sünderhauf, and Dimity Miller. Changes in real time: Online scene change detection with multi-view fusion. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 32246–32256, June 2026b. URL https://openaccess.thecvf.com/content/CVPR2026/html/Galappaththige_Changes_in_Real_Time_Online_Scene_Change_Detection_with_Multi-View_CVPR_2026_paper.html.openaccess.thecvf.com/content/CVPR2026/html/Galappaththige_Changes_in_Real_Time_Online_Scene_Change_Detection_with_Multi-View_CVPR_2026_paper.html
  8. [9]Jian Gao, Chun Gu, Youtian Lin, Zhihao Li, Hao Zhu, Xun Cao, Li Zhang, and Yao Yao. Relightable 3D gaussians: Realistic point cloud relighting with BRDF decomposition and ray tracing. In European Conference on Computer Vision (ECCV), 2024. URL https://www.ecva.net/papers/eccv_2024/papers_ECCV/html/6121_ECCV_2024_paper.php.ecva.net/papers/eccv_2024/papers_ECCV/html/6121_ECCV_2024_paper.php
  9. [10]Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A., & Rubin, D. B. (2013). Bayesian Data Analysis. In Chapman and Hall/CRC (Vol. 3). https://doi.org/9781439840955
  10. [11]Kass, R. E., & Raftery, A. E. (1995). Bayes factors. Journal of the American Statistical Association, 90(430), 773–795. https://sites.stat.washington.edu/courses/stat527/s14/readings/KassRaftery_jasa1995.pdfsites.stat.washington.edu/courses/stat527/s14/readings/KassRaftery_jasa1995.pdf
  11. [12]Bernhard Kerbl, Georgios Kopanas, Thomas Leimkühler, and George Drettakis. 3D gaussian splatting for real-time radiance field rendering. ACM Transactions on Graphics, 42(4):139:1–139:14, July 2023. doi: 10.1145/3592433. URL https://repo-sam.inria.fr/fungraph/3d-gaussian-splatting/.DOI
  12. [13]Kim, J.-W., & Kim, U.-H. (2025). Towards generalizable scene change detection. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 24463–24473. https://openaccess.thecvf.com/content/CVPR2025/html/Kim_Towards_Generalizable_Scene_Change_Detection_CVPR_2025_paper.htmlopenaccess.thecvf.com/content/CVPR2025/html/Kim_Towards_Generalizable_Scene_Change_Detection_CVPR_2025_paper.html
  13. [14]Dong In Lee, Hyeongcheol Park, Jiyoung Seo, Eunbyung Park, Hyunje Park, Ha Dam Baek, Sangheon Shin, Sangmin Kim, and Sangpil Kim. EditSplat: Multi-view fusion and attention-guided optimization for view-consistent 3D scene editing with 3D gaussian splatting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 11135–11145, 2025. URL https://openaccess.thecvf.com/content/CVPR2025/html/Lee_EditSplat_Multi-View_Fusion_and_Attention-Guided_Optimization_for_View-Consistent_3D_Scene_CVPR_2025_paper.html.openaccess.thecvf.com/content/CVPR2025/html/Lee_EditSplat_Multi-View_Fusion_and_Attention-Guided_Optimization_for_View-Consistent_3D_Scene_CVPR_2025_paper.html
  14. [15]Zhihao Liang, Qi Zhang, Ying Feng, Ying Shan, and Kui Jia. GS-IR: 3D gaussian splatting for inverse rendering. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 21644–21653, 2024. URL https://openaccess.thecvf.com/content/CVPR2024/html/Liang_GS-IR_3D_Gaussian_Splatting_for_Inverse_Rendering_CVPR_2024_paper.html.openaccess.thecvf.com/content/CVPR2024/html/Liang_GS-IR_3D_Gaussian_Splatting_for_Inverse_Rendering_CVPR_2024_paper.html
  15. [16]Ziqi Lu, Jianbo Ye, and John J. Leonard. 3DGS-CD: 3D gaussian splatting-based change detection for physical object rearrangement. IEEE Robotics and Automation Letters, 10(3):2662–2669, 2025. doi: 10.1109/LRA.2025.3533457. URL https://doi.org/10.1109/LRA.2025.3533457.
  16. [17]John C. Platt. Probabilities for SV machines. In Alexander J. Smola, Peter Bartlett, Bernhard Schölkopf, and Dale Schuurmans (eds.), Advances in Large-Margin Classifiers, pp. 61–74. The MIT Press, 2000. doi: 10.7551/mitpress/1113.003.0008. URL https://doi.org/10.7551/mitpress/1113.003.0008.
  17. [18]Guilherme Potje, Felipe Cadar, André Araujo, Renato Martins, and Erickson R. Nascimento. XFeat: Accelerated features for lightweight image matching. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2682–2691, June 2024. URL https://openaccess.thecvf.com/content/CVPR2024/html/Potje_XFeat_Accelerated_Features_for_Lightweight_Image_Matching_CVPR_2024_paper.html.openaccess.thecvf.com/content/CVPR2024/html/Potje_XFeat_Accelerated_Features_for_Lightweight_Image_Matching_CVPR_2024_paper.html
  18. [19]Jingxing Qian, Veronica Chatrath, Jun Yang, James Servos, Angela P. Schoellig, and Steven L. Waslander. POCD: Probabilistic object-level change detection and volumetric mapping in semistatic scenes. In Proceedings of Robotics: Science and Systems, New York City, NY, USA, June 2022. doi: 10.15607/RSS.2022.XVIII.013. URL https://www.roboticsproceedings.org/rss18/p013.html.DOI
  19. [20]Nikhila Ravi, Valentin Gabeur, Yuan-Ting Hu, Ronghang Hu, Chaitanya Ryali, Tengyu Ma, Haitham Khedr, Roman Rädle, Chloe Rolland, Laura Gustafson, Eric Mintun, Junting Pan, Kalyan Vasudev Alwala, Nicolas Carion, Chao-Yuan Wu, Ross Girshick, Piotr Dollár, and Christoph Feichtenhofer. SAM 2: Segment anything in images and videos. In International Conference on Learning Representations (ICLR), 2025. URL https://proceedings.iclr.cc/paper_files/paper/2025/hash/45c1f6a8cbf2da59ebf2c802b4f742cd-Abstract-Conference.html.proceedings.iclr.cc/paper_files/paper/2025/hash/45c1f6a8cbf2da59ebf2c802b4f742cd-Abstract-Conference.html
  20. [21]Ragav Sachdeva and Andrew Zisserman. The change you want to see. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), pp. 3993–4002, January 2023a. URL https://openaccess.thecvf.com/content/WACV2023/html/Sachdeva_The_Change_You_Want_To_See_WACV_2023_paper.html.openaccess.thecvf.com/content/WACV2023/html/Sachdeva_The_Change_You_Want_To_See_WACV_2023_paper.html
  21. [22]Ragav Sachdeva and Andrew Zisserman. The change you want to see (now in 3D). In Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) Workshops, pp. 2060–2069, October 2023b. URL https://openaccess.thecvf.com/content/ICCV2023W/OpenSUN3D/html/Sachdeva_The_Change_You_Want_to_See_Now_in_3D_ICCVW_2023_paper.html.openaccess.thecvf.com/content/ICCV2023W/OpenSUN3D/html/Sachdeva_The_Change_You_Want_to_See_Now_in_3D_ICCVW_2023_paper.html
  22. [23]Zhou Wang, Alan C. Bovik, Hamid R. Sheikh, and Eero P. Simoncelli. Image quality assessment: From error visibility to structural similarity. IEEE Transactions on Image Processing, 13(4): 600–612, 2004. doi: 10.1109/TIP.2003.819861. URL https://doi.org/10.1109/TIP.2003.819861.
  23. [24]Yuqun Wu, Chih-hao Lin, Henry Che, Aditi Tiwari, Chuhang Zou, Shenlong Wang, and Derek Hoiem. SceneDiff: A benchmark and method for multiview object change detection. In European Conference on Computer Vision (ECCV), 2026. URL https://arxiv.org/abs/2512.16908.
  24. [25]Sizhe Yang, Wenye Yu, Jia Zeng, Jun Lv, Kerui Ren, Cewu Lu, Dahua Lin, and Jiangmiao Pang. Novel demonstration generation with gaussian splatting enables robust one-shot manipulation. In Proceedings of Robotics: Science and Systems (RSS), 2025. doi: 10.15607/RSS.2025.XXI.146. URL https://www.roboticsproceedings.org/rss21/p146.html.DOI
  25. [26]Mingqiao Ye, Martin Danelljan, Fisher Yu, and Lei Ke. Gaussian grouping: Segment and edit anything in 3D scenes. In European Conference on Computer Vision (ECCV), 2024. doi: 10.1007/978-3-031-73397-0_10. URL https://www.ecva.net/papers/eccv_2024/papers_ECCV/html/4195_ECCV_2024_paper.php.DOI
  26. [27]Bianca Zadrozny and Charles Elkan. Transforming classifier scores into accurate multiclass probability estimates. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002. doi: 10.1145/775047.775151. URL https://www.cs.columbia.edu/~djhsu/ML/handouts/zadrozny2002kdd.pdf.DOI
  27. [29]Zirui Zhou, Junfeng Ni, Shujie Zhang, Yixin Chen, and Siyuan Huang. 3D scene change modeling with consistent multi-view aggregation. In International Conference on 3D Vision (3DV), 2026. URL https://openreview.net/forum?id=sV7lwfLo6H.openreview.net/forum?id=sV7lwfLo6H
  28. [30]Runsong Zhu, Shi Qiu, Zhengzhe Liu, Ka-Hei Hui, Qianyi Wu, Pheng-Ann Heng, and Chi-Wing Fu. Rethinking end-to-end 2D to 3D scene segmentation in gaussian splatting. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3656–3665, 2025. URL https://openaccess.thecvf.com/content/CVPR2025/html/Zhu_Rethinking_End-to-End_2D_to_3D_Scene_Segmentation_in_Gaussian_Splatting_CVPR_2025_paper.html.openaccess.thecvf.com/content/CVPR2025/html/Zhu_Rethinking_End-to-End_2D_to_3D_Scene_Segmentation_in_Gaussian_Splatting_CVPR_2025_paper.html

Paper details

vlnc:W_yn8ye9mn
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

generative AI tools

View statement
Looking for related papers…
Contents