.png){kind=icon}
返回
Learning Joint Intensity-Depth Sparse Representations
.png){kind=icon}
OA
AI
DOI：10.1109/TIP.2014.2312645.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a method for learning overcomplete dictionaries of atoms composed of two modalities that describe a 3D scene: 1) image intensity and 2) scene depth. We propose a novel joint basis pursuit (JBP) algorithm that finds related sparse features in two modalities using conic programming and we integrate it into a two-step dictionary learning algorithm. The JBP differs from related convex algorithms because it finds joint sparsity models with different atoms and different coefficient values for intensity and depth. This is crucial for recovering generative models where the same sparse underlying causes (3D features) give rise to different signals (intensity and depth). We give a bound for recovery error of sparse coefficients obtained by JBP, and show numerically that JBP is superior to the group lasso algorithm. When applied to the Middlebury depth-intensity database, our learning algorithm converges to a set of related features, such as pairs of depth and intensity edges or image textures and depth slants. Finally, we show that JBP outperforms state of the art methods on depth inpainting for time-of-flight and Microsoft Kinect 3D data.
Keyword:
Sparse approximations
dictionary learning
hybrid image-depth sensors
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
引用论文
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation同时稀疏逼近的算法。第二部分: 凸松弛.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏Image denoising via sparse and redundant representations over learned dictionaries通过学习字典上的稀疏和冗余表示进行图像去噪
PREAI
分享收藏
查看更多内容