Abstract
This paper presents a fast implementation method for grayscale function processing (FP) systems. The proposed method is based on the matrix representation of the FP system using the basis matrix (BM) and the block basis matrix (BBM). The computational efficiency derives from recursive algorithms based on some characteristics of the BM and BBM matrices. It is shown that, with the proposed scheme, both opening and closing can be determined in real time by 2N - 2 additions and 2N - 2 comparisons, and open-closing and close-opening by 4N - 4 additions and 4N - 4 comparisons, when the size of the GSE is equal to N.
Sign-in/Register to access full text options 
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.
