Euclidean distance transform on the sea based on cellular automata modeling

被引：0
|
作者：
Wang J. [1 ,2 ]
Yang K. [1 ,2 ]
Zhu Y. [1 ,2 ]
Xiong J. [1 ]
机构：
[1] School of Information Science and Technology, Yunnan Normal University, Kunming
[2] The Engineering Research Center of GIS Technology in Western China, Kunming
来源：
Cehui Xuebao/Acta Geodaetica et Cartographica Sinica | 2019年 / 48卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Cellular automata; Distance transform; Obstacles avoiding; South China Sea;
D O I：
10.11947/j.AGCS.2019.20170477
中图分类号：
学科分类号：
摘要：
To explore the problem of distance transformations while obstacle existing, this paper presents an obstacle-avoiding Euclidean distance transform method based on cellular automata. This research took the South China Sea as an example, imported the data of land-sea distribution and target points, took the length of the shortest obstacle-avoiding path from current cell to the target cells as the state of a cellular, designed the state transform rule of each cellular that considering a distance operator, then simulated the propagation of obstacle-avoiding distance, and got the result raster of obstacle-avoiding distance transform. After analyzing the effect and precision of obstacle avoiding, we reached the following conclusions: first, the presented method can visually and dynamically show the process of obstacle-avoiding distance transform, can automate calculate the shortest distance bypass the land; second, the method has auto update mechanism, each cellular can rectify distance value according to its neighbor cellular during the simulation process; At last, it provides an approximate solution for exact obstacle-avoiding Euclidean distance transform, the proportional error is less than 3.96%. The proposed method can apply to the fields of shipping routes design, maritime search and rescue, and so on. © 2019, Surveying and Mapping Press. All right reserved.
引用
收藏
页码：384 / 392
页数：8
相关论文
共 29 条
  • [1] Rosenfeld A., Pfaltz J.L., Sequential operations in digital picture processing, Journal of the ACM, 13, 4, pp. 471-494, (1966)
  • [2] Borgefors G., Distance transformations in digital images, Computer Vision, Graphics, and Image Processing, 34, 3, pp. 344-371, (1986)
  • [3] Fabbri R., Costa L.D.F., Torelli J.C., Et al., 2D Euclidean distance transform algorithms: a comparative survey, ACM Computing Surveys, 40, 1, pp. 1-44, (2008)
  • [4] Gustavson S., Strand R., Anti-aliased Euclidean distance transform, Pattern Recognition Letters, 32, 2, pp. 252-257, (2011)
  • [5] Carlos J., Federico E., Gabriel J., The exact Euclidean distance transform: a new algorithm for universal path planning, International Journal of Advanced Robotic Systems, 10, 10, (2013)
  • [6] Hill B., Baldock R.A., Constrained distance transforms for spatial atlas registration, BMC Bioinformatics, 16, 1, (2015)
  • [7] De Smith M.J., Distance transforms as a new tool in spatial analysis, urban planning, and GIS, Environment and Planning B: Planning and Design, 31, 1, pp. 85-104, (2004)
  • [8] Qin K., Theories and Methods of Spatial Analysis in GIS, (2010)
  • [9] Deng M., Zhao B., Xu Z., Et al., Representation methods of distance between spatial objects in GIS and their analysis, Computer Engineering and Applications, 47, 1, (2011)
  • [10] Nourqolipour R., Shariff A.R., Balasundram S.K., Et al., A GIS-based model to analyze the spatial and temporal development of oil palm land use in kuala langat district, malaysia, Environmental Earth Sciences, 73, 4, pp. 1687-1700, (2015)
123