CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2005 vol.27 Issue No.11 - November
Issue No.11 - November (2005 vol.27)
With inspiration from psychophysical researches of the human visual system, we propose a novel aspect and a method for performance evaluation of contour-based shape recognition algorithms regarding their robustness to incompleteness of contours. We use complete contour representations of objects as a reference (training) set. Incomplete contour representations of the same objects are used as a test set. The performance of an algorithm is reported using the recognition rate as a function of the percentage of contour retained. We call this evaluation procedure the ICR test. We consider three types of contour incompleteness, viz. segment-wise contour deletion, occlusion, and random pixel depletion. As an illustration, the robustness of two shape recognition algorithms to contour incompleteness is evaluated. These algorithms use a shape context and a distance multiset as local shape descriptors. Qualitatively, both algorithms mimic human visual perception 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 method performs better than the shape context method in this test framework.
Index Terms- Contour, COIL, deletion, depletion, distance multiset, Gollin, incompleteness, ICR test, MPEG-7, object recognition, occlusion, psychophysics, shape, shape context.
Anarta Ghosh, Nicolai Petkov, "Robustness of Shape Descriptors to Incomplete Contour Representations", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 11, pp. 1793-1804, November 2005, doi:10.1109/TPAMI.2005.225