• Search by Module
• Search by Words
• Search Projects

• Java
• Python
• JavaScript
• TypeScript
• C++
• Scala
• Blog

Project: open-solution-mapping-challenge (GitHub Link)

• open-solution-mapping-challenge-master
  • .github
    • ISSUE_TEMPLATE
      • everything-else.md
      • bug.md
  • src
    • pipeline_config.py
    • postprocessing.py
    • loaders.py
    • pipelines.py
    • augmentation.py
    • models.py
    • cocoeval.py
    • __init__.py
    • steps
      • misc.py
      • resources
        • apostrophes.json
      • postprocessing.py
      • pytorch
        • loaders.py
        • validation.py
        • architectures
          • unet.py
          • __init__.py
          • utils.py
        • models.py
        • __init__.py
        • utils.py
        • callbacks.py
      • sklearn
        • models.py
        • __init__.py
      • __init__.py
      • utils.py
      • preprocessing
        • misc.py
        • text.py
        • __init__.py
      • keras
        • loaders.py
        • models.py
        • embeddings.py
        • __init__.py
        • callbacks.py
        • architectures.py
        • contrib.py
      • base.py
    • utils.py
    • callbacks.py
    • pipeline_manager.py
    • preparation.py
    • unet_models.py
  • environment.yml
  • neptune.yaml
  • Makefile
  • PULL_REQUEST_TEMPLATE.md
  • LICENSE
  • CONTRIBUTING.md
  • notebooks
  • main.py
  • README.md
  • CODE_OF_CONDUCT.md
  • REPRODUCE_RESULTS.md
  • .gitignore

Open Solution to the Mapping Challenge Competition

More competitions :sparkler:

Check collection of public projects :gift:, where you can find multiple Kaggle competitions with code, experiments and outputs.

Poster :earth_africa:

Poster that summarizes our project is available here.

Intro

Open solution to the CrowdAI Mapping Challenge competition.

1. Check live preview of our work on public projects page: Mapping Challenge :chart_with_upwards_trend:.
2. Source code and issues are publicly available.

Results

0.943 Average Precision :rocket:

0.954 Average Recall :rocket:

No cherry-picking here, I promise :wink:. The results exceded our expectations. The output from the network is so good that not a lot of morphological shenanigans is needed. Happy days:)

Average Precision and Average Recall were calculated on stage 1 data using pycocotools. Check this blog post for average precision explanation.

Disclaimer

In this open source solution you will find references to the neptune.ai. It is free platform for community Users, which we use daily to keep track of our experiments. Please note that using neptune.ai is not necessary to proceed with this solution. You may run it as plain Python script :wink:.

Reproduce it!

Check REPRODUCE_RESULTS

Solution write-up

Pipeline diagram

Preprocessing

:heavy_check_mark: What Worked

• Overlay binary masks for each image is produced (code :computer:).
• Distances to the two closest objects are calculated creating the distance map that is used for weighing (code :computer:).
• Size masks for each image is produced (code :computer:).
• Dropped small masks on the edges (code :computer:).
• We load training and validation data in batches: using torch.utils.data.Dataset and torch.utils.data.DataLoader makes it easy and clean (code :computer:).
• Only some basic augmentations (due to speed constraints) from the imgaug package are applied to images (code :computer:).
• Image is resized before feeding it to the network. Surprisingly this worked better than cropping (code :computer: and config :bookmark_tabs:).

:heavy_multiplication_x: What didn't Work

• Ground truth masks are prepared by first eroding them per mask creating non overlapping masks and only after that the distances are calculated (code :computer:).
• Dilated small objects to increase the signal (code :computer:).
• Network is fed with random crops (code :computer: and config :bookmark_tabs:).

:thinking: What could have worked but we haven't tried it

• Ground truth masks for overlapping contours (DSB-2018 winners approach).

Network

:heavy_check_mark: What Worked

• Unet with Resnet34, Resnet101 and Resnet152 as an encoder where Resnet101 gave us the best results. This approach is explained in the TernausNetV2 paper (our code :computer: and config :bookmark_tabs:). Also take a look at our parametrizable implementation of the U-Net.

:heavy_multiplication_x: What didn't Work

• Network architecture based on dilated convolutions described in this paper.

:thinking: What could have worked but we haven't tried it

• Unet with contextual blocks explained in this paper.

Loss function

:heavy_check_mark: What Worked

• Distance weighted cross entropy explained in the famous U-Net paper (our code :computer: and config :bookmark_tabs:).
• Using linear combination of soft dice and distance weighted cross entropy (code :computer: and config :bookmark_tabs:).
• Adding component weighted by building size (smaller buildings has greater weight) to the weighted cross entropy that penalizes misclassification on pixels belonging to the small objects (code :computer:).

Weights visualization

For both weights: the darker the color the higher value.

• distance weights: high values corresponds to pixels between buildings.
• size weights: high values denotes small buildings (the smaller the building the darker the color). Note that no-building is fixed to black.

Training

:heavy_check_mark: What Worked

• Use pretrained models!
• Our multistage training procedure:
  1. train on a 50000 examples subset of the dataset with lr=0.0001 and dice_weight=0.5
  2. train on a full dataset with lr=0.0001 and dice_weight=0.5
  3. train with smaller lr=0.00001 and dice_weight=0.5
  4. increase dice weight to dice_weight=5.0 to make results smoother
• Multi-GPU training
• Use very simple augmentations

The entire configuration can be tweaked from the config file :bookmark_tabs:.

:thinking: What could have worked but we haven't tried it

• Set different learning rates to different layers.
• Use cyclic optimizers.
• Use warm start optimizers.

Postprocessing

:heavy_check_mark: What Worked

• Test time augmentation (tta). Make predictions on image rotations (90-180-270 degrees) and flips (up-down, left-right) and take geometric mean on the predictions (code :computer: and config :bookmark_tabs:).
• Simple morphological operations. At the beginning we used erosion followed by labeling and per label dilation with structure elements chosed by cross-validation. As the models got better, erosion was removed and very small dilation was the only one showing improvements (code :computer:).
• Scoring objects. In the beginning we simply used score 1.0 for every object which was a huge mistake. Changing that to average probability over the object region improved results. What improved scores even more was weighing those probabilities with the object size (code :computer:).
• Second level model. We tried Light-GBM and Random Forest trained on U-Net outputs and features calculated during postprocessing.

:heavy_multiplication_x: What didn't Work

• Test time augmentations by using colors (config :bookmark_tabs:).
• Inference on reflection-padded images was not a way to go. What worked better (but not for the very best models) was replication padding where border pixel value was replicated for all the padded regions (code :computer:).
• Conditional Random Fields. It was so slow that we didn't check it for the best models (code :computer:).

:thinking: What could have worked but we haven't tried it

• Ensembling
• Recurrent neural networks for postprocessing (instead of our current approach)

Model Weights

Model weights for the winning solution are available here

You can use those weights and run the pipeline as explained in REPRODUCE_RESULTS.

User support

There are several ways to seek help:

1. crowdai discussion.
2. You can submit an issue directly in this repo.
3. Join us on Gitter.

Contributing

1. Check CONTRIBUTING for more information.
2. Check issues to check if there is something you would like to contribute to.