International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 47 - Issue 11 |
Published: June 2012 |
Authors: Suphalakshmi. A, Anandhakumar P |
![]() |
Suphalakshmi. A, Anandhakumar P . An Improved Fast Watershed Algorithm based on finding the Shortest Paths with Breadth First Search. International Journal of Computer Applications. 47, 11 (June 2012), 1-9. DOI=10.5120/7229-7959
@article{ 10.5120/7229-7959, author = { Suphalakshmi. A,Anandhakumar P }, title = { An Improved Fast Watershed Algorithm based on finding the Shortest Paths with Breadth First Search }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 47 }, number = { 11 }, pages = { 1-9 }, doi = { 10.5120/7229-7959 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Suphalakshmi. A %A Anandhakumar P %T An Improved Fast Watershed Algorithm based on finding the Shortest Paths with Breadth First Search%T %J International Journal of Computer Applications %V 47 %N 11 %P 1-9 %R 10.5120/7229-7959 %I Foundation of Computer Science (FCS), NY, USA
A watershed based on rainfall simulation is a proven technique for image segmentation. The only problem associated with it is the path regularization for pixels in the plateau. As the existing methods employ sequential techniques, the complexity of the algorithms remains high due to repetitive scanning of pixels. We propose an iterative method for finding the shortest and steepest path based on Breadth first search (BFS), which addresses the path regularization problem eliminating the repetitive scans. Experiments show, that the proposed algorithm significantly reduces the running time without compensating the performance when compared with the fastest known algorithm.