# Image Segmentation via Probabilistic Graph Matching

Source: [Image Segmentation via Probabilistic Graph Matching](<https://www.sota2.com/research/paper/68fa6f551e209131cea451a5>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T01:18:28.677Z

Authors: Ayelet Heimowitz, Yosi Keller

Published: 2023-05-13T15:56:54.000Z

## Abstract

This work presents an unsupervised and semi-automatic image segmentation approach where we formulate the segmentation as a inference problem based on unary and pairwise assignment probabilities computed using low-level image cues. The inference is solved via a probabilistic graph matching scheme, which allows rigorous incorporation of low level image cues and automatic tuning of parameters. The proposed scheme is experimentally shown to compare favorably with contemporary semi-supervised and unsupervised image segmentation schemes, when applied to contemporary state-of-the-art image sets.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2305.07954>)

[PDF](<https://arxiv.org/pdf/2305.07954.pdf>)
