Share Email Print
cover

Proceedings Paper

Improved watershed algorithm for color image segmentation
Author(s): Hong-bo Tan; Zhi-qiang Hou; Xiao-chun Li; Rong Liu; Wei-wu Guo
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

To overcome over-segmentation of Watershed transform, a novel improved Watershed algorithm based on adaptive marker-extraction is proposed. The original marker-based Watershed algorithm is improved by considering multiple feature information of local minima and adaptively selecting threshold. The proposed method consists of five steps: 1) Calculating gradient directly with color vectors; 2) Low-pass filtering of gradient image with BTPF; 3) Employing Hminima transform to extract true local minima whose depth is lower than that of threshold H, which is adaptively adjusted according to gradient image's statistical character. 4) Further marker-extraction being based on water basin scale. 5) Imposing the markers on the original gradient image as its minima; finally, Watershed transform is implied to the marked gradient image to segment the image. Experimental results show that, compared with other testing Watershed algorithms, the proposed method can more efficiently reduce over-segmentation and obtain better segmentation performance with lower computational complexity; in addition, it has better anti-noise performance and edge-location capability as well.

Paper Details

Date Published: 30 October 2009
PDF: 8 pages
Proc. SPIE 7495, MIPPR 2009: Automatic Target Recognition and Image Analysis, 74952Z (30 October 2009); doi: 10.1117/12.832417
Show Author Affiliations
Hong-bo Tan, Air Force Engineering Univ. (China)
Zhi-qiang Hou, Air Force Engineering Univ. (China)
Xiao-chun Li, Air Force Engineering Univ. (China)
Rong Liu, Air Force Engineering Univ. (China)
Wei-wu Guo, Air Force Engineering Univ. (China)


Published in SPIE Proceedings Vol. 7495:
MIPPR 2009: Automatic Target Recognition and Image Analysis
Tianxu Zhang; Bruce Hirsch; Zhiguo Cao; Hanqing Lu, Editor(s)

© SPIE. Terms of Use
Back to Top