This paper presents a fast method to compute homeomorphisms between 2D lattices and shapes found in binary images. Unlike many other methods, this mapping is not restricted to simply connected shapes but applies to arbitrary topologies. Moreover, it provides an avenue to the embedding of shapes in vectorspaces over R and C and thus enables robust shape recognition.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Bounding box splitting for robust shape classification


    Contributors:


    Publication date :

    2005-01-01


    Size :

    618897 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Bounding Box Splitting for Robust Shape Classification

    Bauckhage, C. / Tsotsos, J. K. | British Library Conference Proceedings | 2005


    Robust ellipsoidal state bounding algorithm

    Wei, C. / Xianfang, S. | British Library Online Contents | 2006



    Robust Design Optimization via Failure Domain Bounding

    Crespo, Luis / Kenny, Sean / Giesy, Daniel | AIAA | 2007


    Robust sparse bounding sphere for 3D face recognition

    Ming, Y. / Ruan, Q. | British Library Online Contents | 2012