期刊文献+

面向文物稠密点云模型的压缩复原框架 被引量:1

Compression Restoration Framework for Dense Point Cloud Model of Cultural Relics
原文传递
导出
摘要 针对激光扫描仪获取的三维文物稠密点云模型在数据存储、远程传输与处理等环节导致的资源过度消耗问题,提出了一种基于贪婪算法的快速压缩与恢复框架。首先,将点云模型视为三维离散几何信号,用基于哈希函数的八叉树方法构建稠密点云的邻域约束关系。然后,计算点云邻接矩阵并构建离散拉普拉斯基对原信号进行稀疏表示,通过随机高斯矩阵对原信号进行随机采样,以完成信号压缩。最后,引入L_(0)正则化算子,采用四种经典的贪婪算法进行快速求解。用兵马俑头部点云模型和唐三彩胡人俑三维文物点云模型进行仿真测试,结果表明,本框架能完成对稠密点云模型的有效压缩和模型的快速重建。 The three-dimensional dense point cloud model of cultural relics obtained by laser scanners can easily lead to excessive consumption of resources in data storage,remote transmission,and processing.To solve this problem,the paper proposes a fast compression and recovery framework based on greedy algorithm.First,the point cloud model is regarded as a three-dimensional discrete geometric signal,and the octree method based on Hash function is used to construct the neighborhood constraint relationship for the dense point cloud.Then,the point cloud adjacency matrix is calculated and a discrete Laplacian is constructed to sparse the original signal,and the original signal is randomly sampled through a random Gaussian matrix to complete signal compression.Finally,the L_(0) regularization operator and four classical greedy algorithms are introduced to solve the problem quickly.The simulation test is carried out with the point cloud model of the terracotta warriors head and the three-dimensional cultural relic point cloud model of the Tang Sancai Huren figurines.The results show that this framework can complete the effective compression of the dense point cloud model and the rapid reconstruction of the model.
作者 寇姣姣 陈小雪 鱼跃华 海琳琦 周蓬勃 张海波 耿国华 Kou Jiaojiao;Chen Xiaoxue;Yu Yuehua;Hai Linqi;Zhou Pengbo;Zhang Haibo;Geng Guohua(School of lnformation Sciences and Technology,Northwest University,Xi'an,Shaanai 710127,China;College of Arts and Media,Beijing Normal University,Beijing 100875,China)
出处 《激光与光电子学进展》 CSCD 北大核心 2021年第22期391-397,共7页 Laser & Optoelectronics Progress
基金 国家重点研发计划(2019YFC1521103) 国家自然科学基金重点项目(61731015) 国家自然科学青年基金(61902317) 陕西省重点产业链项目(2019ZDLSF07-02) 2020年青海省重点研发与转化计划(2020-SF-140) 陕西省自然科学基金青年项目(2019JQ-166)。
关键词 机器视觉 文物数字化保护 三维稠密点云 稀疏表示 压缩感知 贪婪算法 machine vision digital protection of cultural relics three-dimensional dense point cloud sparse representation compressed sensing greedy algorithm
  • 相关文献

参考文献9

二级参考文献56

  • 1王醒策,蔡建平,武仲科,周明全.局部表面拟合的点云模型法向估计及重定向算法[J].计算机辅助设计与图形学学报,2015,27(4):614-620. 被引量:18
  • 2刘春,吴杭彬.基于真三维TIN的三维激光扫描数据压缩方法[J].武汉大学学报(信息科学版),2006,31(10):908-911. 被引量:34
  • 3孙家昶.网络并行计算[M].北京:科学出版社,1997.25-45.
  • 4Levoy M, Whitted T. The use of points as a display primitive [R]. Chapel Hill: University of North Carolina, 1985.
  • 5Kobbelt L, Botsch M. A survey of point-based techniques in computer graphics [J]. Computer & Graphics, 2004, 28(6): 801-814.
  • 6Gross M, Pfister H. Point-based graphics [M]. San Francisco: Morgan Kaufman Publisher, 2007.
  • 7Zhang C, Florncio D, Loop C. Point cloud attribute compression with graph transform [C]//Image Processing (1CIP), 2014 IEEE International Conference on. New York: 1EEE Press, 2014: 2066-2070.
  • 8Gumhold S, Kami Z, Isenburg M, et al. Predictive point cloud compression [C]//Proceedings of SIGGRAPH Sketches. New York: ACM Press, 2005: 137.
  • 9Morell V, Orts S, Cazorla M, et al. Geometric 3D point cloud compression [J]. Pattern Recognition Letters, 2014, 50: 55-62.
  • 10Chen D, Chiang Y J, Memon N. Lossless compression of point-based 3D models [J]. Proceedings of Pacific Graphics, 2005: 124-126.

共引文献45

同被引文献32

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部