Invariant Image Recognition by Zernike Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficiently Computable Metric for Comparing Polygonal Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Local Grayvalue Invariants for Image Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
Shape Similarity Measure Based on Correspondence of Visual Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Object Recognition from Local Scale-Invariant Features
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
A SIFT Descriptor with Global Context
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Using the Inner-Distance for Classification of Articulated Shapes
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Robust contour matching via the order-preserving assignment problem
IEEE Transactions on Image Processing
Hi-index | 0.00 |
Shape description is the precondition for shape matching and retrieval. The more robust and stable primitives to describe shapes are global topological properties, but obtaining global topological properties is still an obstacle in computer vision. Motivated by the difference sensitivity of short-range connection in biology vision, we present a novel global descriptor to describe the entire topology of simple closed 2D shape in this paper. We employ two novel strategies --- the zigzag rule, which approximates shape to an elaborate polygonal curve, and cost function which combines global configurations as well as local information of the line stimulations as our punishments. With these two key steps the descriptor is robust to translation, scaling and rotation. Experimental results show the model gain good performance on matching and retrieval for silhouettes. Even for images with occlusion the result is excellent and reasonable.