scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

An Integrated Optimization Approach for Depth Map Enhancement on Special Riemannian Manifold

18 Dec 2018-
TL;DR: A Depth map enhancement algorithm based on Riemannian Geometry that performs depth map de-noising and completion simultaneously and formulates depth map enhancement as a matrix completion problem in the product space of RiemANNian manifolds.
Abstract: Depth images captured by consumer depth sensors like ToF Cameras or Microsoft Kinect are often noisy and incomplete. Most existing methods recover missing depth values from low quality measurements using information in the corresponding color images. However, the performance of such methods is susceptible when color image is noisy or correlation between RGB-D is weak. This paper presents a depth map enhancement algorithm based on Riemannian Geometry that performs depth map de-noising and completion simultaneously. The algorithm is based on the observation that similar RGB-D patches lie in a very low-dimensional subspace over the Riemannian quotient manifold of varying-rank matrices. The similar RGB-D patches are assembled into a matrix and optimization is performed on the search space of this quotient manifold with Kronecker product trace norm penalty. The proposed convex optimization problem on a special quotient manifold essentially captures the underlying structure in the color and depth patches. This enables robust depth refinement against noise or weak correlation between RGB-D data. This non-Euclidean approach with Kronecker product trace-norm constraints and cones in the non-linear matrix spaces provide a proper geometric framework to perform optimization. This formulates depth map enhancement as a matrix completion problem in the product space of Riemannian manifolds. This Riemannian submersion automatically handles ranks that change over matrices, and ensures guaranteed convergence over constructed manifold. The experiments on public benchmarks RGB-D images show that proposed method can effectively enhance depth maps.
Citations
More filters
Book ChapterDOI
01 Jan 1995
TL;DR: In this paper, the authors consider some basic facts about the differential calculus for operators and show that the main strategy encompasses the following: (i) linearization, and (ii) higher derivatives correspond to multilinearization.
Abstract: In this chapter let us consider some basic facts about the differential calculus for operators. The main strategy encompasses the following: (i) Differentiation means linearization. (ii) Higher derivatives correspond to multilinearization.

105 citations

Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper proposed a divide-and-conquer strategy to synthesize a high resolution depth image from a low-resolution range image under the guidance of a registered high-resolution color image.
Abstract: Constrained by current sensing technology, depth camera only acquires a low-resolution depth image that does not meet actual requirements. To solve this problem, this paper take a divide-and-conquer strategy to synthesize a high-resolution depth image from a low-resolution range image under the guidance of a registered high-resolution color image. Initially, the depth image is divided into planar areas and edge regions. For different zones, we exploit different methods to interpolate the missing depths. At planar area, the linear interpolation method is employed to perform upsampling. At edge region, a segmentation-separation upsampling method is used to interpolate the missing values. Then the upsampling result are refined on the Depth CNN that is built in this paper. We conduct extensive experiments on the benchmark database and real world data with various upsampling rates to illustrate the upsampling ability of our method. The comparison with classical super-resolution algorithms demonstrates that our upsampling algorithm achieves the best quality with fewer artifacts and our depth CNN outperforms the most state-of-the-art methods in terms of qualitative and quantitative evaluations.
Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper proposed a divide-and-conquer strategy to synthesize a high resolution depth image from a low-resolution range image under the guidance of a registered high-resolution color image.
Abstract: Constrained by current sensing technology, depth camera only acquires a low-resolution depth image that does not meet actual requirements. To solve this problem, this paper take a divide-and-conquer strategy to synthesize a high-resolution depth image from a low-resolution range image under the guidance of a registered high-resolution color image. Initially, the depth image is divided into planar areas and edge regions. For different zones, we exploit different methods to interpolate the missing depths. At planar area, the linear interpolation method is employed to perform upsampling. At edge region, a segmentation-separation upsampling method is used to interpolate the missing values. Then the upsampling result are refined on the Depth CNN that is built in this paper. We conduct extensive experiments on the benchmark database and real world data with various upsampling rates to illustrate the upsampling ability of our method. The comparison with classical super-resolution algorithms demonstrates that our upsampling algorithm achieves the best quality with fewer artifacts and our depth CNN outperforms the most state-of-the-art methods in terms of qualitative and quantitative evaluations.
References
More filters
Proceedings ArticleDOI
20 Jun 2005
TL;DR: A new measure, the method noise, is proposed, to evaluate and compare the performance of digital image denoising methods, and a new algorithm, the nonlocal means (NL-means), based on a nonlocal averaging of all pixels in the image is proposed.
Abstract: We propose a new measure, the method noise, to evaluate and compare the performance of digital image denoising methods. We first compute and analyze this method noise for a wide class of denoising algorithms, namely the local smoothing filters. Second, we propose a new algorithm, the nonlocal means (NL-means), based on a nonlocal averaging of all pixels in the image. Finally, we present some experiments comparing the NL-means algorithm and the local smoothing filters.

6,804 citations

Journal ArticleDOI
TL;DR: The guided filter is a novel explicit image filter derived from a local linear model that can be used as an edge-preserving smoothing operator like the popular bilateral filter, but it has better behaviors near edges.
Abstract: In this paper, we propose a novel explicit image filter called guided filter. Derived from a local linear model, the guided filter computes the filtering output by considering the content of a guidance image, which can be the input image itself or another different image. The guided filter can be used as an edge-preserving smoothing operator like the popular bilateral filter [1], but it has better behaviors near edges. The guided filter is also a more generic concept beyond smoothing: It can transfer the structures of the guidance image to the filtering output, enabling new filtering applications like dehazing and guided feathering. Moreover, the guided filter naturally has a fast and nonapproximate linear time algorithm, regardless of the kernel size and the intensity range. Currently, it is one of the fastest edge-preserving filters. Experiments show that the guided filter is both effective and efficient in a great variety of computer vision and computer graphics applications, including edge-aware smoothing, detail enhancement, HDR compression, image matting/feathering, dehazing, joint upsampling, etc.

