CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

An improved seeded region growing algorithm

Andrew Mehnert (Institutionen för signaler och system) ; P. Jackway
Pattern Recognition Letters (0167-8655). Vol. 18 (1997), 10, p. 1065-1071.
[Artikel, refereegranskad vetenskaplig]

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Nyckelord: priority queue, seeded region growing, segmentation, watershed segmentation

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2012-04-10. Senast ändrad 2012-04-17.
CPL Pubid: 156525


Institutioner (Chalmers)

Institutionen för signaler och system (1900-2017)



Chalmers infrastruktur