Depth-Aware Adaptive Noise Compensation

• Depth-aware adaptive noise compensation is a method that tailors noise filtering and reconstruction based on depth variations to preserve edges and reduce artifacts.
• It employs depth-indexed degradation models and adaptive estimators in applications like RGB-D denoising, SD-OCT imaging, event-based depth estimation, and active search.
• By integrating physical calibrations and multi-scale regularization, the approach ensures accurate reconstruction and efficient compensation of depth-dependent noise.

Searching arXiv for the cited papers to ground the article in current records. Depth-aware adaptive noise compensation denotes a class of methods that model degradation, uncertainty, or optimization noise as a function of depth and then adapt filtering, inference, reconstruction, or control accordingly. In geometric vision and imaging, “depth” commonly refers to scene range, depth hypotheses, or imaging depth; in hierarchical learning systems, the same logic has been extended to circuit depth and network depth. Across RGB-D denoising, Spectral Domain Optical Coherence Tomography, event-based monocular depth estimation, self-supervised nighttime depth estimation, depth completion, decentralized active search, and hierarchical quantum or deep-network optimization, the central design choice is to replace global, depth-agnostic processing with depth-conditioned compensation mechanisms that preserve structure while suppressing noise (Chaudhary et al., 2016, Boroomand et al., 2015, Meng et al., 2024, Kim et al., 25 Feb 2026).

1. Conceptual scope and recurring design pattern

A common formulation of depth-aware compensation begins from the observation that noise is not uniform. In RGB-D imagery, large and unpredictable noises can corrupt object boundaries and cause artifacts in rendered views. In SD-OCT, axial resolution, lateral resolution, and Signal-to-Noise Ratio degrade with imaging depth, while sidelobe artifact also changes with depth. In event-based monocular depth, different depth hypotheses produce different motion-compensated event images, and only the correct depth is expected to generate focused edge accumulations. In robotic active search, the uncertainty of object detection depends on target distance and occlusion. In hierarchical classifiers and optimizers, accumulated noise depends on circuit depth or layer depth rather than geometric range (Chaudhary et al., 2016, Boroomand et al., 2015, Meng et al., 2024, Ghods et al., 2020, Kim et al., 25 Feb 2026, Hao et al., 15 Oct 2025).

Taken together, these works suggest a recurring architecture with three elements: a depth-indexed degradation model, an adaptive estimator or controller that changes behavior with depth, and a structural prior that prevents compensation from crossing physically or semantically invalid boundaries. The adaptive variable may be a filter weight, an inpainting search region, a cost-volume regularizer, a confidence gate, a posterior covariance, an intermediate measurement feature, or a layerwise learning rate.

Domain	Depth variable	Adaptive mechanism
RGB-D denoising	Scene depth discontinuities and regions	Joint bilateral filtering and region-constrained exemplar-based inpainting
SD-OCT	Imaging depth $z$	MAP estimation with depth-varying PSFs, SNR, and SF-CRF potentials
Event monocular depth	Depth hypotheses $d$	FCD focus cost and IHCA trend-aware cost aggregation
Depth completion	Sparse depth reliability and local context	Gated replacement and adaptive kernel/iteration selection
Active search	Object distance $\ell$ and occlusion	Depth-aware covariance in Thompson Sampling
Hierarchical quantum / DNN training	Circuit depth or layer depth	Intermediate measurement reuse or noise-adaptive layerwise rates

A frequent misconception is that depth-aware compensation is equivalent to stronger smoothing. The cited methods instead emphasize edge preservation, region consistency, metric depth anchoring, or depth-specific uncertainty modeling, and several explicitly treat indiscriminate propagation or generic denoising as a source of failure rather than a remedy (Chaudhary et al., 2016, Cheng et al., 2019, Boroomand et al., 2015).

2. RGB-D denoising and structure-preserving compensation

In depth images, one canonical formulation is the three-phase method introduced for noise removal on depth images (Chaudhary et al., 2016). The pipeline begins with salient edge extraction using a Canny edge detector, proceeds with a joint bilateral filter, and then applies exemplar-based inpainting. The filtering stage is spatially- and range-adaptive:

$$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$

where $f$ is a spatial Gaussian kernel, $g$ is a range kernel, and the construction preserves structure at edges while smoothing noise in regions with similar depth values. The adaptivity is therefore tied directly to local depth variation and depth discontinuities rather than to a fixed neighborhood rule (Chaudhary et al., 2016).

