Graphs: theory and algorithms
Object Tracking in Cluttered Background Based on Optical Flows and Edges
ICPR '96 Proceedings of the 1996 International Conference on Pattern Recognition (ICPR '96) Volume I - Volume 7270
Tracking 3D Coplanar Points in the Invariant Perspective Coordinates Plane
ICPR '96 Proceedings of the 1996 International Conference on Pattern Recognition (ICPR '96) Volume I - Volume 7270
Irregular Pyramids with Combinatorial Maps
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Contraction kernels and combinatorial maps
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
| Hi-index | 0.00 |
The matching of an object, a region of an image segmentation, to a template is a heavy computation process, and is not very robust. We represent an object by a Region Adjacency Graph (RAG) on the top of which a pyramid (a decreasing sequence of RAG) is built according to a set of rules, which verify some uniqueness and uniformity properties. The contraction process preserves the structure of the RAG across the pyramid's levels, and the rules are chosen according to the characteristics of the template. By building such a pyramid and then by a top-down process to match all the sub-graphs we have a linear parallel complexity time, with a robust match and a partial match relative to the given set of rules.