检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张婧[1] 周明全[1] 耿国华[1] ZHANG Jing;ZHOU Mingquan;GENG Guohua(Engineering Research Center of National&Local Joint for Cultural Heritage Digitization,Northwest University,Xi’an 710127,China)
机构地区:[1]西北大学文化遗产数字化国家地方联合工程研究中心,西安710127
出 处:《计算机工程与应用》2020年第18期171-176,共6页Computer Engineering and Applications
基 金:国家自然科学基金重点项目(No.61731015);青岛市自主创新重大专项(No.2017-4-3-2-xcl)。
摘 要:为了实现在深度学习中能够端到端表示点云模型,提出基于八叉树和K-D树(OctKD)的点云数据表示方法。该方法将无组织的点云转换为体素空间,在体素空间对三维模型进行八叉树剖分,改进了八叉树编码方式;构建节点间的邻接关系,在GPU端并行构建八叉树;为了克服八叉树编码检索效率低的问题,采用三维K-D树索引单个三维空间点。实验结果表明该方法能够真实反映模型本身的细节特征,提高了点云模型的构造时间和检索效率。这种新的数据结构实现将点云转换为卷积神经网络可以接收的数据形式。A point cloud data representation method based on the octree tree and K-D tree is proposed to realize end to end representation point cloud model in deep learning.This method transforms the unorganized point cloud into a voxel space,and uses the octree model to divide and improves octree coding method.The adjacency relationship between nodes is constructed,and the octree is constructed in parallel on the GPU.A 3D K-D tree is used to index a single 3D spatial point in order to overcome the inefficiency of octree coding retrieval.Experimental results show that the method can truly reflect the details of the model itself and improve the construction time and retrieval efficiency of point cloud model.The new data structure transforms the point cloud into a form of data that can be received by convolutional neural network.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15