Recognition of occluded objects with heuristic search
TL;DR: A new heuristic search based approach for recognition of partially obscured planar shapes using an admissible heuristic function which is not dependent upon the features actually used for representing the shapes.
Abstract: This paper presents a new heuristic search based approach for recognition of partially obscured planar shapes. Based on a general scheme for representing the planar shapes in terms of their contour segments, a state space formulation is obtained for the recognition problem. The search in the state space is guided by an admissible heuristic function which is not dependent upon the features actually used for representing the shapes. Some schemes for toning up the efficiency of the method are also discussed. A study of the method was carried out by experimenting with some typical objects and results of experimentation are presented.
...read more
Citations
100 citations
Cites methods from "Recognition of occluded objects wit..."
...The strategy of dynamic line segment merging has been adopted in on-line [28] and o!-line character recognition [29], as well as in shape recognition [30]....
[...]
19 citations
17 citations
Cites background from "Recognition of occluded objects wit..."
...) Without providing a rigorous statistical analysis, it can be stated that a reasonable expectation is that the minimum-error triplet ( i∗, j∗; h∗), defined by (i∗, j∗; h∗) = arg min (i,j;h) E(2) h(i, j) (9)...
[...]
...Examples include Ansari and Delp (1990), Han and Jang (1990), Chaudhury et al. (1990), Ray and Majumder (1991), and Salari and Balaji (1991)....
[...]
16 citations
15 citations
References
3,688 citations
652 citations
583 citations
543 citations