The subsequent inpainting stage is more restrictive than standard exemplar filling because patch search is constrained to regions delineated by previously extracted salient edges. The filling priority is inherited from isophote-driven sampling:

$$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$

and the patch search is limited by region membership $R_i$. This region-constrained patch search is the principal depth-aware mechanism: it avoids filling across object boundaries or between geometrically dissimilar surfaces. Histogram-based clustering is additionally performed prior to edge extraction to simplify the edge map and enhance region consistency (Chaudhary et al., 2016).

The method is described as general enough for various RGB-D acquisition systems because all stages operate directly on the depth image. It is reported to be robust to large missing regions or localized random noise and to be particularly well-suited for complex scenes and weak edges. Evaluation on the Tsukuba Stereo Database and the “Ballet” sequence from Microsoft Research uses PSNR as the main metric. Reported PSNR improvements across patch sizes include, for sample 206, $5.26$, $5.23$, and $d$0 for $d$1, $d$2, and $d$3 patches, and for sample 1152, $d$4, $d$5, and $d$6. The average processing time is $d$7 for $d$8 images on standard CPU hardware, and the qualitative results emphasize preservation of sharp structures and improved virtual view synthesis (Chaudhary et al., 2016).

This line of work situates depth-aware noise compensation within image-based rendering and 3D construction. A plausible implication is that region-conditioned denoising is most useful when downstream tasks are sensitive to geometric discontinuities, such as novel view rendering and 3D reconstruction, because those tasks directly amplify boundary errors.

3. Depth-compensated tomography and physically calibrated inverse reconstruction

A more explicit physical model of depth-dependent degradation appears in Depth Compensated Spectral Domain Optical Coherence Tomography (Boroomand et al., 2015). There, the imaging system is first calibrated to measure the depth-varying axial Point Spread Function $d$9, the lateral PSF $\ell$0, and the sensitivity fall-off curve. These measured quantities become priors in a Depth Compensating Digital Signal Processing module. The degraded measurement $\ell$1 is modeled as

$\ell$2

where $\ell$3 is the desired image, $\ell$4 is sidelobe artifact, and $\ell$5 is depth-varying speckle noise. Compensation is then posed as inversion of the degradation process and estimated through a unified Maximum a Posteriori framework:

$\ell$6

The probabilistic model is implemented with a Stochastically Fully-connected Conditional Random Field. Pixels are nodes, cliques are stochastically constructed between all pairs with connectivity probability decaying with spatial distance and motif similarity, and the clique structure is non-homogeneous to reflect depth-dependent system behavior. The posterior is

$\ell$7

with energy

$\ell$8

The unary potential encodes data fidelity after log-domain treatment of speckle, and the pairwise potential enforces spatial consistency with a depth-adaptive penalty $\ell$9. Inference is performed via gradient descent with separate coefficients controlling data consistency and spatial smoothness (Boroomand et al., 2015).

What distinguishes this formulation from depth-aware denoising in conventional RGB-D imagery is the direct incorporation of system calibration. Compensation is not solely data-driven; it is parameterized by measured axial PSF, lateral PSF, and SNR fall-off, and it addresses multiple degradations simultaneously: depth-dependent loss of axial resolution, depth-dependent loss of lateral resolution, depth-varying SNR, and sidelobe artifact. The SF-CRF therefore serves as a statistical mechanism for context-aware regularization on top of physically characterized blur and noise (Boroomand et al., 2015).

Reported empirical results show an average SNR improvement of approximately $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$0 across depths over baseline SD-OCT, an average effective axial resolution improvement of approximately $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$1, and a lateral resolution improvement of approximately $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$2, with the greatest lateral gains at higher depths greater than $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$3. The SNR-depth curve is described as nearly flat in DC-OCT, and qualitative examples on a USAF resolution target and biological tissues emphasize reduced speckle noise, suppression of sidelobe artifact, and sharper tissue structures (Boroomand et al., 2015).

A common misconception is that OCT compensation is equivalent to deconvolution alone. The DC-OCT framework explicitly rejects that reduction by jointly modeling speckle noise, depth-varying PSFs, and spatial structure within a MAP-SF-CRF formulation.

