Abstract: Estimating absolute geospatial accuracy in input images without the use of surveyed control points is disclosed. For example, the absolute geospatial accuracy of a satellite images may be estimated without the use of control points (GCPs). The absolute geospatial accuracy of the input images may be estimated based on a statistical measure of relative accuracies between pairs of overlapping images. The estimation of the absolute geospatial accuracy may include determining a root mean square error of the relative accuracies between pairs of overlapping images. For example, the absolute geospatial accuracy of the input images may be estimated by determining a root mean square error of the shears of respective pairs of overlapping images. The estimated absolute geospatial accuracy may be used to curate GCPs, evaluate a digital elevation map, generate a heatmap, or determine whether the adjust the images until a target absolute geospatial accuracy is met.

Abstract: Estimating absolute geospatial accuracy in input images without the use of surveyed control points is disclosed. For example, the absolute geospatial accuracy of a satellite images may be estimated without the use of control points (GCPs). The absolute geospatial accuracy of the input images may be estimated based on a statistical measure of relative accuracies between pairs of overlapping images. The estimation of the absolute geospatial accuracy may include determining a root mean square error of the relative accuracies between pairs of overlapping images. For example, the absolute geospatial accuracy of the input images may be estimated by determining a root mean square error of the shears of respective pairs of overlapping images. The estimated absolute geospatial accuracy may be used to curate GCPs, evaluate a digital elevation map, generate a heatmap, or determine whether the adjust the images until a target absolute geospatial accuracy is met.

Abstract: A set of input images from satellites (or other remote sensors) can be orthorectified and stitched together to create a mosaic. If the resulting mosaic is not of suitable quality, the input images can be adjusted and the processes of orthorectifying and creating the mosaic can be repeated. However, orthorectifying and creating the mosaic uses a large amount of computational resources and takes a lot of time. Therefore, performing numerous iterations is expensive and sometimes not practical. To overcome these issues, it is proposed to generate an indication of accuracy of the resulting mosaic prior to orthorectifying and creating the mosaic by accessing a set of points in the plurality of input images, projecting the points to a model, determining residuals for the projected points, and generating the indication of accuracy of the orthorectified mosaic based on the determined residuals.

Abstract: A set of input images from satellites (or other remote sensors) can be orthorectified and stitched together to create a mosaic. If the resulting mosaic is not of suitable quality, the input images can be adjusted and the processes of orthorectifying and creating the mosaic can be repeated. However, orthorectifying and creating the mosaic uses a large amount of computational resources and takes a lot of time. Therefore, performing numerous iterations is expensive and sometimes not practical. To overcome these issues, it is proposed to generate an indication of accuracy of the resulting mosaic prior to orthorectifying and creating the mosaic by accessing a set of points in the plurality of input images, projecting the points to a model, determining residuals for the projected points, and generating the indication of accuracy of the orthorectified mosaic based on the determined residuals.

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: 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.