An improved seeded region growing algorithm

Andrew Mehnert

doi:10.1016/S0167-8655(97)00131-1

An improved seeded region growing algorithm

1997-10-01

261

PRE

AI

DOI：10.1016/S0167-8655(97)00131-1

原文链接

原文求助

摘要

En 中文

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.

Keyword:

priority queue

seeded region growing

segmentation

watershed segmentation

An improved seeded region growing algorithm

摘要

AI总结

期刊

机构

引用论文