Application of Sleator-Tarjan Dynamic Trees in a Monitoring System for the Arctic Region Based on Remote Sensing Data

  • Philipp Galiano
  • Mikhail Kharinov
  • Sergey Vanurin
Chapter
Part of the Lecture Notes in Geoinformation and Cartography book series (LNGC)

Abstract

In this chapter, the monitoring system for the Arctic region, as used for automation of an ice situation assessment, is described. The main type of input data for the system is remote sensing of Earth observations. System improvement using Sleator-Tarjan dynamic trees is discussed. Elementary algorithms of considered tree-structured data are presented. A comparison of computing results with the results of interactive recognition executed by experts from the Arctic and Antarctic Research Institute is carried out. Further implementation development and the development of the system applications are analyzed.

Keywords

Remote sensing Image processing Dynamic trees 

References

  1. Boykov Y, Kolmogorov V (2004) An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans Pattern Anal Mach Intell 26(9):1124–1137CrossRefGoogle Scholar
  2. Bugaev AS, Khelvas AV (2001) Pilot studies and development of methods and tools for analysis and automatic recognition of media flows in global information systems, Scientific and technical report, Moscow Institute of Physics and Technology (MIPT), Moscow, vol 1, p 140 (in Russian)Google Scholar
  3. Kharinov MV (1993) Data structures of learning system for automatic image recognition, PhD thesis, SPb: SPIIRAS, p 20 (in Russian). See also http://www.dslib.net/vychislit-mashiny/azrabotka-dinamicheskih-struktur-dannyh-sistemy-avtomatizirovannogo-raspoznavanija.html
  4. Kharinov MV (2012) Stable segmentation of digital image, computer graphics and vision (Graphicon’2012). In: Proceedings of the 22th international conference on computer graphics and vision, Moscow, MSU, 1–5 Oct 2012, pp 208–213 (in Russian). See also http://arxiv.org/abs/1208.2655v1
  5. Kharinov MV (2012b) Adaptive dichotomous image segmentation toolkit. Pattern Recogn Image Anal: Adv Math Theor Appl 22(1):228–235CrossRefGoogle Scholar
  6. Kharinov MV, Nesterov MM (1997) Intelligent program for automatic image recognition based on compact object-fitting hierarchical image representation in terms of dynamic irregular ramified trees. International Academy, Vestnik. Special issue of MAISU bulletin no12-C, SPb, pp 1–35. (LC Control Number: 98646239-98646240)Google Scholar
  7. Mumford D, Shah J (1985) Boundary detection by minimizing functionals. In: Proceedings of the IEEE computer vision pattern recognition conference, San Francisco, pp 22–26Google Scholar
  8. Mumford D, Shah J (1989) Optimal approximations by piecewise smooth functions and associated variational problems. Commun Pure Appl Math XLII(4):577–685CrossRefGoogle Scholar
  9. Nock R, Nielsen F (2004) Statistical region merging. IEEE Trans Pattern Anal Mach Intell 26(11):1452–1458CrossRefGoogle Scholar
  10. Sarnak N, Tarjan RE (1986) Planar point location using persistent search trees. Commun ACM 29(7):669–679CrossRefGoogle Scholar
  11. Sleator DD, Tarjan RE (1983) A data structure for dynamic trees. J Comput Syst Sci 26(3):362–391CrossRefGoogle Scholar
  12. Sleator DD, Tarjan RE (1985) Self-adjusting binary search trees. J ACM 32(3):652–686CrossRefGoogle Scholar
  13. Tarjan RE (1975) Efficiency of a good but not linear set union algorithm. J ACM 22(2):215–225CrossRefGoogle Scholar
  14. Tarjan RE (1985) Sequential access in splay trees takes linear time: sequential access in splay trees takes linear time. Combinatorica 5(4):367–378CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Philipp Galiano
    • 1
  • Mikhail Kharinov
    • 1
  • Sergey Vanurin
    • 1
  1. 1.St.Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences (SPIIRAS)St.PetersburgRussia

Personalised recommendations