Abstract: A Metric Information Network (MIN) with a plurality of Ground Control Points (GCPs) that are selected in an automated fashion. The GCP selection includes clustering algorithms as compared to prior art pair-wise matching algorithms. Further, the image processing that takes place in identifying interest points, clustering, and selecting tie points to be GCPs is all performed before the MIN is updated. By arranging for the processing to happen in this manner, the processing that is embarrassingly parallel (identifying interest points, clustering, and selecting tie points) can be performed in a distributed fashion across many computers and then the MIN can be updated.

Abstract: The disclosure is directed to routing service requests over a network (50). Service requests may be routed over a network (50) based upon deriving optimized weights for each of a plurality of service providers (130) within a service provider set (135), receiving a plurality of service requests at a broker (110) within the network (50), and routing each of the plurality of service requests from the broker (110) to the plurality of service providers (130) on the network (50). In some implementations, the optimized weights for each of the plurality of service providers (130) may be derived using a non-linear function. In some implementations, the optimized weights for the plurality of service providers (130) associated with a broker (110) may collectively define a weighted distribution. The plurality of service requests may be routed by a broker (110) using its corresponding weighted distribution.

Abstract: A Metric Information Network (MIN) with a plurality of Ground Control Points (GCPs) that are selected in an automated fashion. The GCP selection includes clustering algorithms as compared to prior art pair-wise matching algorithms. Further, the image processing that takes place in identifying interest points, clustering, and selecting tie points to be GCPs is all performed before the MIN is updated. By arranging for the processing to happen in this manner, the processing that is embarrassingly parallel (identifying interest points, clustering, and selecting tie points) can be performed in a distributed fashion across many computers and then the MIN can be updated.

Abstract: A Metric Information Network (MIN) with a plurality of Ground Control Points (GCPs) that are selected in an automated fashion. The GCP selection includes clustering algorithms as compared to prior art pair-wise matching algorithms. Further, the image processing that takes place in identifying interest points, clustering, and selecting tie points to be GCPs is all performed before the MIN is updated. By arranging for the processing to happen in this manner, the processing that is embarrassingly parallel (identifying interest points, clustering, and selecting tie points) can be performed in a distributed fashion across many computers and then the MIN can be updated.

Abstract: The disclosure is directed to routing service requests over a network (50). Service requests may be routed over a network (50) based upon deriving optimized weights for each of a plurality of service providers (130) within a service provider set (135), receiving a plurality of service requests at a broker (110) within the network (50), and routing each of the plurality of service requests from the broker (110) to the plurality of service providers (130) on the network (50). In some implementations, the optimized weights for each of the plurality of service providers (130) may be derived using a non-linear function. In some implementations, the optimized weights for the plurality of service providers (130) associated with a broker (110) may collectively define a weighted distribution. The plurality of service requests may be routed by a broker (110) using its corresponding weighted distribution.