期刊文献+

基于引导采样的Kinect深度图修补算法 被引量:3

Kinect depth map retrieval based on guided-sampling
下载PDF
导出
摘要 针对Kinect采集到带有大量的结构性缺失的深度图,提出了一种基于引导采样的深度图空洞噪声修补算法。算法首先将深度图所对应的彩色图片转换为灰度图,然后用K-means算法将彩色图转换而来的灰度图进行聚类处理,将生成的聚类图作为引导图。联合引导图对深度图空洞噪声边缘深度值采样,采集多个深度值并计算深度均值,最后使用深度均值来作为空洞的深度估计值。通过与基于蒙特卡罗不确定度评价的深度图修补算法(MC-UE)相比较,由于有引导图的矫正作用,边缘细节更加清晰准确。对于处理较小面积的空洞噪声,处理结果相较于MC-UE算法,均方误差降低4%左右。对于处理较大面积的空洞噪声,均方误差较MC-UE算法降低了9.65%~14.32%。实验证明引导采样算法在处理较大面积空洞噪声时相较于MC-UE算法有更低的均方误差。 Focusing on the depth map with large amount of structural defects collected by Kinect, this paper proposed an algorithm for patching noises in the hole of the depth map based on the guiding sample. Based on this algorithm, it converted the color picture corresponding to the depth map to grey-scale map at first, which was then treated using clustering processing with the K-means algorithm, making the clustering picture produced as the guiding map. Combining the guiding map, it sampled depth values of the noise edge in the hole of the depth map, the mean value of which was then calculated and was used finally as the estimated depth value of the holes. Through comparison with the depth map patching algorithm based on the Monte Carlo uncertainty evaluation(MC-UE), the edge details are clearer and more accurate due to the corrective effect of the guiding map. For the noises in the hole with fairly small area, the treatment of which leads to a decrease of the mean squared error by nearly 4 % compared to that by MC-UE algorithm. While for the noises in the hole with large area, the treatment of which results in a decrease of the mean squared error by 9.65 %-14.32 % compared to that by MC-UE algorithm. Ths experiments demonstrate that the guiding sample algorithm contributes to lower mean squared error in the treatment of the noises in the hole with large area than that by MC-UE algorithm.
作者 杨厚易 刘满禄 张华 Yang Houyi;Liu Manlu;Zhang Hua(Sichuan Key Laboratory of Special Environment,College of Information Engineering,Southwest University of Science & Technology,Mianyang Sichuan 621010,China;School of Information Science & Technology,University of Science & Technology of China,Hefei 230026,China)
出处 《计算机应用研究》 CSCD 北大核心 2018年第8期2532-2534,共3页 Application Research of Computers
基金 国家"十三五"核能开发科研项目([2016]1295) 四川省科技支撑计划资助项目(2015FZ0091)
关键词 深度图 空洞噪声 聚类 噪声修补 均方误差 depth map structural defects cluster noise patching mean square error
  • 相关文献

参考文献2

二级参考文献28

  • 1国家质量技术监督局计量司.测量不确定度评定与表示指南[M].北京:中国计量出版社,2005.
  • 2DELLART F, SEITZ S, THORPE C, et al. Structure from motion without correspondence [ C ]//Proc of IEEE Computer Society Confe- rence on Computer Vision and Pattern Recognition. 2000:557-564.
  • 3SE1TZ S M, CURLESS B, D1EBEL J, e! al. A comparison and eva- luation of muhi-view stereo reconstrnetion algorithms [ C ]//Proe of IEEE Conference on Computer Vision and Pattern Recognition. 2006: 519-526.
  • 4Introducing Kinect lbr Xhox 360[ EB/OL]. ( 2012 ) [ 2012-08- I0 ]. http ://www. xbox. conv/t:n-US/kinect.
  • 5PMD:vision] CamCube3.0[EB/OL]. (2012) [2012-08-10].ht- tp://www, pmdtec, conr/produets-services/pmdvisionr-cameras/pmd- visionr-camcube- 30/.
  • 6NEWCOMBE R, DAVISION A, IZAD1 S. KinectFusion: real-time dense surface mapping and tracking[ C ]//Proc of IEEE/ACM Inter- national Symposium on Mixed and Augmented Reality. 2011: 127- 136.
  • 7KONOLIGE K, MIHELICH P. Technical descriplion of Kinecl cali- bration [ EB/OL]. ( 2011 ) [ 2012-08- 10 ]. http ://www. ros. org/wi- ki/kinect_calibration/technical.
  • 8TOMASI C, MANDUCHI R. Bilateral filtering for gray and color ima- ges[ C ]//Proc of the 6th International Conference on Computer Vi- sion. 1998:839-846.
  • 9KOPF J, COHEN M F, LISCHINSKI D, et al. Joint bilateral upsam- piing[ J ]. ACM Trans on Graphics ,2007,26 ( 3 ) :96.
  • 10ZHAO Z S, FENG X, TENG S H, et al. Multiscale point correspondence using feature distribution and frequency domain alignment[J]. Mathematical Problems in Engineering, 2012, 2012(3): 295-308.

共引文献47

同被引文献42

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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