Recently a new convexity measure has been proposed based on approximation of input contour with a convex polygon. In this paper, an optimal algorithm is proposed for the construction of the convex polygon. The introduced algorithm provides exact value of the convexity measure and can therefore be used for evaluation of faster heuristic algorithms.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Optimal algorithm for convexity measure calculation


    Beteiligte:
    Kolesnikov, A. (Autor:in) / Franti, P. (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    177281 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Optimal Algorithm for Convexity Measure Calculation

    Kolesnikov, A. / Franti, P. | British Library Conference Proceedings | 2005


    A symmetric convexity measure

    Rosin, P. L. / Mumford, C. L. | British Library Online Contents | 2006


    A fast parallel image convexity algorithm

    Eshagian,M.M. / Hai,L. / New Jersey Inst.of Technol.,US | Kraftfahrwesen | 1997


    A Fast Parallel Image Convexity Algorithm

    Eshaghian, M. M. / Hai, L. | British Library Conference Proceedings | 1997


    Convexity-Based Visual Camouflage Breaking

    Tankus, A. / Yeshurun, Y. | British Library Online Contents | 2001