HAPGN: Hierarchical Attentive Pooling Graph Network for Point Cloud Segmentation

联营 计算机科学 点云 分割 图形 人工智能 数据挖掘 代表(政治) 云计算 模式识别(心理学) 理论计算机科学 政治 政治学 法学 操作系统
作者
Chaofan Chen,Shengsheng Qian,Quan Fang,Changsheng Xu
出处
期刊:IEEE Transactions on Multimedia [Institute of Electrical and Electronics Engineers]
卷期号:23: 2335-2346 被引量:68
标识
DOI:10.1109/tmm.2020.3009499
摘要

Among different 3D data representations, point cloud stands out for its efficiency and flexibility. Hence, many researchers have been involved in the point cloud analysis recently. Existing approaches for point cloud segmentation task typically suffer from two limitations: 1) They usually treat different neighbor points as equals which cannot characterize the correlation between the center point and its neighborhoods well. Moreover, different parts may have different local structures for a point cloud, but they just learn a single representation space which is not sufficient and stable. 2) They often capture hierarchical information by heuristic sampling approaches which cannot reveal the spatial relationships of points well to learn global features. To overcome these limitations, we propose a novel hierarchical attentive pooling graph network (HAPGN) which utilizes the gated graph attention network (GGAN) and hierarchical graph pooling module (HiGPool) as building blocks for point cloud segmentation. Specifically, GGAN can highlight not only the importance of different neighbor points but also the importance of different representation spaces to enhance the local feature extraction. HiGPool is a novel pooling module that can capture the spatial layouts of points to learn the hierarchical features adequately. Experimental results on the ShapeNet part dataset and S3DIS dataset show that HAPGN can achieve superior performance over the state-of-the-art segmentation approaches. Furthermore, we also combine our proposed HiGPool with some recent approaches for point cloud classification and achieve better results on the ModelNet40 dataset.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
爆米花应助ecnuzdd采纳,获得10
1秒前
1秒前
sunny完成签到,获得积分10
1秒前
爬爬发布了新的文献求助10
2秒前
细腻的甜瓜完成签到,获得积分10
3秒前
920713712发布了新的文献求助10
5秒前
四月妹妹发布了新的文献求助10
5秒前
可爱曼青应助禹无极采纳,获得10
6秒前
7秒前
朴素的天蓝完成签到,获得积分10
9秒前
Johann0124完成签到,获得积分10
9秒前
英俊的铭应助六道采纳,获得10
11秒前
阿轩发布了新的文献求助30
11秒前
青墨完成签到,获得积分20
11秒前
11秒前
一川烟草完成签到,获得积分10
13秒前
希望天下0贩的0应助sdl采纳,获得10
13秒前
852应助zhoumo采纳,获得10
16秒前
李爱国应助Zane采纳,获得10
16秒前
candice624完成签到 ,获得积分0
16秒前
16秒前
17秒前
NexusExplorer应助920713712采纳,获得10
17秒前
刘远航完成签到 ,获得积分10
17秒前
科研通AI6.2应助爬爬采纳,获得30
18秒前
科目三应助一二三只羊采纳,获得10
18秒前
xcltzh2517完成签到,获得积分10
18秒前
19秒前
20秒前
forest完成签到 ,获得积分10
20秒前
李健应助六道采纳,获得10
20秒前
20秒前
思源应助KBRS采纳,获得10
21秒前
二川烟草完成签到,获得积分10
21秒前
22秒前
Shark发布了新的文献求助10
22秒前
桐桐应助大水牛姐姐采纳,获得10
23秒前
细腻戒指发布了新的文献求助10
23秒前
23秒前
23秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Rosenblum, Global Change Biology 500
CLSI VET01S-2024 Performance Standards for Antimicrobial Disk and Dilution Susceptibility Tests for Bacteria Isolated From Animals (7th Ed) 500
DIPPR Project 801 - Full Version 380
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7767737
求助须知:如何正确求助?哪些是违规求助? 9311262
关于积分的说明 20322524
捐赠科研通 7352659
什么是DOI,文献DOI怎么找? 3315451
关于科研通互助平台的介绍 2464733
邀请新用户注册赠送积分活动 2330087