data registration Up:Graph
ambiguities, matches validation
1) To solve the ambiguities of kind M(1,c) , M(i,1) and M(i,c)
we choose the matched pairs having the lowest value w.r.t. the defined
criterion in order to get only matches of kind M(1,1).
2) The matches M(1,1) are validated depending on the value
of the criterion. Indeed, all the bi-univoque matches are not valid. We
can have a good value for one attribute and a bad one for another as for
the following cases:
non validation = bad detection on the image, too important
generalization on the map or non updated map.
non matched cartographic section = non detection on the image
or object disappearance.
non matched image section = false alarm on the image or appearance
of a new object unreferenced on the map.
Christine Hivernat & Xavier Descombes