Whittaker-Henderson smoother for long satellite image time series interpolation

arXiv cs.AI / 4/2/2026

💬 OpinionDeveloper Stack & InfrastructureIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes improving the Whittaker smoother for satellite image time-series by replacing manual, per-pixel tuning of the smoothing parameter with a neural network inferred parameter inside a differentiable layer.
  • It extends the method to heteroscedastic noise by using time-varying (locally adaptive) regularization so smoothing strength can vary along the temporal dimension.
  • For scalability, the authors introduce a sparse, memory-efficient, fully differentiable implementation that leverages the banded structure of the linear system and uses Cholesky factorization.
  • GPU benchmarks show the sparse implementation outperforms standard dense solvers in both speed and memory, enabling large-scale processing.
  • Experiments on France SITS data (2016–2024) validate feasibility of heteroscedastic smoothing, while observed differences vs. a homoscedastic baseline are limited, suggesting the chosen architecture may not capture abrupt noise changes well (e.g., single-day cloud contamination).

Abstract

Whittaker smoother is a widely adopted solution to pre-process satellite image time series. Yet, two key limitations remain: the smoothing parameter must be tuned individually for each pixel, and the standard formulation assumes homoscedastic noise, imposing uniform smoothing across the temporal dimension. This paper addresses both limitations by casting the Whittaker smoother as a differentiable neural layer, in which the smoothing parameter is inferred by a neural network. The framework is further extended to handle heteroscedastic noise through a time-varying regularization, allowing the degree of smoothing to adapt locally along the time series. To enable large-scale processing, a sparse, memory-efficient, and fully differentiable implementation is proposed, exploiting the symmetric banded structure of the underlying linear system via Cholesky factorization. Benchmarks on GPU demonstrate that this implementation substantially outperforms standard dense linear solvers, both in speed and memory consumption. The approach is validated on SITS acquired over the French metropolitan territory between 2016 and 2024. Results confirm the feasibility of large-scale heteroscedastic Whittaker smoothing, though reconstruction differences with the homoscedastic baseline remain limited, suggesting that the transformer architecture used for smoothing parameter estimation may lack the temporal acuity needed to capture abrupt noise variations such as singleday cloud contamination.