Stereoscopic Image Inpainting: Distinct Depth Maps and Images Inpainting

Hervieu, Alexandre; Papadakis, Nicolas; Bugeau, Aurélie; Gargallo, Pau; Caselles, Vicent

doi:10.1109/icpr.2010.997

Cited by 32 publications

(30 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unfilled-in region remains in blue. (d) Final inpainting result after filling-in the remaining blue area using the algorithm in [10]. (e), (f) Results obtained using [9].…”

Section: Inpainting Using Depth Layersmentioning

confidence: 99%

“…Notice that, due to occlusions, some parts in I 2 may have no corresponding point in I 1 and are not filled-in. To obtain a complete inpainting of image I 2 , these remaining parts are filled-in using the stereoscopic inpainting algorithm in [10].…”

Section: Stereoscopic Image Inpaintingmentioning

confidence: 99%

“…In the case of stereoscopic image inpainting, one needs to take into account depth information to produce coherent inpaintings [9,10]. In the method proposed by Wang et al [9] color and depth maps are filled-in for each image in a separate way.…”

Section: Introductionmentioning

confidence: 99%

“…The 3D coherence is obtained using an iterative process, but no convergence is ensured. The method in [10] first produces a 3D coherent filling-in of the depth maps using an energy minimization process and then inpaints the image pair simultaneously using a modified version of [4], that ensures the 3D coherence of the generated texture.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Stereoscopic image inpainting using scene geometry

Hervieux

Papadakis

Bugeau

et al. 2011

2011 IEEE International Conference on Multimedia and Expo

View full text Add to dashboard Cite

In this paper we propose an algorithm for stereoscopic image inpainting, given the inpainting mask in both images. We also assume that depth map is known in one of the images of the stereo pair, taken as reference. This image is clustered in homogeneous color regions using a mean-shift procedure. In each clustered region, depths are fitted by planes and then extended into the mask. Then we inpaint the visible parts of each extended region using a modified exemplarbased inpainting algorithm. Finally, we extend the algorithm to stereoscopic image inpainting. We display some experiments showing the performance of the proposed algorithm.

show abstract

“…Unfilled-in region remains in blue. (d) Final inpainting result after filling-in the remaining blue area using the algorithm in [10]. (e), (f) Results obtained using [9].…”

Section: Inpainting Using Depth Layersmentioning

confidence: 99%

Section: Stereoscopic Image Inpaintingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Stereoscopic image inpainting using scene geometry

Hervieux

Papadakis

Bugeau

et al. 2011

2011 IEEE International Conference on Multimedia and Expo

View full text Add to dashboard Cite

show abstract

“…Despite significant prior work in color image completion [1-3, 6, 8, 11], depth filling is by contrast scantly present within the literature [4,7,9,10,13,30] emerging as a relatively new research area posing significant challenges [12]. Although there have been many attempts to use structure-based or exemplar-based color image completion approaches for depth hole filling [1][2][3]5], particular factors such as the absence of granular texture, clear object separation and the lack of in-scene transferability of varying depth sub-regions all create notable obstacles not present in the corresponding color completion case [29].…”

Section: Introductionmentioning

confidence: 99%

Extended Patch Prioritization for Depth Filling Within Constrained Exemplar-Based RGB-D Image Completion

Atapour-Abarghouei

Breckon

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Citation for published item: etpourEerghoueiD emir nd frekonD oy F @PHIVA 9ixtended pth prioritiztion for depth (lling within onstrined exemplrEsed qfEh imge ompletionF9D in smge nlysis nd reognition X ISth snterntionl gonfereneD sgse PHIVD ¡ ovo de rzimD ortuglD tune PU!PWD PHIV Y proeedingsF D ppF QHTEQIRF veture notes in omputer sieneF @IHVVPAF Further information on publisher's website:Publisher's copyright statement:Additional information: Use policyThe full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that:• a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders.Please consult the full DRO policy for further details.Abstract. We address the problem of hole filling in depth images, obtained from either active or stereo sensing, for the purposes of depth image completion in an exemplar-based framework. Most existing exemplar-based inpainting techniques, designed for color image completion, do not perform well on depth information with object boundaries obstructed or surrounded by missing regions. In the proposed method, using both color (RGB) and depth (D) information available from a common-place RGB-D image, we explicitly modify the patch prioritization term utilized for target patch ordering to facilitate improved propagation of complex texture and linear structures within depth completion. Furthermore, the query space in the source region is constrained to increase the efficiency of the approach compared to other exemplar-driven methods. Evaluations demonstrate the efficacy of the proposed method compared to other contemporary completion techniques.

show abstract