Efficient Graph-Based Image Segmentation | VitaVision
PaperInternational Journal of Computer Vision · 2004

Efficient Graph-Based Image Segmentation

Pedro F. FelzenszwalbDaniel P. Huttenlocher
DOIView in graph
1page built on it
1more page cites it
1narrative
1registry paper cites it

In the Atlas

AlgorithmPrimary source of
Felzenszwalb–Huttenlocher Graph-Based Image Segmentation

Partition an image into perceptually coherent regions by a Kruskal-style greedy merge over a pixel graph, accepting an inter-component edge as a non-boundary when its weight does not exceed the components' internal variation plus a size-adaptive threshold.

Cited as a reference by 1 page, grouped by domain

Segmentation 1
Energy Minimization

Appears in 1 narrative

NarrativeSegmentation, from Energy to Prompt

Lineage

Papers in the Atlas registry only · one dot per paper
Built upon by · 1
’04’05’06’07’08’09’10’11’12’13’14’15’16’17’18’19’20’21’22’23Segment Anything (2023)
Builds on · 0