Abstract
Region growing algorithms, including seeded region growing, are a widely
employed technique used in image segmentation problems. It is common
for region growing techniques to employ queue based techniques
that sequentially add pixels to regions. These algorithms are very flexible,
but it is sometimes desirable to be able to apply some constraints
to the growing process that reflect some higher level knowledge about
the problem.
This paper describes a technique that constrains (regularizes) the
border smoothness of a growing region using a polygonal representation
and provides some results illustrating a possible application. The
technique can be usefully combined with traditional, unregularized techniques
| Original language | English |
|---|---|
| Title of host publication | Mathematical Morphology - Proceedings of the VIth International Symposium ISMM 2002 |
| Editors | Hugues Talbot, Richard Beare |
| Place of Publication | Australia |
| Publisher | CSIRO Publishing |
| Pages | 91 - 99 |
| Number of pages | 9 |
| ISBN (Print) | 0 643 06804 X |
| Publication status | Published - 2002 |
| Event | VIth International Symposium ISMM 2002 - , Australia Duration: 1 Jan 2002 → … |
Conference
| Conference | VIth International Symposium ISMM 2002 |
|---|---|
| Abbreviated title | ISMM 2002 |
| Country/Territory | Australia |
| Period | 1/01/02 → … |