Papers › Sparse and Dense Data with CNNs: Depth Completion and Semantic Segmentation
Sparse and Dense Data with CNNs: Depth Completion and Semantic Segmentation
Maximilian Jaritz, Raoul de Charette, Emilie Wirbel, Xavier Perrotton, Fawzi Nashashibi
Convolutional neural networks are designed for dense data, but vision data is often sparse (stereo depth, point clouds, pen stroke, etc.). We present a method to handle sparse depth data with optional dense RGB, and accomplish depth completion and semantic segmentation changing only the last layer. Our proposal efficiently learns sparse features without the need of an additional validity mask. We show how to ensure network robustness to varying input sparsities. Our method even works with densities as low as 0.8% (8 layer lidar), and outperforms all published state-of-the-art on the Kitti depth completion benchmark.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
No code repository is listed for this paper in the archive or in Syntology's graph.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Depth Completion | KITTI Depth Completion | Spade-RGBsD | MAE | 235 | #9 of 16 | Archive leaderboard | report |
| Depth Completion | KITTI Depth Completion | Spade-RGBsD | RMSE | 918 | #9 of 16 | Archive leaderboard | report |
| Depth Completion | KITTI Depth Completion | Spade-RGBsD | Runtime [ms] | 70 | #9 of 16 | Archive leaderboard | report |
| Depth Completion | KITTI Depth Completion | Spade-sD | MAE | 248 | #11 of 16 | Archive leaderboard | report |
| Depth Completion | KITTI Depth Completion | Spade-sD | RMSE | 1035 | #11 of 16 | Archive leaderboard | report |
| Depth Completion | KITTI Depth Completion | Spade-sD | Runtime [ms] | 40 | #11 of 16 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections