International Conference on Information Technology: Computers and Communications Reduced Memory Implementation of Modified Serial Watershed Algorithm Based On Ordered Queue Las Vegas, Nevada April 28-April 30 ISBN: 0-7695-1916-4
Direct implementation of serial watershed algorithm based on ordered queue is very slow and consumes a lot of resources. Faster implementation of the algorithm on a chip is difficult owing to a large amount of memory required. In this paper, we propose a modified algorithm which re- quires fifty times less memory compared to the original watershed algorithm by ordered queue, and is also suitable or hardware implementation. Simulation results have been urnished to validate the proposed algorithm. An architecture suitable or FPGA/ASIC implementation is also proposed.
Citation:
Kumud Prakash Gupta, S. Srinivasan, "Reduced Memory Implementation of Modified Serial Watershed Algorithm Based On Ordered Queue," itcc, pp.514, International Conference on Information Technology: Computers and Communications, 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||