4. Depth hypotheses, egomotion compensation, and low-light distribution shifts

In monocular depth from events, depth-aware adaptive noise compensation is expressed through hypothesis-conditioned warping rather than direct filtering (Meng et al., 2024). The framework uses a physics-based dynamic motion field equation to relate camera egomotion and candidate depth $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$4 to predicted optical flow $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$5. Events are warped to a reference time under each depth hypothesis to form motion-compensated event images. The key premise is that the correct depth hypothesis yields sharp edge accumulations, whereas incorrect hypotheses generate blurred or dispersed events.

Noise enters at multiple levels: focus ambiguity, sensor or IMU measurement noise, and event sparsity or asynchrony. The Focus Cost Discrimination module measures the clarity of edges and integrates spatial surroundings to estimate a focus cost. The Inter-Hypotheses Cost Aggregation module then refines the cost volume by examining first- and second-order derivatives across the depth dimension,

$$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$6

and by applying stacked residual 3D convolutional blocks over $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$7. Multi-scale consistency is enforced through

$$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$8

The stated role of IHCA is to suppress spurious local minima, disambiguate false focus peaks caused by repetitive texture or accidental spatial overlap, and reduce sensitivity to depth or sensor noise through smoothness and multi-scale agreement (Meng et al., 2024).

The event-based framework is reported to outperform cutting-edge methods by up to $$I_t = \frac{1}{k_p} \cdot \sum_{q \in \Omega} I_q \, f(||p - q||) \cdot g(||I_p - I_q||)$$9 in terms of the absolute relative error metric, and its velocity noise ablation shows that even with $f$0 additive noise in the input velocities, the depth prediction accuracy remains on par or better than competing methods. This robustness is attributed to the combination of egomotion-anchored metric depth hypotheses and IHCA’s multi-scale regularization (Meng et al., 2024).

A related but distinct problem arises in self-supervised nighttime monocular depth estimation, where photometric consistency is violated by complex lighting and higher imaging noise (Yang et al., 2024). The proposed solution does not use any night images during training. Instead, day images are distribution-compensated through two physically motivated modules: a Brightness Peak Generator for flare, glare, and reflection artifacts, and an Imaging Noise Generator based on the shot-read noise model

$f$1

The reflection submodule uses the Phong illumination model,

$f$2

and the imaging noise process samples parameters stochastically to span real night conditions. Importantly, photometric loss is applied only to the original unmapped images; the compensation is injected only into the depth network input. The reported results on nuScenes-Night are ABS rel $f$3, Sq rel $f$4, RMSE $f$5, and $f$6; on RobotCar-Night they are ABS rel $f$7, Sq rel $f$8, RMSE $f$9, and $g$0. The ablation on nuScenes-Night shows baseline ABS rel $g$1 and RMSE $g$2, BPG only $g$3, ING only $g$4, and full $g$5 (Yang et al., 2024).

One objective clarification follows from these results: more “night-like” image transfer, as measured by FID, does not necessarily produce better depth estimation. The paper explicitly reports that compensating only for photometric and noise distributions with physical priors leads to better depth estimation performance than full style-transfer methods (Yang et al., 2024).

5. Sparse depth reliability, adaptive propagation, and active perception

Depth completion introduces a different failure mode: sparse depth maps may contain noisy or inaccurate measurements, and naively preserving all valid points can propagate those errors (Cheng et al., 2019). CSPN++ addresses this by replacing unconditional preservation with a gated network that predicts a confidence score $g$6 for each sparse depth point:

$g$7

Here, $g$8 is produced by a CNN and modulates how strongly the sparse input is trusted. This “guided replacement” step is the explicit noise compensation mechanism: uncertain or noisy points receive smaller weight, while accurate points are preserved more strongly (Cheng et al., 2019).

CSPN++ further learns adaptive convolutional kernel sizes and the number of propagation iterations per pixel. In context-aware CSPN, soft weights $g$9 and $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$0 assemble outputs across kernel sizes and iteration stages, while resource-aware CSPN uses hard selection,

$$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$1

