Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
暂无分享,去创建一个
Jian Sun | Kaiming He | Kaiming He | Jian Sun
[1] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.
[2] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.
[3] Sunil Arya,et al. Algorithms for fast vector quantization , 1993, [Proceedings] DCC `93: Data Compression Conference.
[4] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[5] Alexei A. Efros,et al. Texture synthesis by non-parametric sampling , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[6] Marc Levoy,et al. Fast texture synthesis using tree-structured vector quantization , 2000, SIGGRAPH.
[7] David Salesin,et al. Image Analogies , 2001, SIGGRAPH.
[8] E. Shechtman,et al. Transactions on Pattern Analysis and Machine Intelligence 1 Space-time Video Completion Draft Transactions on Pattern Analysis and Machine Intelligence 2 , 2022 .
[9] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[10] Yacov Hel-Or,et al. Real-Time Pattern Matching Using Projection Kernels , 2005, IEEE Trans. Pattern Anal. Mach. Intell..
[11] Pietro Perona,et al. A Bayesian hierarchical model for learning natural scene categories , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[12] Jean-Michel Morel,et al. A non-local algorithm for image denoising , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[13] Yacov Hel-Or,et al. Real-time pattern matching using projection kernels , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[14] Alessandro Foi,et al. Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering , 2007, IEEE Transactions on Image Processing.
[15] Eli Shechtman,et al. Matching Local Self-Similarities across Images and Videos , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[16] Yacov Hel-Or,et al. The Gray-Code Filter Kernels , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[17] Sanjoy Dasgupta,et al. Random projection trees and low dimensional manifolds , 2008, STOC.
[18] Richard I. Hartley,et al. Optimised KD-trees for fast image descriptor matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[19] Denis Simakov,et al. Summarizing visual data using bidirectional similarity , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[20] Shree K. Nayar,et al. What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images? , 2008, ECCV.
[21] Adam Finkelstein,et al. PatchMatch: a randomized correspondence algorithm for structural image editing , 2009, SIGGRAPH 2009.
[22] David G. Lowe,et al. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.
[23] Michal Irani,et al. Super-resolution from a single image , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[24] Adam Finkelstein,et al. The Generalized PatchMatch Correspondence Algorithm , 2010, ECCV.
[25] Andrea Vedaldi,et al. Vlfeat: an open and portable library of computer vision algorithms , 2010, ACM Multimedia.
[26] Jian Sun,et al. A global sampling method for alpha matting , 2011, CVPR 2011.
[27] Shai Avidan,et al. Coherency Sensitive Hashing , 2016, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[28] Carsten Rother,et al. PatchMatch Stereo - Stereo Matching with Slanted Support Windows , 2011, BMVC.
[29] Dani Lischinski,et al. Non-rigid dense correspondence with applications for image enhancement , 2011, ACM Trans. Graph..