Segmentation of a composite image which contains two simple subimages is described. The a-priori knowledge about the two simple subimages is that they possess the maximum amount of entropy. The probability density functions (pdfs) of these image pixels are shown to be of the quasi-Gaussian form. Parameters for the pdf are estimated and then the maximum likelihood ratio test is applied to segmentation. An iterative algorithm is employed to improve the segmentation accuracy. Extension of this method to the segmentation of images with arbitrary pdfs is discussed.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Image segmentation using maximum entropy method


    Contributors:


    Publication date :

    1994-01-01


    Size :

    260901 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Image Segmentation Using Maximum Entropy Method

    Leung, C. K. / Lam, F. K. / IEEE; Hong Kong Chapter of Signal Processing | British Library Conference Proceedings | 1994


    Lane mark segmentation method based on maximum entropy

    Yu Tianhong, / Wang Rongben, / Jin Lisheng, et al. | IEEE | 2005


    Lane Mark Segmentation Method Based on Maximum Entropy

    Yu, T. / Wang, R. / Jin, L. et al. | British Library Conference Proceedings | 2005


    Using image entropy maximum for auto exposure

    Rahman, M.T. / Kehtarnavaz, N. / Razlighi, Q.R. | British Library Online Contents | 2011