to reduce computation. The training objective includes a regularization term on expected computational cost, encouraging minimal context sufficient for the task. On the KITTI validation set, RMSE values reported in the ablation include $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$2 for CSPN, $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$3 with Guided Replace, $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$4 with Assemble Kernels, $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$5 with Assemble Iter, and $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$6 with Latency Regularization. Resource-aware CSPN at $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$7 of standard CSPN computational cost still reports RMSE $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$8, lower than $$C(p) = \frac{\sum_{q \in \Phi_p \cap \Omega} C(q)}{|\Phi_p|},\qquad D(p) = \frac{\nabla I_p^\bot \cdot n_p}{\alpha},\qquad P(p) = C(p) \cdot D(p)$$9 for original CSPN (Cheng et al., 2019).

A broader systems interpretation of depth-aware compensation appears in multi-agent active search (Ghods et al., 2020). There the uncertainty of detector confidence is explicitly modeled as a function of distance:

$R_i$0

and for a field of view over $R_i$1 grid points,

$R_i$2

The covariance entries depend on depth, while visibility calculations exclude occluded cells from the sensing matrix. Posterior inference uses Sparse Bayesian Learning, and decentralized action selection uses a one-step look-ahead reward under Thompson Sampling. This is depth-aware adaptive noise compensation at the control layer rather than the reconstruction layer: the agent’s policy accounts for the fact that distant or occluded observations are intrinsically less reliable (Ghods et al., 2020).

Simulation and pseudo-realistic Unreal Engine 4 plus AirSim experiments report that NATS significantly outperforms information-greedy policies and exhaustive search, finds up to $R_i$3 objects in realistic hilly outdoor maps of $R_i$4 using only 2 agents, reduces travel by approximately $R_i$5 compared to depth-agnostic variants, and yields approximately $R_i$6 reduction in path length compared to naive exhaustive methods. The method is also described as robust to unreliable communications because agents operate asynchronously with decentralized posterior sampling (Ghods et al., 2020).

These works correct another common misconception: compensation is not only a post-processing problem. It can also be embedded in propagation rules, confidence gates, and sequential decision-making.

6. Extensions to circuit depth and network depth

The phrase “depth-aware” has also been extended beyond geometric sensing. In hybrid quantum convolutional neural networks, noise accumulation depends on circuit depth, and the proposed remedy is depth-stratified feature extraction (Kim et al., 25 Feb 2026). Standard QCNNs discard qubits during pooling and classify from the final remaining qubit. The hybrid design instead measures the discarded qubits and concatenates those intermediate outcomes with the final readout into a classical feature vector, processed by a feed-forward neural network:

$R_i$7

Two measurement variants are defined: HQCNN-EZ uses $R_i$8 features, while HQCNN-EM uses $R_i$9, $5.26$0, and $5.26$1. The argument is that qubits measured at shallow depth are less exposed to cumulative noise and therefore provide higher-fidelity information than the final qubit alone (Kim et al., 25 Feb 2026).

On binary MNIST classification with circuit sizes $5.26$2 and realistic IBM-calibrated noise models, the reported 10-qubit accuracies are $5.26$3 noiseless, $5.26$4 with FakeGuadalupeV2, and $5.26$5 with AerSimulator for standard QCNN; $5.26$6, $5.26$7, and $5.26$8 for HQCNN-EZ; and $5.26$9, $5.23$0, and $5.23$1 for HQCNN-EM. SHAP analysis shows that the shallowest-layer measurements have the highest importance under noise, and the hybrid advantage amplifies as circuit size increases (Kim et al., 25 Feb 2026).

An analogous extension appears in geometry-aware optimization of deep neural networks, where noise heterogeneity is modeled across layers (Hao et al., 15 Oct 2025). The LANTON method estimates per-layer gradient variance in the dual norm associated with the layer’s Linear Minimization Oracle:

$5.23$2

then assigns adaptive layerwise scaling

$5.23$3

Layers with higher estimated variance receive smaller learning rates, and layers with lower variance receive larger ones. The method is reported to achieve a sharp convergence rate, approximately $5.23$4 training speedup over D-Muon at matched loss budgets, lower validation loss at equal tokens, and approximately $5.23$5 more wall clock than D-Muon (Hao et al., 15 Oct 2025).

These non-geometric examples do not redefine the imaging literature; rather, they show that the same compensation principle can be transferred to any hierarchical system in which noise accumulates with depth. This suggests that “depth-aware adaptive noise compensation” is best understood as a methodological pattern: estimate where depth-indexed corruption enters the pipeline, then reweight, regularize, or reroute computation before that corruption propagates further.