Thick boundaries in binary space and their influence on nearest-neighbor search
暂无分享,去创建一个
[1] Michael I. Jordan,et al. Advances in Neural Information Processing Systems 30 , 1995 .
[2] Andrew W. Moore,et al. An Investigation of Practical Approximate Nearest Neighbor Algorithms , 2004, NIPS.
[3] David G. Lowe,et al. Shape indexing using approximate nearest-neighbour search in high-dimensional spaces , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[4] Antonio Torralba,et al. Spectral Hashing , 2008, NIPS.
[5] Svetlana Lazebnik,et al. Iterative quantization: A procrustean approach to learning binary codes , 2011, CVPR 2011.
[6] Vicki Bruce,et al. Face Recognition: From Theory to Applications , 1999 .
[7] Matthijs C. Dorst. Distinctive Image Features from Scale-Invariant Keypoints , 2011 .
[8] Vincent Lepetit,et al. BRIEF: Binary Robust Independent Elementary Features , 2010, ECCV.
[9] Christopher Hunt,et al. Notes on the OpenSURF Library , 2009 .
[10] John Langford,et al. Cover trees for nearest neighbor , 2006, ICML.
[11] Michael Isard,et al. Object retrieval with large vocabularies and fast spatial matching , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[12] Andrew Zisserman,et al. Multiple view geometry in computer visiond , 2001 .
[13] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[14] Piotr Indyk,et al. Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..
[15] Svetlana Lazebnik,et al. Locality-sensitive binary codes from shift-invariant kernels , 2009, NIPS.
[16] Trevor Darrell,et al. Learning to Hash with Binary Reconstructive Embeddings , 2009, NIPS.
[17] David Nistér,et al. Scalable Recognition with a Vocabulary Tree , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[18] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[19] Bernhard P. Wrobel,et al. Multiple View Geometry in Computer Vision , 2001 .
[20] Yasin Abbasi-Yadkori,et al. Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph , 2011, IJCAI.
[21] Sung-Hyuk Cha,et al. Nearest neighbor search using additive binary tree , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).
[22] David G. Lowe,et al. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.
[24] D. Geman,et al. Efficient Focusing and Face Detection , 1998 .
[25] Alexandr Andoni,et al. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[26] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.
[27] G LoweDavid,et al. Distinctive Image Features from Scale-Invariant Keypoints , 2004 .
[28] Geoffrey E. Hinton,et al. Semantic hashing , 2009, Int. J. Approx. Reason..
[29] Cordelia Schmid,et al. Human Detection Based on a Probabilistic Assembly of Robust Part Detectors , 2004, ECCV.
[30] Ingemar J. Cox,et al. Audio fingerprinting: nearest neighbor search in high dimensional binary spaces , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..
[31] Richard I. Hartley,et al. Optimised KD-trees for fast image descriptor matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[32] Pascal Fua,et al. LDAHash: Improved Matching with Smaller Descriptors , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[33] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[34] Gang Hua,et al. Discriminative Learning of Local Image Descriptors , 1990, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[35] Gregory Shakhnarovich,et al. Learning task-specific similarity , 2005 .
[36] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.
[37] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[38] Moses Charikar,et al. Similarity estimation techniques from rounding algorithms , 2002, STOC '02.