A fast binary morphological algorithm by overlapping and mature point

One of the most efficient binary morphological algorithms was proposed by Boomgaard and van Balen (1992). Their method exploited the potential of the present 32-bit and 64-bit computer architecture by encoding the image in bitmap format and performed the operation in a 32-bit or 64-bit parallel fashion. In addition, the logarithmic decomposition of the structuring element is also employed to achieve high efficiency for the method. Nevertheless, this fast morphological algorithm can be further improved by including two proposed techniques, they are the technique of using overlap among processing areas of neighbouring pixels and the technique of mature point respectively.