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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal algorithm for convexity measure calculation


    Contributors:
    Kolesnikov, A. (author) / Franti, P. (author)


    Publication date :

    2005-01-01


    Size :

    177281 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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 | Automotive engineering | 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