Morphological structuring function decomposition

The author attempts to solve the structuring function decomposition problem where the structuring function refers to the gray scale structuring element. A morphologically realizable representation for the structuring function that reduces the structuring function decomposition into a series of binary structuring element decompositions is presented. Recursive algorithms that are pipelinable for efficiently performing gray scale morphological operations are developed on the basis of proposed representation and decomposition. The results are beneficial to real-time image analysis in terms of computer architecture and software development.<>