Skip to content

Seeded Region Growing

Jarek Sacha edited this page Jan 8, 2020 · 4 revisions

Seeded region growing algorithm is based on article by Rolf Adams and Leanne Bischof, "Seeded Region Growing", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 6, June 1994. The algorithm assumes that seeds for objects and the background be provided. Seeds are used to compute initial mean gray level for each region. Regions are grown from those seeds. The condition of growth is difference of a gray level of a candidate pixel and mean grey level intensity of a neighboring region. At each step of the algorithm, a candidate with a smallest difference to some neighboring region is added to that region and all neighboring points of that that are not yet assigned to any region are added to candidate list.

Tutorials

Seeded Region Growing Segmentation by Prof. Dr. Karl-Heinz Kunzelmann.

API

Seeded Region Growing (SRG) in API Documentation Scaladoc.

Clone this wiki locally