Share Email Print

Proceedings Paper

Modified watershed algorithm considering zero-crossing point of gradient
Author(s): Dong-In Park; Yun-Ho Ko; Ji-Hong Lee; Young-Woo Park
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we propose a modified watershed algorithm considering zero-point of gradient to obtain a correct edge of a region. The conventional watershed algorithm decide priority considering gradient of a region to be extended. However if the grey levels of two neighboring seeds are quite different, the ridge line obtained by the conventional watershed algorithm is not coincided with the correct edge. It is probable that the point where gray level extreme value occurs will be estimated as an edge of two neighboring regions. Therefore more correct edge of a region can be obtained if the expansion of watershed algorithm is delayed where the extreme value occurs. The position where the gray level extreme value occurs corresponds to the position where the zero-crossing of gradient occurs. So we adjust the priority to postpone expansion at the zero-crossing point of gradient. We compare the proposed method with the conventional method and validate that this proposed method can extract more correct edge of a region.

Paper Details

Date Published: 9 January 2008
PDF: 6 pages
Proc. SPIE 6794, ICMIT 2007: Mechatronics, MEMS, and Smart Materials, 679418 (9 January 2008); doi: 10.1117/12.784376
Show Author Affiliations
Dong-In Park, Chungnam National Univ. (South Korea)
Yun-Ho Ko, Chungnam National Univ. (South Korea)
Ji-Hong Lee, Chungnam National Univ. (South Korea)
Young-Woo Park, Chungnam National Univ. (South Korea)

Published in SPIE Proceedings Vol. 6794:
ICMIT 2007: Mechatronics, MEMS, and Smart Materials
Minoru Sasaki; Gisang Choi Sang; Zushu Li; Ryojun Ikeura; Hyungki Kim; Fangzheng Xue, Editor(s)

© SPIE. Terms of Use
Back to Top