STARK denoises spatial transcriptomics images via adaptive regularization

• URL: http://arxiv.org/abs/2512.10994v1
• Date: Wed, 10 Dec 2025 06:19:13 GMT
• Title: STARK denoises spatial transcriptomics images via adaptive regularization
• Authors: Sharvaj Kubal, Naomi Graham, Matthieu Heitz, Andrew Warren, Michael P. Friedlander, Yaniv Plan, Geoffrey Schiebinger,
• Abstract summary: We present an approach to denoising transcriptomics images that is particularly effective for uncovering cell identities in the numerical regime of ultra-low sequencing depths.<n>The method -- Spatial Transcriptomics via Adaptive Regularization and Kernel iterations (STARK) -- shows consistent improvement over the competing methods.
• Score: 3.8065244182878613
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present an approach to denoising spatial transcriptomics images that is particularly effective for uncovering cell identities in the regime of ultra-low sequencing depths, and also allows for interpolation of gene expression. The method -- Spatial Transcriptomics via Adaptive Regularization and Kernels (STARK) -- augments kernel ridge regression with an incrementally adaptive graph Laplacian regularizer. In each iteration, we (1) perform kernel ridge regression with a fixed graph to update the image, and (2) update the graph based on the new image. The kernel ridge regression step involves reducing the infinite dimensional problem on a space of images to finite dimensions via a modified representer theorem. Starting with a purely spatial graph, and updating it as we improve our image makes the graph more robust to noise in low sequencing depth regimes. We show that the aforementioned approach optimizes a block-convex objective through an alternating minimization scheme wherein the sub-problems have closed form expressions that are easily computed. This perspective allows us to prove convergence of the iterates to a stationary point of this non-convex objective. Statistically, such stationary points converge to the ground truth with rate $\mathcal{O}(R^{-1/2})$ where $R$ is the number of reads. In numerical experiments on real spatial transcriptomics data, the denoising performance of STARK, evaluated in terms of label transfer accuracy, shows consistent improvement over the competing methods tested.

Related papers

• GSNR: Graph Smooth Null-Space Representation for Inverse Problems [24.2377690980591]
  Inverse problems in imaging are ill-posed, leading to infinitely many solutions consistent with the measurements due to the nontrivial null-space of the sensing matrix.<n>We propose Graph-Smooth Null-Space Representation (GSNR), a mechanism that imposes structure only into the invisible component.
  arXiv  Detail & Related papers  (2026-02-23T20:24:00Z)
• From Image Denoisers to Regularizing Imaging Inverse Problems: An Overview [10.381324512554835]
  Inverse problems lie at the heart of modern imaging science, with broad applications in areas such as medical imaging, remote sensing, and microscopy.<n>Recent years have witnessed a paradigm shift in solving imaging inverse problems, where data-driven regularizers are used increasingly.<n>A notable approach for data-driven regularization is to use learned image denoisers as implicit priors in iterative image reconstruction algorithms.
  arXiv  Detail & Related papers  (2025-09-03T16:54:59Z)
• Stochastic Gradient Descent for Gaussian Processes Done Right [86.83678041846971]
  We show that when emphdone right -- by which we mean using specific insights from optimisation and kernel communities -- gradient descent is highly effective. We introduce a emphstochastic dual descent algorithm, explain its design in an intuitive manner and illustrate the design choices. Our method places Gaussian process regression on par with state-of-the-art graph neural networks for molecular binding affinity prediction.
  arXiv  Detail & Related papers  (2023-10-31T16:15:13Z)
• Retinex-based Image Denoising / Contrast Enhancement using Gradient Graph Laplacian Regularizer [45.89588014029562]
  We propose a fast Retinex-based restoration scheme that denoises and contrast-enhances an image. Experimental results show that our algorithm achieves competitive visual image quality while reducing complexity noticeably.
  arXiv  Detail & Related papers  (2023-07-05T19:56:50Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• GradViT: Gradient Inversion of Vision Transformers [83.54779732309653]
  We demonstrate the vulnerability of vision transformers (ViTs) to gradient-based inversion attacks. We introduce a method, named GradViT, that optimize random noise into naturally looking images. We observe unprecedentedly high fidelity and closeness to the original (hidden) data.
  arXiv  Detail & Related papers  (2022-03-22T17:06:07Z)
• Edge Tracing using Gaussian Process Regression [0.0]
  We introduce a novel edge tracing algorithm using Gaussian process regression. Our approach has the ability to efficiently trace edges in image sequences. Various applications to medical imaging and satellite imaging are used to validate the technique.
  arXiv  Detail & Related papers  (2021-11-05T16:43:14Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)
• Non-local Meets Global: An Iterative Paradigm for Hyperspectral Image Restoration [66.68541690283068]
  We propose a unified paradigm combining the spatial and spectral properties for hyperspectral image restoration. The proposed paradigm enjoys performance superiority from the non-local spatial denoising and light computation complexity. Experiments on HSI denoising, compressed reconstruction, and inpainting tasks, with both simulated and real datasets, demonstrate its superiority.
  arXiv  Detail & Related papers  (2020-10-24T15:53:56Z)
• Unrolling of Deep Graph Total Variation for Image Denoising [106.93258903150702]
  In this paper, we combine classical graph signal filtering with deep feature learning into a competitive hybrid design. We employ interpretable analytical low-pass graph filters and employ 80% fewer network parameters than state-of-the-art DL denoising scheme DnCNN.
  arXiv  Detail & Related papers  (2020-10-21T20:04:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.