A data-centric unsupervised 3D mesh segmentation method


Visual Computer, vol.40, no.4, pp.2237-2249, 2024 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 40 Issue: 4
  • Publication Date: 2024
  • Doi Number: 10.1007/s00371-023-02913-y
  • Journal Name: Visual Computer
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Applied Science & Technology Source, Computer & Applied Sciences, INSPEC, zbMATH
  • Page Numbers: pp.2237-2249
  • Keywords: 3D mesh segmentation, Embedding, Geodesic distance, K-Means, Node2vec, Unsupervised learning
  • Middle East Technical University Affiliated: Yes


In this paper, a novel data-centric approach is proposed for solving the 3D mesh segmentation problem. The method uses node2vec, a semi-supervised learning algorithm, to create vector embedding representations for each node in a 3D mesh graph. This makes the mesh data more compact and easier to process which is important for reducing computation costs. K-Means clustering is then used to cluster each node according to their node embedding information. This data-centric approach is more computationally efficient than other complex models such as CNN and RNN. The main contribution of this study is the development of a data-centric AI framework that combines node2vec embedding, machine learning, and deep learning techniques. The use of cosine similarity is also adapted to compare and evaluate the trained node embedding vectors with different hyperparameters. Additionally, a new algorithm is developed to determine the optimal cluster number using geodesic distance on the 3D mesh. Overall, this approach provides competitive results compared to existing mesh segmentation methods.