Computing nearest-neighbor fields via Propagation-Assisted KD-Trees

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2012, Pages 111-118

  He, Kaiming ^a   Sun, Jian ^a  

^a MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; K-D TREE; MATCHING PATCH; NEAREST NEIGHBOR SEARCH; NEAREST-NEIGHBORS; PUBLIC DATA; RUNNING TIME; SEARCH METHOD; SENSITIVE HASHING; STATE-OF-THE-ART METHODS; TREE METHOD; TREE NODES;

COMPUTER VISION; IMAGE MATCHING;

FORESTRY;

EXPERIMENTATION; FORESTRY; IMAGE ANALYSIS; MATHEMATICS; TREES;

EID: 84866668394     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2012.6247665     Document Type: Conference Paper

References (31)

1. ANN library. www.cs.umd.edu/~mount/ANN/.
2. S. Arya and D. M. Mount. Algorithms for fast vector quantization. In Proc. DCC '93: Data Compression Conf, pages 381-390, 1993.
3. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 1998.
4. C. Barnes, E. Shechtman, A. Finkelstein, and D. B. Goldman. Patchmatch: a randomized correspondence algorithm for structural image editing. In SIGGRAPH, 2009.
5. C. Barnes, E. Shechtman, D. B. Goldman, and A. Finkelstein. The generalized patchmatch correspondence algorithm. In ECCV, pages 29-43, 2010.
6. G. Ben-Artzi, H. Hel-Or, and Y. Hel-Or. The gray-code filter kernels. TPAMI, pages 382-393, 2007.
7. M. Bleyer, C. Rhemann, and C. Rother. Patchmatch stereo - stereo matching with slanted support windows. In BMVC, 2011.
8. A. Buades, B. Coll, and J.-M. Morel. A non-local algorithm for image denoising. In CVPR, pages 60-65, 2005.
9. CSH website. www.eng.tau.ac.il/~simonk/CSH/.
10. K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian. Image denoising by sparse 3-d transform-domain collaborative filtering. TIP, pages 2080-2095, 2007.
11. S. Dasgupta and Y. Freund. Random projection trees and low dimensional manifolds. In Proceedings of the 40th annual ACM symposium on Theory of computing, 2008.
12. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the twentieth annual symposium on Computational geometry, pages 253-262, 2004.
13. A. A. Efros and T. K. Leung. Texture synthesis by nonparametric sampling. In ICCV, page 1033, 1999.
14. L. Fei-Fei and P. Perona. A bayesian hierarchical model for learning natural scene categories. In CVPR, pages 524-531, 2005.
15. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw., pages 209-226, 1977.
16. K. Fukunaga and P. M. Narendra. A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comput., pages 750-753, 1975.
17. D. Glasner, S. Bagon, and M. Irani. Super-resolution from a single image. In ICCV, 2009.
18. Y. HaCohen, E. Shechtman, D. B. Goldman, and D. Lischinski. Non-rigid dense correspondence with applications for image enhancement. In SIGGRAPH, 2011.
19. K. He, C. Rhemann, C. Rother, X. Tang, and J. Sun. A global sampling method for alpha matting. In CVPR, pages 2049-2056, 2011.
20. Y. Hel-Or and H. Hel-Or. Real time pattern matching using projection kernels. In ICCV, pages 1430-1445, 2003.
21. A. Hertzmann, C. E. Jacobs, N. Oliver, B. Curless, and D. H. Salesin. Image analogies. In SIGGRAPH, 2001.
22. S. Korman and S. Avidan. Coherency sensitive hashing. In ICCV, 2011.
23. N. Kumar, L. Zhang, and S. Nayar. What is a good nearest neighbors algorithm for finding similar patches in images? In ECCV, pages 364-378, 2008.
24. M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In In VISAP-P International Conference on Computer Vision Theory and Applications, 2009.
25. PatchMatch website. http://gfx.cs.princeton.edu/pubs/Barnes-2009-PAR/.
26. E. Shechtman and M. Irani. Matching local self-similarities across images and videos. In CVPR, pages 1-8, 2007.
27. C. Silpa-Anan and R. Hartley. Optimised kd-trees for fast image descriptor matching. In CVPR, pages 1-8, 2008.
28. D. Simakov, Y. Caspi, E. Shechtman, and M. Irani. Summarizing visual data using bidirectional similarity. In CVPR, pages 1-8, 2008.
29. A. Vedaldi and B. Fulkerson. Vlfeat: an open and portable library of computer vision algorithms. In ACM Multimedia'10, 2010.
30. L.-Y. Wei and M. Levoy. Fast texture synthesis using treestructured vector quantization. In SIGGRAPH, 2000.
31. Y. Wexler, E. Shechtman, and M. Irani. Space-time video completion. In CVPR, pages 120-127, 2004.