Texture-guided depth upsampling using Bregman split: a clustering graph-based approach

被引:3
作者
Altantawy, Doaa A. [1 ]
Saleh, Ahmed I. [2 ]
Kishk, Sherif S. [1 ]
机构
[1] Mansoura Univ, Fac Engn, Elect & Commun Engn Dept, 60 El Gomhoria St, Mansoura, Egypt
[2] Mansoura Univ, Comp Engn & Syst Dept, Fac Engn, 60 El Gomhoria St, Mansoura, Egypt
关键词
Structured sparsity; Low-rank prior; Texture guidance; Joint dictionary learning; Depth upsampling; Incoherence self-learning; SPARSE; SUPERRESOLUTION; COLOR; RECOVERY;
D O I
10.1007/s00371-018-1611-x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Recently, RGB-D sensors have gained significant popularity due to their affordable cost. Compared to their associated high-resolution (HR) color images, their depth maps counterparts are typically with lower resolution. In addition, the quality of those maps is still inadequate for further applications due to the existing holes, noises and artifacts. In this paper, we propose a clustering graph-based framework for depth map super-resolution. This framework uses the guidance of HR textured-intensity layer to support and compel high-frequency details in the depth map recovery process. This textured layer is extracted from the consolidated HR intensity image in a texture-structure separation process via a new relative total variation technique. Furthermore, instead of the standard sparse representation that does not consider the local structural information effectively, we propose a novel clustered-graph sparse representation with a low-rank prior. With this joint representation, any signal can be coded effectively, as the low-rank property reveals the global structure information while the intrinsic information is kept by a novel multiclass incoherence self-learning between classes. At the same time, a grouped coherence within each class dictionary is preserved. We optimize that joint objective function using state-of-the-art split Bregman algorithm. Experimental results on Middleburry 2005, 2007, 2014 and real-world datasets demonstrate that the proposed algorithm is very efficient and outperforms the state-of-the-art approaches in terms of objective and subjective quality.
引用
收藏
页码:333 / 359
页数:27
相关论文
共 56 条
[1]  
Al Ismaeil Kassem, 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), P8, DOI 10.1109/CVPRW.2015.7301389
[2]  
[Anonymous], FOUND TRENDS MACH LE
[3]  
[Anonymous], 2012, INT C INT MULT COMP
[4]   Tree Filtering: Efficient Structure-Preserving Smoothing With a Minimum Spanning Tree [J].
Bao, Linchao ;
Song, Yibing ;
Yang, Qingxiong ;
Yuan, Hao ;
Wang, Gang .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2014, 23 (02) :555-569
[5]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[6]   RGB-D datasets using microsoft kinect or similar sensors: a survey [J].
Cai, Ziyun ;
Han, Jungong ;
Liu, Li ;
Shao, Ling .
MULTIMEDIA TOOLS AND APPLICATIONS, 2017, 76 (03) :4313-4355
[7]   Kinect Depth Recovery Using a Color-Guided, Region-Adaptive, and Depth-Selective Framework [J].
Chen, Chongyu ;
Cai, Jianfei ;
Zheng, Jianmin ;
Cham, Tat Jen ;
Shi, Guangming .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2015, 6 (02)
[8]   Bilateral Texture Filtering [J].
Cho, Hojin ;
Lee, Hyunjoon ;
Kang, Henry ;
Lee, Seungyong .
ACM TRANSACTIONS ON GRAPHICS, 2014, 33 (04)
[9]   Sparse Representation-Based Multiple Frame Video Super-Resolution [J].
Dai, Qiqin ;
Yoo, Seunghwan ;
Kappeler, Armin ;
Katsaggelos, Aggelos K. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (02) :765-781
[10]   Optimum inpainting for depth map based on L0 total variation [J].
Ding, Kai ;
Chen, Weihai ;
Wu, Xingming .
VISUAL COMPUTER, 2014, 30 (12) :1311-1320