4,730 citations


"An Integrated Optimization Approach..." refers background or methods in this paper

  • ...The comparative analysis is performed with state-of-art depth denoising and completion algorithms: Adaptive autoregressive depth recovery (AAM) [9], Low rank matrix completion (LRMC) [8], Guided image filtering (GIF) [24], MRF depth refinement (MRFRS)[25], Patch synthesis based depth enhancement (PatchSR) [26], Joint Bilateral Filter (JBL) [33], Joint Bilateral Upsampling (JBL Up) [34], Noise-aware Filter (NA) [35], Weight Mode Filter (WM) [36], Anisotropic Diffusion (Ani....

    [...]

  • ...(a) Noisy Depth (b) BM3D + GIF [24] (c) BM3D + RCGR [32] (d) PatchSR [26] (e) LRMC [8]...

    [...]

  • ...The comparative analysis is performed with state-of-art depth denoising and completion algorithms: Adaptive autoregressive depth recovery (AAM) [9], Low rank matrix completion (LRMC) [8], Guided image filtering (GIF) [24], MRF depth refinement (MRFRS)[25], Patch synthesis based depth enhancement (PatchSR) [26], Joint Bilateral Filter (JBL) [33], Joint Bilateral Upsampling (JBL Up) [34], Noise-aware Filter (NA) [35], Weight Mode Filter (WM) [36], Anisotropic Diffusion (Ani....

    [...]

  • ...filling depth values in wide missing gaps compared to [24, 26, 32]....

    [...]

Proceedings ArticleDOI
23 Jun 2014
TL;DR: Experimental results clearly show that the proposed WNNM algorithm outperforms many state-of-the-art denoising algorithms such as BM3D in terms of both quantitative measure and visual perception quality.
Abstract: As a convex relaxation of the low rank matrix factorization problem, the nuclear norm minimization has been attracting significant research interest in recent years. The standard nuclear norm minimization regularizes each singular value equally to pursue the convexity of the objective function. However, this greatly restricts its capability and flexibility in dealing with many practical problems (e.g., denoising), where the singular values have clear physical meanings and should be treated differently. In this paper we study the weighted nuclear norm minimization (WNNM) problem, where the singular values are assigned different weights. The solutions of the WNNM problem are analyzed under different weighting conditions. We then apply the proposed WNNM algorithm to image denoising by exploiting the image nonlocal self-similarity. Experimental results clearly show that the proposed WNNM algorithm outperforms many state-of-the-art denoising algorithms such as BM3D in terms of both quantitative measure and visual perception quality.

1,876 citations


"An Integrated Optimization Approach..." refers methods in this paper

  • ...Algorithms in literature simple assemble these RGB-D patches into a matrix and enforce the fixed rank low subspace constraint to achieve denoising [11] or depth map super-resolution [12]....

    [...]

Proceedings ArticleDOI
09 May 2011
TL;DR: A large-scale, hierarchical multi-view object dataset collected using anRGB-D camera is introduced and techniques for RGB-D based object recognition and detection are introduced, demonstrating that combining color and depth information substantially improves quality of results.
Abstract: Over the last decade, the availability of public image repositories and recognition benchmarks has enabled rapid progress in visual object category and instance detection. Today we are witnessing the birth of a new generation of sensing technologies capable of providing high quality synchronized videos of both color and depth, the RGB-D (Kinect-style) camera. With its advanced sensing capabilities and the potential for mass adoption, this technology represents an opportunity to dramatically increase robotic object recognition, manipulation, navigation, and interaction capabilities. In this paper, we introduce a large-scale, hierarchical multi-view object dataset collected using an RGB-D camera. The dataset contains 300 objects organized into 51 categories and has been made publicly available to the research community so as to enable rapid progress based on this promising technology. This paper describes the dataset collection procedure and introduces techniques for RGB-D based object recognition and detection, demonstrating that combining color and depth information substantially improves quality of results.

1,462 citations


"An Integrated Optimization Approach..." refers methods in this paper

  • ...Some image inpainting based methods [6, 7] developed for Kinect recover good quality depth maps from raw RGB-D images....

    [...]

Journal ArticleDOI
TL;DR: OptimSpace as mentioned in this paper reconstructs an n? × n matrix from a uniformly random subset of its entries with probability larger than 1 - 1/n3, which is a generalization of the result of Friedman-Kahn-Szemeredi and Feige-Ofek.
Abstract: Let M be an n? × n matrix of rank r, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm, which we call OptSpace, that reconstructs M from |E| = O(rn) observed entries with relative root mean square error 1/2 RMSE ? C(?) (nr/|E|)1/2 with probability larger than 1 - 1/n3. Further, if r = O(1) and M is sufficiently unstructured, then OptSpace reconstructs it exactly from |E| = O(n log n) entries with probability larger than 1 - 1/n3. This settles (in the case of bounded rank) a question left open by Candes and Recht and improves over the guarantees for their reconstruction algorithm. The complexity of our algorithm is O(|E|r log n), which opens the way to its use for massive data sets. In the process of proving these statements, we obtain a generalization of a celebrated result by Friedman-Kahn-Szemeredi and Feige-Ofek on the spectrum of sparse random matrices.

1,195 citations