iccv iccv2013 iccv2013-101 iccv2013-101-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Yaron Eshet, Simon Korman, Eyal Ofek, Shai Avidan
Abstract: We extend patch based methods to work on patches in 3D space. We start with Coherency Sensitive Hashing [12] (CSH), which is an algorithm for matching patches between two RGB images, and extend it to work with RGBD images. This is done by warping all 3D patches to a common virtual plane in which CSH is performed. To avoid noise due to warping of patches of various normals and depths, we estimate a group of dominant planes and compute CSH on each plane separately, before merging the matching patches. The result is DCSH - an algorithm that matches world (3D) patches in order to guide the search for image plane matches. An independent contribution is an extension of CSH, which we term Social-CSH. It allows a major speedup of the k nearest neighbor (kNN) version of CSH - its runtime growing linearly, rather than quadratically, in k. Social-CSH is used as a subcomponent of DCSH when many NNs are required, as in the case of image denoising. We show the benefits ofusing depth information to image reconstruction and image denoising, demonstrated on several RGBD images.
[1] DCSH webpage. www . eng .t au . ac . i / ˜s imonk / l DCSH.
[2] A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, 2006.
[3] S. Arya, D. M. Mount, Na. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45(6), November 1998.
[4] C. Barnes, E. Shechtman, A. Finkelstein, and D. Goldman. Patchmatch: a randomized correspondence algorithm for structural image editing. ACM TOG, 28(3), 2009.
[5] C. Barnes, E. Shechtman, D. Goldman, and A. Finkelstein. The generalized patchmatch correspondence algorithm. ECCV, 2010.
[6] G. Ben-Artzi, H. Hel-Or, and Y. Hel-Or. The gray-code filter kernels. In PAMI, 2007.
[7] A. Buades, B. Coll, and J.M. Morel. A non-local algorithm for image denoising. In CVPR, 2005.
[8] A. Buades, B. Coll, and J.M. Morel. Self-similarity-based image denoising. Comm. of the ACM, 54(5), 2011.
[9] K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian. Image
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18] 96 denoising by sparse 3-d transform-domain collaborative filtering. Image Processing, 16(8), 2007. Y. HaCohen, E. Shechtman, D.B. Goldman, and D. Lischinski. Non-rigid dense correspondence with applications for image enhancement. ACM TOG, 30(4), 2011. K. He and J. Sun. Computing nearest-neighbor fields via propagation-assisted kd-trees. In CVPR, 2012. S. Korman and S. Avidan. Coherency sensitive hashing. In ICCV, 2011. A. Levin, B. Nadler, F. Durand, and W. T. Freeman. Patch complexity, finite pixel correlations and optimal denoising. In ECCV (5), 2012. D.G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 60(2), 2004. I. Olonetsky and S. Avidan. Treecann-kd tree coherence approximate nearest neighbor algorithm. ECCV, 2012. J. Park, H. Kim, Y. Tai, M. S. Brown, and I. Kweon. High quality depth map upsampling for 3d-tof cameras. In ICCV, 2011. L. Zhang, S. Vaddadi, H. Jin, and S. K. Nayar. Multiple view image denoising. In CVPR, 2009. M. Zontak and M. Irani. Internal statistics of a single natural image. In CVPR, 2011.