Efficient primitive binary morphological algorithms on a massively parallel processor

One of the most important features in image analysis and understanding is s hape. Mathematical morphology is the image processing branch that deals wit h shape analysis. The definition of ail morphological transformations is ba sed on two primitive operations, i.e., dilation and erosion. Since many app lications require the solution of morphological problems in real time, rese arching time efficient algorithms for these two operations is crucial. In t his paper, efficient algorithms for the binary dilation and erosion are pre sented and evaluated for an advanced associative processor. Simulation resu lts show that the proposed algorithms for this advanced architecture reach a near optimal speedup compared to the serial algorithm. Additionally, it i s proven that the implementation of this image processor is economically fe asible. (C) 2001 SPIE and IS&T.