Jerusalem 1840-1949 Road Extraction and Alignment

From FDHwiki
Jump to navigation Jump to search

Motivation

The creation of large digital databases on urban development is a strategic challenge, which could lead to new discoveries in urban planning, environmental sciences, sociology, economics, and in a considerable number of scientific and social fields. Digital geohistorical data can also be used and valued by cultural institutions. These historical data could also be studied to better understand and optimize the construction of new infrastructures in cities nowadays, and provide humanities scientists with accurate variables that are essential to simulate and analyze urban ecosystems. Now there are many geographic information system platforms that can be directly applied, such as QGIS, ARCGIS, etc. How to digitize and standardize geo-historical data has become the focus of research. We hope to propose a model that can associate geographic historical data with today's digital maps, analyze and study them under the same geographic information platform, same coordinate projection, and the same scale. Eventually, it can eliminate errors caused by scaling, rotation, and the deformation of the map carrier that may exist in historical data and the entire process is automated and efficient.

The scale is restricted to Jerusalem in our project. Jerusalem is one of the oldest cities in the world and is considered holy to the three major Abrahamic religions—Judaism, Christianity, and Islam. We did georeferencing among Jerusalem’s historical maps from 1840 to 1949 and the modern map from OpenStreetMap so that the overlaid maps will reveal changes over time and enable map analysis and discovery. We focused on the wall of the Old City as the morphological feature to do georeferencing because the region outside the Old City has seen many new constructions while the Old City has not great changes and the closed polygon of the wall is relatively more consistent than other features like road networks. More specifically, we used dhSegment, a historical document segmentation tool, to extract the wall of the Old City of Jerusalem and proposed an alignment algorithm exploiting the geometrical features of the wall to align the maps.

Methodology

Dataset

  • 126 historical maps of Jerusalem from 1837 to 1938.
  • Modern geographical data of Jerusalem from OpenStreetMap.

Wall Extraction

dhSegment is a generic approach for Historical Document Processing. It relies on a Convolutional Neural Network to predict pixelwise characteristics.

Figure 2: network architecture
  • Preprocessing

To make the image data fit into the neural networks and to make the old city region more dominant in the image, we cropped and scaled the original image using certain strategy to obtain our training, validation and testing set.

  • Training

For training set and validation set images, we pixel-wisely labelled them according to whether they belong to the old city with different colours. There are 25 traing images and 5 validation images now. The training parameters we used are: Learning rate: 5e-5, Batch size: 2, N_epochs: 30, Data augmentation (rotation, scaling and color): True

Figure 3: Original Image
Figure 4: Labelled Image
  • Prediction

By doing prediction on the testing set, we got the predicted old city region and naturally got the contour of it, i.e. the wall.

Figure 5: Original Image
Figure 6: Predicted Binarized Mask
  • Postprocessing

We remove the minor noises by retain the largest connected region and draw the contour of it. We put the contour on the original image and find that it generally fits well, although there are some minor deviations.

Figure 7: After removing noises and drawing contour

Wall Alignment

After obtaining the wall contour, we try to fit the wall anchor from the OpenStreetMap on it and obtain the transformation matrix. The algorithm is as follows.

  • Scaling

Firstly, we do an approximate scaling to scale the walls into nearly the same size. Since at the first stage the walls are not in the same direction, the scaling got here is not accurate enough. So after doing the rotation steps, we will scale the size again. Of course, we can do the translation, rotation, scaling many times iteratively, but here only once can get a good result.

Figure 8: An approximate scaling
  • Translation & Rotation

We traverse the point-pair set to select the reference point-pair, perform translation and rotation to obtain maximized overlapping area of the two polygons.

Figure 9: Translation and rotation

The translation and rotation step is to find the best translation and rotation angle that maximizes the overlapping area of the two walls. Since it’s computationally expensive to search the translation pixel by pixel, and the angle degree by degree, we here narrow down the search space. We limit the search space of translation by only considering the translations that can fit the key point pairs, (P_{00}, P_{01}), (P_{10}, P_{11}), (P_{20}, P_{21}), (P_{30}, P_{31}), together. Here we can also use more key points, like the centroids. For every translation, we fix the key point and rotate the wall every 5 degrees from -30 degrees to 30 degrees and calculate the overlapping area. To calculate the overlapping area, we use the FloodFill algorithm to fill the area bounded by the walls respectively and use the logical-and operation to obtain the overlapped region and then see the number of pixels that are not zero to be the area. After the iterations, we get the maximized overlapping area and the transformation matrix.

Results

Wall Extraction

For the wall extraction step, the neural network gives good predictions. But still it does not work well for some maps. For some maps, there is some concavity and convexity. This may owe to underfitting or overfitting. For some maps, the model just cannot make a prediction. This may be because our training set lacks samples that have similar features to these maps.

1875: Good Predictions
1842: Poor Predictions
1883: Good Predictions
1888: Poor Predictions
1896: Good Predictions
1876: Poor Predictions
1900: Good Predictions
1876: Poor Predictions

Wall Alignment

We plot the overlapped area ratio w.r.t the year of the map and find that the alignment results of more recent maps are better.

Figure 10: Overlapped area ratio w.r.t the year of map

We add the main road from OpenStreetMap to the wall and do alignment. The result also shows that the alignment results of more recent maps are better.

Figure 11: 1845
Figure 11: 1887
Figure 12: 1915

Project Plan and Milestones

Milestones

  • Do survey on semantic segmentation and registration algorithms, get familiar with our dataset and decide what feature to be used for alignment.
  • Preprocess the dataset.
  • Annotate the maps and use dhSegment for segmentation.
  • Design and implement the alignment algorithms.
  • Connect the processing steps and make the whole process a pipeline.

Plans

Date Task Completion
By Week 4
  • Brainstorm project ideas.
  • Prepare slides for initial project idea presentation.
By Week 6
  • Study relevant works about road extraction and alignment.
  • Use Procreate to produce road-annotated images as the training dataset.
  • Study and apply Projet JADIS to our dataset.
By Week 8
  • Filter and preprocess the dataset for training and testing.
  • Try various key point selection algorithms like SIFT and SURF.
  • Try various existing point cloud registration algorithms like ICP and TEASER-plusplus.
  • Determine to use the wall for alignment.
  • Design and develop wall alignment algorithms.
By Week 10
  • Use Procreate to produce wall-annotated images as the training dataset.
  • Train the dhSegment model from scratch and use it for wall extraction.
  • Implement the image postprocessing methods.
  • Further improve the performance of the alignment algorithm.
  • Prepare for the midterm presentation.
By Week 11
  • Produce more wall-annotated images.
  • Fine-tune the dhSegment model to get better performance.
--
By Week 12
  • Further improve the performance and robustness of the alignment algorithm to make it robust to poorly predicted data.
  • Make all the processing steps a pipeline and user-friendly.
--
By Week 13
  • Sort out the codes and push them to GitHub repository.
  • Write project report.
  • Prepare slides for final presentation.
--
By Week 14
  • Finish presentation slides and report writing.
  • Presentation rehearsal and final presentation.
--

Future Work

  • Fine tune the model for better wall segmentation performance;
  • Improve the alignment algorithm to be more robust to bad segmentation results;
  • Support road extraction and alignment. (Not sure)

Github Link

References