Based on the hierarchical representation, matching process is from coarse to fine. Given two HPG, root nodes in the lowest resolution are matched by default. Then the ADJs of root nodes are calledforgraphmatching.ModifiedVF2 algorithm [35] is adopted in sub-graph isomorphism for its robustness and efficiency, where the matching condition requires edge property is the same. For example, concave and convex seed wires are different that their related pairs of features are not valid to be matched. Since the matching result of sub-graph isomorphism is of multiple scenarios, the best match with the highest similarity in the parent resolution is chosen before iteration to child resolution level. The depth-first iteration stops if no matching is available or leaf nodes are reached.