mlsanityData to 14 Oct 2026

A Bhattacharyya Coefficient-Based Framework for Noise Model-Aware Random Walker Image Segmentation

arXiv 2206.00947 ↗First posted 2 Jun 2022cs.CV eess.IVcited by 0

Not on the map. Why?

Abstract (arXiv)

One well established method of interactive image segmentation is the random walker algorithm. Considerable research on this family of segmentation methods has been continuously conducted in recent years with numerous applications. These methods are common in using a simple Gaussian weight function which depends on a parameter that strongly influences the segmentation performance. In this work we propose a general framework of deriving weight functions based on probabilistic modeling. This framework can be concretized to cope with virtually any well-defined noise model. It eliminates the critical parameter and thus avoids time-consuming parameter search. We derive the specific weight functions for common noise types and show their superior performance on synthetic data as well as different biomedical image data (MRI images from the NYU fastMRI dataset, larvae images acquired with the FIM technique). Our framework can also be used in multiple other applications, e.g., the graph cut algorithm and its extensions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 53 references that are in the map. First posted on arXiv 2 Jun 2022.

Builds on

2 of 53 references.

References · 2

  1. 2018fastMRI: An Open Dataset and Benchmarks for Accelerated MRIcited by 470
  2. 2019End-to-End Learned Random Walker for Seeded Image Segmentationcited by 4

Built on by

Not cited yet.