Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution minimizes an energy. Energies defined over the set of the binary images are inevitably nonconvex and there are no general methods to calculate the global minimum, while local minimizers are very often of limited interest. In this paper we define the restored image as the global minimizer of the total-variation (TV) energy functional constrained to the collection of all binary-valued images. We solve this constrained non-convex optimization problem by deriving another functional which is convex and whose (unconstrained) minimum is proven to be reached for the global minimizer of the binary constrained TV functional. Practical issues are discussed and a numerical example is provided.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Finding the global minimum for binary image restoration


    Contributors:
    Chan, T.F. (author) / Esedoglu, S. (author) / Nikolova, M. (author)


    Publication date :

    2005-01-01


    Size :

    223568 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Finding the Global Minimum for Binary Image Restoration

    Chan, T. F. / Esedoglu, S. / Nikolova, M. | British Library Conference Proceedings | 2005


    Method for Finding a Global Minimum

    Bolonkin, A. / Khot, N. / AIAA et al. | British Library Conference Proceedings | 1994


    Method for finding a global minimum

    Bolonkin, A. / Khot, N. | AIAA | 1994


    Global and local methods of image restoration

    Milyukova, O. / Kober, V. / Karnaukhov, V. et al. | British Library Online Contents | 2012


    Finding minimum-cost paths for electric vehicles

    Sweda, Timothy M. / Klabjan, Diego | IEEE | 2012