|
|
|
|
LEADER |
01000caa a22002652 4500 |
001 |
NLM355354160 |
003 |
DE-627 |
005 |
20240628231901.0 |
007 |
cr uuu---uuuuu |
008 |
231226s2024 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1109/TVCG.2023.3259044
|2 doi
|
028 |
5 |
2 |
|a pubmed24n1454.xml
|
035 |
|
|
|a (DE-627)NLM355354160
|
035 |
|
|
|a (NLM)37030768
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Dong, Qiujie
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Laplacian2Mesh
|b Laplacian-Based Mesh Understanding
|
264 |
|
1 |
|c 2024
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
500 |
|
|
|a Date Revised 28.06.2024
|
500 |
|
|
|a published: Print-Electronic
|
500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
520 |
|
|
|a Geometric deep learning has sparked a rising interest in computer graphics to perform shape understanding tasks, such as shape classification and semantic segmentation. When the input is a polygonal surface, one has to suffer from the irregular mesh structure. Motivated by the geometric spectral theory, we introduce Laplacian2Mesh, a novel and flexible convolutional neural network (CNN) framework for coping with irregular triangle meshes (vertices may have any valence). By mapping the input mesh surface to the multi-dimensional Laplacian-Beltrami space, Laplacian2Mesh enables one to perform shape analysis tasks directly using the mature CNNs, without the need to deal with the irregular connectivity of the mesh structure. We further define a mesh pooling operation such that the receptive field of the network can be expanded while retaining the original vertex set as well as the connections between them. Besides, we introduce a channel-wise self-attention block to learn the individual importance of feature ingredients. Laplacian2Mesh not only decouples the geometry from the irregular connectivity of the mesh structure but also better captures the global features that are central to shape classification and segmentation. Extensive tests on various datasets demonstrate the effectiveness and efficiency of Laplacian2Mesh, particularly in terms of the capability of being vulnerable to noise to fulfill various learning tasks
|
650 |
|
4 |
|a Journal Article
|
700 |
1 |
|
|a Wang, Zixiong
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Li, Manyi
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Gao, Junjie
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Chen, Shuangmin
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Shu, Zhenyu
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Xin, Shiqing
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Tu, Changhe
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Wang, Wenping
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 30(2024), 7 vom: 07. Juni, Seite 4349-4361
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
773 |
1 |
8 |
|g volume:30
|g year:2024
|g number:7
|g day:07
|g month:06
|g pages:4349-4361
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2023.3259044
|3 Volltext
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 30
|j 2024
|e 7
|b 07
|c 06
|h 4349-4361
|