OpenStreetMap (OSM) has proven to serve as a promising free global encyclopedia of maps with an increasing popularity across different user communities and research bodies. One of the unique characteristics of OSM has been the availability of the full history of users' contributions, which can leverage our quality control mechanisms through exploiting the history of contributions. Since this aspect of contributions (i.e., historical contributions) has been neglected in the literature, this study aims at presenting a novel approach for improving the positional accuracy and completeness of the OSM road network. To do so, we present a five-stage approach based on a Voronoi diagram that leads to improving the positional accuracy and completeness of the OSM road network. In the first stage, the OSM data history file is retrieved and in the second stage, the corresponding data elements for each object in the historical versions are identified. In the third stage, data cleaning on the historical datasets is carried out in order to identify outliers and remove them accordingly. In the fourth stage, through applying the Voronoi diagram method, one representative version for each set of historical versions is extracted. In the final stage, through examining the spatial relations for each object in the history file, the topology of the target object is enhanced. As per validation, a comparison between the latest version of the OSM data and the result of our approach against a reference dataset is carried out. Given a case study in Tehran, our findings reveal that the completeness and positional precision of OSM features can be improved up to 14%. Our conclusions draw attention to the exploitation of the historical archive of the contributions in OSM as an intrinsic quality indicator.

With development of mobile devices equipped with a global positioning system, such as smartphones, large amounts of spatial information are generated. These data, which are often stored and modeled as a sequence of spatial locations over time, are called trajectory. The large amount of trajectory data has increased the cost of transferring, storing and processing such data. To overcome these problems, a number of compression algorithms have been proposed for reducing the size of trajectory data. In this paper, seven algorithms including uniform sampling, Douglas Poker, TD-TR, Opening Window, OPW-TR, TD-SB and SQUISH-E algorithms are being discussed and the advantages and disadvantages of these algorithms are investigated as well. The SQUISH-E algorithm can create a balance between the compression rate and the Synchronized Euclidean Distance error, but has a high compression rate than other compression algorithms. To solve mentioned problem, this paper proposed a method for changing the priority window of the SQUISH-E algorithm, which improves the compression rate of this algorithm. In order to evaluate the performance of the proposed method, all algorithms are implemented on six trajectories of varying complexity and compared with each other in terms of criteria such as compression rate, run-time, and concurrency Euclidean distance errors. The results of implementation of the proposed method indicate the improvement of the proposed algorithm at the compression rate, computation time, and Synchronized Euclidean Distance error. In compare to SQUISH-E algorithm, the computation time and compression rate of proposed algorithm is decreased about 130 millisecond and 0.015, respectively.

OSM is one of the most desired and recognized VGI projects. All information related to OSM data such as objects' geometry, relations, and descriptive information including all previous versions is stored in the history file. Given the ease in access and the challenges in their quality debate, the issue of the quality of spatial information produced by OSM is an attractive topic for researchers. In previous researches, the use of the data history file to improve the quality of voluntary spatial information has not been considered. Hence, the goal of this research is to present a solution for improving the quality of location precision of the linear objects through the generation of new data using the data records. In this article, to achieve this goal, a geometric approach is presented based on the Voronoi diagram and object matching methods. To evaluate the effectiveness of the proposed method, the District 6 of Tehran was selected as the study area. In order to estimate the quality, the quality of extracted dataset was compared to Dataset produced by the municipality of Tehran as a reference dataset. According to the results obtained from this comparison, it was found that the completeness and positional accuracy of OSM features is improved by about 9.03% and 8.88%, respectively.