DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vu, Thang | ko |
dc.contributor.author | Kim, Kookhoi | ko |
dc.contributor.author | Nguyen, Thanh | ko |
dc.contributor.author | Luu, Tung M. | ko |
dc.contributor.author | Kim, Junyeong | ko |
dc.contributor.author | Yoo, Chang-Dong | ko |
dc.date.accessioned | 2024-08-27T07:00:06Z | - |
dc.date.available | 2024-08-27T07:00:06Z | - |
dc.date.created | 2023-12-29 | - |
dc.date.issued | 2024-04 | - |
dc.identifier.citation | IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, v.46, no.4, pp.1 - 15 | - |
dc.identifier.issn | 0162-8828 | - |
dc.identifier.uri | http://hdl.handle.net/10203/322426 | - |
dc.description.abstract | This paper considers a network referred to as SoftGroup for accurate and scalable 3D instance segmentation. Existing state-of-the-art methods produce hard semantic predictions followed by grouping instance segmentation results. Unfortunately, errors stemming from hard decisions propagate into the grouping, resulting in poor overlap between predicted instances and ground truth and substantial false positives. To address the abovementioned problems, SoftGroup allows each point to be associated with multiple classes to mitigate the uncertainty stemming from semantic prediction. It also suppresses false positive instances by learning to categorize them as background. Regarding scalability, the existing fast methods require computational time on the order of tens of seconds on large-scale scenes, which is unsatisfactory and far from applicable for real-time. Our finding is that the -Nearest Neighbor (-NN) module, which serves as the prerequisite of grouping, introduces a computational bottleneck. SoftGroup is extended to resolve this computational bottleneck, referred to as SoftGroup++. The proposed SoftGroup++ reduces time complexity with octree -NN and reduces search space with class-aware pyramid scaling and late devoxelization. Experimental results on various indoor and outdoor datasets demonstrate the efficacy and generality of the proposed SoftGroup and SoftGroup++. Their performances surpass the best-performing baseline by a large margin (6% 16%) in terms of AP. On datasets with large-scale scenes, SoftGroup++ achieves a 6× speed boost on average compared to SoftGroup. Furthermore, SoftGroup can be extended to perform object detection and panoptic segmentation with nontrivial improvements over existing methods. | - |
dc.language | English | - |
dc.publisher | IEEE COMPUTER SOC | - |
dc.title | Scalable SoftGroup for 3D Instance Segmentation on Point Clouds | - |
dc.type | Article | - |
dc.identifier.wosid | 001180891600017 | - |
dc.identifier.scopusid | 2-s2.0-85174824270 | - |
dc.type.rims | ART | - |
dc.citation.volume | 46 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 1 | - |
dc.citation.endingpage | 15 | - |
dc.citation.publicationname | IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | - |
dc.identifier.doi | 10.1109/tpami.2023.3326189 | - |
dc.contributor.localauthor | Yoo, Chang-Dong | - |
dc.contributor.nonIdAuthor | Kim, Kookhoi | - |
dc.contributor.nonIdAuthor | Nguyen, Thanh | - |
dc.contributor.nonIdAuthor | Luu, Tung M. | - |
dc.contributor.nonIdAuthor | Kim, Junyeong | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Point clouds | - |
dc.subject.keywordAuthor | point grouping | - |
dc.subject.keywordAuthor | octree grouping | - |
dc.subject.keywordAuthor | instance segmentation | - |
dc.subject.keywordAuthor | object detection | - |
dc.subject.keywordAuthor | panoptic segmentation | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.