We consider the problem of line graphs matching. The nodes correspond to segments characterized by their length and theirudangle. A Markov model allows us to embed the problem into a labelling problem. The derived model is invariant with respectudto rotations and translations. The algorithm is applied to road networks extracted from a SPOT image and a cartographic database.udThe matching is performed after having chained the road pixels extracted from the image. After the matching, a qualificationudstep provides a registration matrix and allows us to interpret the results in order to update the cartographic database.
展开▼