IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i18p2926-d1481921.html
   My bibliography  Save this article

TSPconv-Net: Transformer and Sparse Convolution for 3D Instance Segmentation in Point Clouds

Author

Listed:
  • Xiaojuan Ning

    (Institute of Computer Science and Engineering, Xi’an University of Technology, No. 5 South of Jinhua Road, Xi’an 710048, China
    Shaanxi Key Laboratory of Network Computing and Security Technology, Xi’an 710048, China)

  • Yule Liu

    (Institute of Computer Science and Engineering, Xi’an University of Technology, No. 5 South of Jinhua Road, Xi’an 710048, China)

  • Yishu Ma

    (Institute of Computer Science and Engineering, Xi’an University of Technology, No. 5 South of Jinhua Road, Xi’an 710048, China)

  • Zhiwei Lu

    (Institute of Computer Science and Engineering, Xi’an University of Technology, No. 5 South of Jinhua Road, Xi’an 710048, China)

  • Haiyan Jin

    (Institute of Computer Science and Engineering, Xi’an University of Technology, No. 5 South of Jinhua Road, Xi’an 710048, China
    Shaanxi Key Laboratory of Network Computing and Security Technology, Xi’an 710048, China)

  • Zhenghao Shi

    (Institute of Computer Science and Engineering, Xi’an University of Technology, No. 5 South of Jinhua Road, Xi’an 710048, China
    Shaanxi Key Laboratory of Network Computing and Security Technology, Xi’an 710048, China)

  • Yinghui Wang

    (School of Artificial Intelligence and Computer Science, Jiangnan University, 1800 of Lihu Road, Wuxi 214122, China)

Abstract

Current deep learning approaches for indoor 3D instance segmentation often rely on multilayer perceptrons (MLPs) for feature extraction. However, MLPs struggle to effectively capture the complex spatial relationships inherent in 3D scene data. To address this issue, we propose a novel and efficient framework for 3D instance segmentation called TSPconv-Net. In contrast to existing methods that primarily depend on MLPs for feature extraction, our framework integrates a more robust feature extraction model comprising the offset-attention (OA) mechanism and submanifold sparse convolution (SSC). The proposed framework is an end-to-end network architecture. TSPconv-Net consists of a backbone network followed by a bounding box module. Specifically, the backbone network utilizes the OA mechanism to extract global features and employs SSC for local feature extraction. The bounding box module then conducts instance segmentation based on the extracted features. Experimental results demonstrate that our approach outperforms existing work on the S3DIS dataset while maintaining computational efficiency. TSPconv-Net achieves 68.6% mPrec, 52.5% mRec, and 60.1% mAP on the test set, surpassing 3D-BoNet by 3.0% mPrec, 5.4% mRec, and 2.6% mAP. Furthermore, it demonstrates high efficiency, completing computations in just 326 s.

Suggested Citation

  • Xiaojuan Ning & Yule Liu & Yishu Ma & Zhiwei Lu & Haiyan Jin & Zhenghao Shi & Yinghui Wang, 2024. "TSPconv-Net: Transformer and Sparse Convolution for 3D Instance Segmentation in Point Clouds," Mathematics, MDPI, vol. 12(18), pages 1-15, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2926-:d:1481921
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/18/2926/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/18/2926/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. H. W. Kuhn, 1956. "Variants of the hungarian method for assignment problems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(4), pages 253-258, December.
    2. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ekta Jain & Kalpana Dahiya & Vanita Verma, 2020. "A priority based unbalanced time minimization assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 13-45, March.
    2. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
    3. Ivan Belik & Kurt Jornsten, 2018. "Critical objective function values in linear sum assignment problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 842-852, April.
    4. Amnon Rosenmann, 2022. "Computing the sequence of k-cardinality assignments," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1265-1283, September.
    5. Weiqiang Shen & Chuanlin Zhang & Xiaona Zhang & Jinglun Shi, 2019. "A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
    6. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2024. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," CESifo Working Paper Series 11120, CESifo.
    7. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    8. Weihua Yang & Xu Zhang & Xia Wang, 2024. "The Wasserstein Metric between a Discrete Probability Measure and a Continuous One," Mathematics, MDPI, vol. 12(15), pages 1-13, July.
    9. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    10. Nisse, Nicolas & Salch, Alexandre & Weber, Valentin, 2023. "Recovery of disrupted airline operations using k-maximum matching in graphs," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1061-1072.
    11. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    12. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    13. Omar Zatarain & Jesse Yoe Rumbo-Morales & Silvia Ramos-Cabral & Gerardo Ortíz-Torres & Felipe d. J. Sorcia-Vázquez & Iván Guillén-Escamilla & Juan Carlos Mixteco-Sánchez, 2023. "A Method for Perception and Assessment of Semantic Textual Similarities in English," Mathematics, MDPI, vol. 11(12), pages 1-20, June.
    14. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    15. Winker, Peter, 2023. "Visualizing Topic Uncertainty in Topic Modelling," VfS Annual Conference 2023 (Regensburg): Growth and the "sociale Frage" 277584, Verein für Socialpolitik / German Economic Association.
    16. Robert M. Curry & Joseph Foraker & Gary Lazzaro & David M. Ruth, 2024. "Practice Summary: Optimal Student Group Reassignment at U.S. Naval Academy," Interfaces, INFORMS, vol. 54(3), pages 205-210, May.
    17. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.
    18. Delafield, Gemma & Smith, Greg S. & Day, Brett & Holland, Robert A. & Donnison, Caspar & Hastings, Astley & Taylor, Gail & Owen, Nathan & Lovett, Andrew, 2024. "Spatial context matters: Assessing how future renewable energy pathways will impact nature and society," Renewable Energy, Elsevier, vol. 220(C).
    19. Mehran Farzadmehr & Valentin Carlan & Thierry Vanelslander, 2023. "Contemporary challenges and AI solutions in port operations: applying Gale–Shapley algorithm to find best matches," Journal of Shipping and Trade, Springer, vol. 8(1), pages 1-44, December.
    20. P. Senthil Kumar & R. Jahir Hussain, 2016. "A Simple Method for Solving Fully Intuitionistic Fuzzy Real Life Assignment Problem," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 7(2), pages 39-61, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2926-:d:1481921. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.