6. The method of claim 1 , further comprising the steps of: assigning each of the semantic class labels to a corresponding node of the graph; computing a count of the 4-connections between nodes; and forming an edge between two nodes when the count is above a predetermined number of pixels.
9. The method of claim 6 , further comprising at least one of the following steps of: deleting a node that is most likely to be misclassifications by using knowledge of a ground sampling distance and an expected size and shape of a blob; eliminating shadows by interconnecting all of the shadow's neighbors and deleting the node representing the shadow; deleting nodes that has no connections; merging connected road types into a single field node; replacing a fully-connected sub-graph of plurality of tree nodes with a forest node; reclassifying a vehicle as a moving vehicle if its mean speed exceeds a predetermined threshold; replacing a group of three or more moving-vehicles connected by “following” edges by a convoy; and replacing a fully-connected sub-graph of plurality of “X” nodes by a “group-of-X” node.