Querying 3D Data by Adjacency Graphs

ICVS(2015)

引用 3|浏览11
暂无评分
摘要
The need for robots to search the 3D data they have saved is becoming more apparent. We present an approach for finding structures in 3D models such as those built by robots of their environment. The method extracts geometric primitives from point cloud data. An attributed graph over these primitives forms our representation of the surface structures. Recurring substructures are found with frequent graph mining techniques. We investigate if a model invariant to changes in size and reflection using only the geometric information of and between primitives can be discriminative enough for practical use. Experiments confirm that it can be used to support queries of 3D models.
更多
查看译文
关键词
Point Cloud, Point Cloud Data, Adjacency Graph, Graph Mining, Frequent Subgraph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要