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.
Bounding box splitting for robust shape classification
2005-01-01
618897 byte
Conference paper
Electronic Resource
English
Bounding Box Splitting for Robust Shape Classification
British Library Conference Proceedings | 2005
|Robust ellipsoidal state bounding algorithm
British Library Online Contents | 2006
|Robust Design Optimization via Failure Domain Bounding
AIAA | 2007
|Robust sparse bounding sphere for 3D face recognition
British Library Online Contents | 2012
|