Skip to main content
Log in

Algorithms for Automatic Separation and Indexing of Image Footprints in Satellite Bundle Block Adjustment

  • Research Article
  • Published:
Journal of the Indian Society of Remote Sensing Aims and scope Submit manuscript

Abstract

This paper brings out the algorithms for automatic sorting and sequencing of images and grouping them into independent blocks from a heterogeneous database of images or sub-scenes. Method for finding the neighbors of a given image from a data base of images is also presented. These algorithms are also useful in the context of finding out the overlap area between the neighbors, automatic tie point detection and also for making mosaics over large areas. These algorithms are a part of in-house developed package for bundle block adjustment of satellite images.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Andrews, D. S., Snoeyink, J., Boritz, J., Chan, T., Denham, G., Harrison, J.et al. (1994). “Further Comparison of Algorithms for Geometric Intersection Problems”, Advances in GIS Research II, Proceedings of 6th International Symposium on Spatial Data Handling, 709–724.

  • Bentley, J., & Ottmann, T. (1979). Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers, C-28, 643–647.

    Article  Google Scholar 

  • de Berg, M., van Kreveld, M., Overmars, M., & Cheong, O. (2000). Computational geometry algorithms and applications. New York: Springer Verlag.

    Google Scholar 

  • ESRI. (1995). Regions: A powerful polygon modeling tool for representing complex areas. Redlands: Environmental Systems Research Institute.

    Google Scholar 

  • Gelder, Allen Van. (1995). Efficient computation of polygon area and polyhedron volume, 35–42. Graphical Gems Vol. V, Academic Press Inc.: US.

  • Haines, E. (1994). Point in polygon strategies. In P. S. Heckbert (Ed.), Graphics Gems IV. Cambridge: Academic Press.

    Google Scholar 

  • O’Rourke, J. (1994). Computational Geometry in C, Cambridge Universities Press. pp 35–39.

  • Mikhail, E. M., Bethel, J. S., & McGloan, J. C. (2001). Introduction to modern photogrammetry. New York: John Wiley and Sons, Inc.

    Google Scholar 

  • Sudheer Reddy, D. (2010). Monte Carlo method of finding overlap area between two image scenes when only corner coordinates are known. Journal of Indian Society of Remote Sensing, 38(4).

  • Sudheer Reddy, D., Nagasubramanian, V., Radhadevi, P.V., Saibaba, J., Geeta Varadan. (2011). Overlap area computation when the images are irregularly shaped, proceedings of geo spatial world forum, Jan.

  • Schirra, S. (2008). How reliable are practical point-in-polygon strategies? Proceedings of the 16th annual European symposium on Algorithms (pp. 744–755). Heidelberg: Springer-Verlag Berlin.

    Google Scholar 

  • Theobald, D. M. (2001). Topology revisited: representing spatial relations. International Journals of Geographical Information Science, 15(8), 689–705.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. Sudheer Reddy.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Reddy, D.S., Sumanth, T.K., Radhadevi, P.V. et al. Algorithms for Automatic Separation and Indexing of Image Footprints in Satellite Bundle Block Adjustment. J Indian Soc Remote Sens 43, 459–465 (2015). https://doi.org/10.1007/s12524-014-0388-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12524-014-0388-2

Keywords

Navigation