Symmetric region growing

Research output: Contribution to journalArticle

124 Citations (Scopus)

Abstract

Of the many proposed image-segmentation methods, region growing has been one of the most popular. Research on region growing, however, has focused primarily on the design of feature measures and on growing and merging criteria. Most of these methods have an inherent dependence on the order in which the points and regions are examined. This weakness implies that a desired segmented result is sensitive to the selection of the initial growing points. We define a set of theoretical criteria for a subclass of region-growing algorithms that are insensitive to the selection of the initial growing points. This class of algorithms, referred to as Symmetric Region Growing, leads to a single-pass region-growing algorithm applicable to any dimensionality of images. Furthermore, they lead to region-growing algorithms that are both memory- and computation-efficient. Results illustrate the method's efficiency and its application to 3-D medical image segmentation.

Original languageEnglish (US)
Pages (from-to)1007-1015
Number of pages9
JournalIEEE Transactions on Image Processing
Volume12
Issue number9
DOIs
StatePublished - Sep 1 2003

Fingerprint

Image segmentation
Three-Dimensional Imaging
Merging
Efficiency
Data storage equipment
Research

All Science Journal Classification (ASJC) codes

  • Software
  • Medicine(all)
  • Computer Graphics and Computer-Aided Design

Cite this

Wan, Shu Yen ; Higgins, William Evan. / Symmetric region growing. In: IEEE Transactions on Image Processing. 2003 ; Vol. 12, No. 9. pp. 1007-1015.
@article{9cfd31888dcb4b5a8fe2d9b85bf9fae2,
title = "Symmetric region growing",
abstract = "Of the many proposed image-segmentation methods, region growing has been one of the most popular. Research on region growing, however, has focused primarily on the design of feature measures and on growing and merging criteria. Most of these methods have an inherent dependence on the order in which the points and regions are examined. This weakness implies that a desired segmented result is sensitive to the selection of the initial growing points. We define a set of theoretical criteria for a subclass of region-growing algorithms that are insensitive to the selection of the initial growing points. This class of algorithms, referred to as Symmetric Region Growing, leads to a single-pass region-growing algorithm applicable to any dimensionality of images. Furthermore, they lead to region-growing algorithms that are both memory- and computation-efficient. Results illustrate the method's efficiency and its application to 3-D medical image segmentation.",
author = "Wan, {Shu Yen} and Higgins, {William Evan}",
year = "2003",
month = "9",
day = "1",
doi = "10.1109/TIP.2003.815258",
language = "English (US)",
volume = "12",
pages = "1007--1015",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

Symmetric region growing. / Wan, Shu Yen; Higgins, William Evan.

In: IEEE Transactions on Image Processing, Vol. 12, No. 9, 01.09.2003, p. 1007-1015.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Symmetric region growing

AU - Wan, Shu Yen

AU - Higgins, William Evan

PY - 2003/9/1

Y1 - 2003/9/1

N2 - Of the many proposed image-segmentation methods, region growing has been one of the most popular. Research on region growing, however, has focused primarily on the design of feature measures and on growing and merging criteria. Most of these methods have an inherent dependence on the order in which the points and regions are examined. This weakness implies that a desired segmented result is sensitive to the selection of the initial growing points. We define a set of theoretical criteria for a subclass of region-growing algorithms that are insensitive to the selection of the initial growing points. This class of algorithms, referred to as Symmetric Region Growing, leads to a single-pass region-growing algorithm applicable to any dimensionality of images. Furthermore, they lead to region-growing algorithms that are both memory- and computation-efficient. Results illustrate the method's efficiency and its application to 3-D medical image segmentation.

AB - Of the many proposed image-segmentation methods, region growing has been one of the most popular. Research on region growing, however, has focused primarily on the design of feature measures and on growing and merging criteria. Most of these methods have an inherent dependence on the order in which the points and regions are examined. This weakness implies that a desired segmented result is sensitive to the selection of the initial growing points. We define a set of theoretical criteria for a subclass of region-growing algorithms that are insensitive to the selection of the initial growing points. This class of algorithms, referred to as Symmetric Region Growing, leads to a single-pass region-growing algorithm applicable to any dimensionality of images. Furthermore, they lead to region-growing algorithms that are both memory- and computation-efficient. Results illustrate the method's efficiency and its application to 3-D medical image segmentation.

UR - http://www.scopus.com/inward/record.url?scp=0041927983&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041927983&partnerID=8YFLogxK

U2 - 10.1109/TIP.2003.815258

DO - 10.1109/TIP.2003.815258

M3 - Article

C2 - 18237973

AN - SCOPUS:0041927983

VL - 12

SP - 1007

EP - 1015

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 9

ER -