Issue No. 05 - May (1990 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.55107
<p>A method of recognizing partially occluded objects is presented in which each object is represented by a set of landmarks. Given a scene consisting of partially occluded objects, a model object in the scene is hypothesized by matching the landmarks of the model with those in the scene. A measure of similarity between two landmarks is needed to perform this matching. A local shape measure, sphericity, is introduced. It is shown that any invariant function under a similarity transformation is a function of the sphericity. To match landmarks between the model and the scene, a table of compatibility is constructed. A technique, known as hopping dynamic programming, is described to guide the landmark matching through the compatibility table. The location of the model in the scene is estimated with a least-squares fit among the matched landmarks. A heuristic measure is then computed to decide if the model is in the scene.</p>
partial shape recognition; similarity; sphericity; compatibility; hopping dynamic programming; landmark matching; least-squares fit; heuristic; dynamic programming; pattern recognition; picture processing
E. Delp and N. Ansari, "Partial Shape Recognition: A Landmark-Based Approach," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 12, no. , pp. 470-483, 1990.