A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Matching With a Dual-Step EM Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
View-Based Recognition Using an Eigenspace Approximation to the Hausdorff Measure
IEEE Transactions on Pattern Analysis and Machine Intelligence
Twenty Years of Document Image Analysis in PAMI
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-Feature Hierarchical Template Matching Using Distance Transforms
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Robustness of Shape Descriptors to Incomplete Contour Representations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Wavelet descriptor of planar curves: theory and applications
IEEE Transactions on Image Processing
Contour detection based on nonclassical receptive field inhibition
IEEE Transactions on Image Processing
Distance sets for shape filters and shape recognition
IEEE Transactions on Image Processing
A biologically motivated multiresolution approach to contour detection
EURASIP Journal on Applied Signal Processing
Hi-index | 0.00 |
Present image processing algorithms are unable to extract a neat and closed contour of an object of interest from a natural image. Advanced contour detection algorithms extract the contour of an object of interest from a natural scene with a side effect of depletion of the contour. Hence in order to perform well in a real world scenario, object recognition algorithms should be robust to contour incompleteness. With inspiration from psychophysical studies of the human cognitive abilities we propose a novel method to evaluate the performance of object recognition algorithms in terms of their robustness to incomplete contour representations. Complete contour representations of objects are used as a reference (training) set. Incomplete contour representations of the same objects are used as a test set. The performance of an algorithm is evaluated using the recognition rate as a function of the percentage of contour retained. The test framework is illustrated by using two contour based shape recognition algorithms which use a shape context and a distance multiset as shape descriptors. Three types of contour incompleteness, viz. segment-wise contour deletion, occlusion and random pixel depletion, are considered. In our experiments we use images from the COIL and MPEG-7 datasets. Both algorithms qualitatively perform similar to the human visual system in the sense that recognition performance monotonously increases with the degree of completeness and that they perform best in the case of random depletion and worst in the case of occluded contours. The distance multiset shape descriptor outperforms the shape context in this test especially for high levels of incompleteness.