The properties of soft morphological operations and the new definitions of binary soft morphological operations are presented. It is shown that soft morphological filtering on an arbitrary signal is equivalent to decomposing the signal into binary signals, filtering each binary signal with a binary soft morphological filter, and then reversing the decomposition. This equivalence allows problems in the analysis and the implementation of soft morphological operations in real time by using only logic gates for binary signals instead of sorting numbers.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Threshold decomposition of soft morphological filters


    Contributors:
    Shih, F.Y. (author) / Pu, C.C. (author)


    Publication date :

    1993-01-01


    Size :

    170980 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Training-based optimization of soft morphological filters

    Koivisto, P. / Huttunen, H. / Kuosmanen, P. | British Library Online Contents | 1996


    Threshold Decomposition of Gray-Scale Soft Morphology into Binary Soft Morphology

    Pu, C. C. / Shih, F. Y. | British Library Online Contents | 1995


    Text enhancement method based on soft morphological filters [2181-24]

    Koskinen, L. / Huttunen, H. / Astola, J. et al. | British Library Conference Proceedings | 1994


    Generalized threshold decomposition

    Hongke Zhang / Baozong Yuan | IEEE | 1994


    Generalized Threshold Decomposition

    Zhang, H. / Yuan, B. / IEEE; Hong Kong Chapter of Signal Processing | British Library Conference Proceedings | 1994