الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 77 |  |  |
| | | from | 77 | | |
Abstract
Semantic segmentation of Light Detection and Ranging (LiDAR) is a task that requires high efficiency and accuracy. To our knowledge, this work is the first to apply model soups to the LiDAR semantic segmentation task, showing their potential impact on the domain. Our contributions to this work are twofold. First, we successfully extend the application of model soups to LiDAR semantic segmentation. Second, we introduce optimized and efficient versions of the existing greedy soup Algorithm, further enhancing the overall performance of the approach. In our method, we augment the state-of-the-art open-source code for 2DPASS semantic segmentation with our technique, retaining the original model structure and ensuring no increase in prediction time. The efficiency of our approach is demonstrated using the mean intersection over union (mIoU) as the primary evaluation metric. Our experiments on the SemanticKITTI and NuScenes datasets demonstrate significant improvements. Specifically, we achieve a higher mIoU without any increase in prediction time. Our results, through comprehensive experiments and rigorous evaluations, open up new possibilities for enhanced perception systems in autonomous driving and related fields, highlighting the significance of our iterative uniform greedy model soup in advancing LiDAR semantic segmentation.