Patch match filter: Efficient edge-aware filtering meets randomized search for fast correspondence field estimation

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

Volumn , Issue , 2013, Pages 1854-1861

  Lu, Jiangbo ^a   Yang, Hongsheng ^a   Min, Dongbo ^a   Do, Minh N ^b  

^a Advanced Digital Science Center   (Singapore)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

cost volume filtering; edge aware image filtering; nearest neighbor search; optical flow; PatchMatch; stereo

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; COMPUTATIONAL FRAMEWORK; DENSE CORRESPONDENCES; IMAGE FILTERING; NEAREST NEIGHBOR SEARCH; OPTICAL FLOW ESTIMATION; PATCHMATCH; STEREO;

COSTS; ESTIMATION; OPTICAL FLOWS; PATTERN RECOGNITION; PROBLEM SOLVING;

PIXELS;

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

References (22)

1. http://vision. middlebury. edu/flow/. 2, 6, 7
2. http://vision. middlebury. edu/stereo/. 6
3. R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Süsstrunk. SLIC superpixels compared to state-of-the-art superpixel methods. IEEE Trans. PAMI, 34(11), 2012. 3
4. C. Barnes, E. Shechtman, A. Finkelstein, and D. B. Goldman. PatchMatch: A randomized correspondence algorithm for structural image editing. In Proc. of ACM SIGGRAGH, 2009. 1, 2, 3, 4, 5, 8
5. C. Barnes, E. Shechtman, D. B. Goldman, and A. Finkelstein. The generalized PatchMatch correspondence algorithm. In Proc. of ECCV, 2010. 1, 2
6. F. Besse, C. Rother, A. Fitzgibbon, and J. Kautz. PMBP: Patchmatch belief propagation for correspondence field estimation. In Proc. of BMVC, 2012. 2, 7
7. M. Bleyer, C. Rhemann, and C. Rother. Patchmatch stereo-Stereo matching with slanted support windows. In Proc. of BMVC, 2011. 2, 3, 5, 6, 7
8. P. Felzenszwalb and D. Huttenlocher. Efficient graph-based image segmentation. IJCV, 59(2):167-181, 2004. 3
9. K. He and J. Sun. Computing nearest-neighbor fields via propagation-assisted KD-trees. In CVPR, 2012. 1, 2, 8
10. K. He, J. Sun, and X. Tang. Guided image filtering. In Proc. of ECCV, 2010. 2, 3, 5, 6
11. S. Korman and S. Avidan. Coherency sensitive hashing. In Proc. of ICCV, 2011. 1, 2
12. C. Lei and Y.-H. Yang. Optical flow estimation on coarseto-fine region-trees using discrete optimization. In Proc. of ICCV, 2009. 4, 8
13. C. Liu, J. Yuen, and A. Torralba. SIFT flow: Dense correspondence across scenes and its applications. IEEE Trans. Pattern Anal. Mach. Intell., 33(5), 2011. 1
14. J. Lu, K. Shi, D. Min, L. Lin, and M. N. Do. Cross-based local multipoint filtering. In CVPR, 2012. 1, 2, 3, 5, 6
15. D. Min, J. Lu, and M. N. Do. A revisit to cost aggregation in stereo matching: How far can we reduce its computational redundancy? In Proc. of ICCV, 2011. 2, 7
16. S. Paris, P. Kornprobst, J. Tumblin, and F. Durand. Bilateral filtering: Theory and applications. Foundations and Trends in Comp. Graphics and Vision, 4(1):1-73, 2008. 2, 3
17. C. Rhemann, A. Hosni, M. Bleyer, C. Rother, and M. Gelautz. Fast cost-volume filtering for visual correspondence and beyond. In CVPR, 2011. 1, 2, 3, 4, 5, 6, 7, 8
18. R. Szeliski and et al. A comparative study of energy minimization methods for Markov Random Fields with smoothness-based priors. IEEE TPAMI, 2008. 1, 2, 3
19. C. Tomasi and R. Manduchi. Bilateral filtering for gray and color images. In Proc. of ICCV, 1998. 2, 3
20. L. Xu, J. Jia, and Y. Matsushita. Motion detail preserving optical flow estimation. IEEE Trans. PAMI, 2012. 5, 7, 8
21. K. Yoon and I. Kweon. Adaptive support-weight approach for correspondence search. IEEE Trans. PAMI, 2006. 2
22. C. L. Zitnick and S. B. Kang. Stereo for image-based rendering using image over-segmentation. IJCV, 2007. 4