模式识别与人工智能
Thursday, Apr. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2006, Vol. 19 Issue (3): 349-356    DOI:
Researches and Applications Current Issue| Next Issue| Archive| Adv Search |
A Fast Watershed Algorithm Based on Drain Simulations
ZHANG LiDong, BI DuYan
The Fourth Department, College of Engineering, Air Force Engineering University, Xi’an 710038

Download: PDF (1330 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  In this paper, a new fast algorithm for computing watershed in digital grayscale images is introduced. The presented algorithm is based on drain process. The flooding process of traditional algorithm is replaced by finding regional maximum on curve of section .The results show that the proposed one has lower memory requirement and is much faster than the traditional one. Moreover, it combines with recognition which can control the complexity of the segmentation to reduce the over segmentation and computing complexity.
Key wordsDrain Simulations      Image Segmentation      Watershed      Mathematical Morphology     
Received: 20 December 2004     
ZTFLH: TP391.4  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
ZHANG LiDong
BI DuYan
Cite this article:   
ZHANG LiDong,BI DuYan. A Fast Watershed Algorithm Based on Drain Simulations[J]. , 2006, 19(3): 349-356.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2006/V19/I3/349
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn