{"references": ["A. Noskov and Y. Doytsher, \"A Segmentation-based Approach for Improving the Accuracy of Polygon Data,\" GEOProcessing 2015, 2009, Portugal, pp. 69-74", "S. Filin and Y. Doytsher, \"The detection of corresponding objects in a linear-based map conflation,\" Surveying and land information systems, vol. 60(2), 2000, pp. 117-127", "V. Walter and D. Fritsch, \"Matching spatial data sets: a statistical approach,\" International Journal of Geographical Information Science (IJGIS), vol. 13 (5), 1999, pp. 445\u2013473", "X. Shu and X. Wu. \"A novel contour descriptor for 2D shape matching and its application to image retrieval\", Image and vision Computing, vol. 29.4, 2011, pp. 286-294", "S. Belongie, J. Malik, and J. Puzicha, \"Shape matching and object recognition using shape contexts,\" IEEE Trans. on Pattern Analysis and Machine Intelligence, 24(4), 2002, pp. 509-522", "E. Safra, Y. Kanza, Y. Sagiv, C. Beeri, and Y. Doytsher, \"Ad- hoc matching of vectorial road networks,\" International Journal of Geographical Information Science, iFirst, 2012, pp. 1\u201340, ISSN: 1365-8816, ISSN: 1362-3087", "B. Schmitzer and S. Christoph, \"Object segmentation by shape matching with Wasserstein modes,\" Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer Berlin Heidelberg, 2013", "T. Ma and J. Longin, \"From partial shape matching through local deformation to robust global shape similarity for object detection,\" Computer Vision and Pattern Recognition (CVPR), IEEE Conference on. IEEE, 2011, pp. 1441-1448", "X. Chen, \"Spatial relation between uncertain sets,\" International archives of Photogrammetry and remote sensing, vol. 31(B3), Vienna, 1996, pp. 105-110", "A. Bronstein, R. Kimmel, M. Mahmoudi, and G. Sapiro, \"A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching,\" International Journal of Computer Vision, vol. 89(2-3), 2010, pp. 266-286", "P. Tahmasebi, A. Hezarkhani, and M. Sahimi, \"Linking Objects of Different Spatial Data Sets by Integration and Aggregation,\" vol. 2(4), 1998, pp. 335-358", "E. Rahm and P. Bernstein, \"A survey of approaches to automatic schema matching,\" The International Journal on Very Large Data Bases (VLDB), vol. 10(4), 2001, pp. 334\u2013 350", "V. Kashyap and A. Sheth, \"Semantic and schematic similarities between database objects: a context-based approach,\" The International Journal on Very Large Data Bases (VLDB), vol. 5(4), 1996, pp. 276\u2013304", "P. Shvaiko and J. Euzenat, \"A survey of schema-based matching approaches,\" Journal on Data Semantics IV, Springer Berlin Heidelberg, 2005, pp. 146-171", "B. Amann, C. Beeri., I. Fundulaki, and M. Scholl., \"Ontology-based integration of XML Web resources,\" 1st International Semantic Web Conference (ISWC), Sardinia, Italy, June 9-12 2002, pp. 117\u2013131", "L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava, \"Approximate String Joins in a Database (Almost) for Free,\" Proceedings of the 27th International Conference on Very Large Data Bases, Italy, 2001", "L. Gravano, P. G. Ipeirotis, N. Koudas, and D. Srivastava, \"Text joins in an RDBMS for web data integration,\" Proceedings of the 12th international conference on World Wide Web. ACM, 2003", "C. Parent and S. Spaccapietra, \"Database integration: the key to data interoperability,\" Advances in Object-Oriented Data Modeling, M. P. Papazoglou, S. Spaccapietra, Z. Tari (Eds.), The MIT Press, 2000", "G. Wiederhold, \"Mediation to deal with heterogeneous data sources,\" Interoperating Geographic Information System, 1999, pp. 1\u201316", "A. Saalfeld, \"Conflation-automated map compilation,\" International Journal of Geographical Information Science (IJGIS), vol. 2 (3), 1988, pp. 217\u2013228", "M. Sester, K. Anders, and V. Walter, \"Linking Objects of Different Spatial Data Sets by Integration and Aggregation,\" GeoInformatica, vol. 2(4), 1998, pp. 335-358", "C. Steger, M. Ulrich, and C. Wiedemann, \"Machine vision algorithms and applications\", Weinheim: wiley-VCH, 2008, pp. 1-2", "G. Bradski and A. Kaehler, \"Learning OpenCV: Computer vision with the OpenCV library,\" O'Reilly Media, Inc, 2008", "J. Howse, \"OpenCV Computer Vision with Python,\" Packt Publishing Ltd, 2013, ISBN: 978-1-78216-392-3", "J. Shewchuk, \"Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator,\" Applied computational geometry towards geometric engineering, Springer Berlin Heidelberg, 1996, pp. 203-222", "F. Aurenhammer, \"Voronoi diagrams - a survey of a fundamental geometric data structure,\" ACM Computing Surveys (CSUR), vol. 23(3), 1991, pp. 345-405", "M. Landa, \"GRASS GIS 7.0: Interoperability improvements,\" GIS Ostrava, Jan. 2013, pp. 21-23", "R. Blazek, M. Neteler, and R. Micarelli, \"The new GRASS 5.1 vector architecture,\" Open source GIS-GRASS users conference, University of Trento, Italy, 2002", "J. Herring, \"OpenGIS Implementation Standard for Geographic information-Simple feature access-Part 1: Common architecture,\" OGC Document 4, no. 21, 2011", "I. Wilson, J.M. Ware, and J.A. Ware, \"A genetic algorithm approach to cartographic map generalisation\" Computers in Industry, vol. 52(3), 2003, pp. 291-304", "B. Gaster, L. Howes, D. Kaeli, P. Mistry, and D. Schaa, \"Heterogeneous Computing with OpenCL: Revised OpenCL1,\" Newnes, 2012"]}

Often, same polygon objects are presented in Geoinformational Systems by distinct geometries with random positional discrepancies. It makes difficult to detect correspondences between data layers containing same object or parts of objects. The suggested method allows the user to improve the accuracy of one polygon layer by another more accurate polygon dataset by defining correspondences between polygons and parts of polygon boundaries. Two main techniques are applied: triangulation and segmentation. The triangulation is used to define correspondences between whole polygons by comparing triples of polygons. The segmentation approach is applied for the remaining polygons. Existing approaches do not work well in the case of partial equality of polygon boundaries. The main idea of the segmentation algorithm in this paper is based on defining correspondent segments of polygon boundaries and further replacing polygon boundary segments of the non-accurate layer with segments of the accurate data set; segments without pairs are rectified using ground control points. The resulting data contain parts of the accurate data set polygon boundaries, whereas the remaining elements are rectified according to the replaced boundary segments. From a review implemented by specialists it might be concluded that the results are satisfactory. The developed method could be applied to various types of polygonal datasets with similar scale.