Space and Time Bounds on Indexing 3D Models from 2D Images
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part I
A Bayesian approach to model matching with geometric hashing
Computer Vision and Image Understanding
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
The HumanID Gait Challenge Problem: Data Sets, Performance, and Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Contour-Based Learning for Object Detection
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Incremental learning of object detectors using a visual shape alphabet
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Groups of Adjacent Contour Segments for Object Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning a discriminative classifier using shape context distances
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
A boundary-fragment-model for object detection
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Hi-index | 0.00 |
The real time requirement is an additional constraint on many intelligent applications in robotics, such as shape recognition and retrieval using a mobile robot platform. In this paper, we present a scalable approach for efficiently retrieving closed contour shapes. The contour of an object is represented by piecewise linear segments. A skip Tri-Gram is obtained by selecting three segments in the clockwise order while allowing a constant number of segments to be "skipped" in between. The main idea is to use skip Tri-Grams of the segments to implicitly encode the distant dependency of the shape. All skip Tri-Grams are used for efficiently retrieving closed contour shapes without pairwise matching feature points from two shapes. The retrieval is at least an order of magnitude faster than other state-of-the-art algorithms. We score 80% in the Bullseye retrieval test on the whole MPEG 7 shape dataset [11]. We further test the algorithm using a mobile robot platform in an indoor environment. 8 objects are used for testing from different viewing directions, and we achieve 82% accuracy.