检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:寇姣姣 陈小雪 鱼跃华 海琳琦 周蓬勃[2] 张海波[1] 耿国华[1] 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)
机构地区:[1]西北大学信息科学与技术学院,陕西西安710127 [2]北京师范大学艺术与传媒学院,北京100875
出 处:《激光与光电子学进展》2021年第22期391-397,共7页Laser & Optoelectronics Progress
基 金:国家重点研发计划(2019YFC1521103);国家自然科学基金重点项目(61731015);国家自然科学青年基金(61902317);陕西省重点产业链项目(2019ZDLSF07-02);2020年青海省重点研发与转化计划(2020-SF-140);陕西省自然科学基金青年项目(2019JQ-166)。
摘 要:针对激光扫描仪获取的三维文物稠密点云模型在数据存储、远程传输与处理等环节导致的资源过度消耗问题,提出了一种基于贪婪算法的快速压缩与恢复框架。首先,将点云模型视为三维离散几何信号,用基于哈希函数的八叉树方法构建稠密点云的邻域约束关系。然后,计算点云邻接矩阵并构建离散拉普拉斯基对原信号进行稀疏表示,通过随机高斯矩阵对原信号进行随机采样,以完成信号压缩。最后,引入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.
关 键 词:机器视觉 文物数字化保护 三维稠密点云 稀疏表示 压缩感知 贪婪算法
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222