File size: 917 Bytes
88b0dcb |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 |
# Post-Processing
## Step
1. Simplify polygon by [DP algorithm](https://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm)
![img.png](src/fig/post_processing/img_0.png)
2. Detect occlusion, calculating box fill with 1
![img.png](src/fig/post_processing/img_1.png)
3. Fill in reasonable sampling section
![img.png](src/fig/post_processing/img_2.png)
4. Output processed polygon
![img.png](src/fig/post_processing/img_3.png)
## performance
It works, and a performance comparison on the MatterportLayout dataset:
| Method | 2D IoU(%) | 3D IoU(%) | RMSE | $\mathbf{\delta_{1}}$ |
|--|--|--|--|--|
without post-proc | 83.52 | 81.11 | 0.204 | 0.951 |
original post-proc |83.12 | 80.71 | 0.230 | 0.936|\
optimized post-proc | 83.48 | 81.08| 0.214 | 0.940 |
original:
![img.png](src/fig/post_processing/original.png)
optimized:
![img.png](src/fig/post_processing/optimized.png)
|