Abstract
One of the most important features in image analysis and understanding is shape. Mathematical morphology is the image pro- cessing branch that deals with shape analysis. The definition of all morphological transformations is based on two primitive operations, i.e., dilation and erosion. Since many applications require the solu- tion of morphological problems in real time, researching time effi- cient algorithms for these two operations is crucial. In this paper, efficient algorithms for the binary dilation and erosion are presented and evaluated for an advanced associative processor. Simulation results show that the proposed algorithms for this advanced archi- tecture reach a near optimal speedup compared to the serial algo- rithm. Additionally, it is proven that the implementation of this image processor is economically feasible. © 2001 SPIE and IS&T.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
