Error-Correcting Output Hashing in fast similarity search

Proceedings of the 2nd International Conference on Internet Multimedia Computing and Service, ICIMCS'10

Volumn , Issue , 2010, Pages 7-10

  Yu, Zhou ^a   Cai, Deng ^a   He, Xiaofei ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Error correcting output code; Semantic hashing; Similarity search

Indexed keywords

CONVENTIONAL CLUSTERING; DATA DISTRIBUTION; DATA MINING APPLICATIONS; EMPIRICAL RESULTS; ERROR CORRECTING OUTPUT CODE; HASHING METHOD; INPUT VECTOR; KEY TECHNIQUES; LINEAR MAPPING; LINEAR REGRESSION MODELS; LINEAR SEARCH; OUT-OF-SAMPLE EXTENSION; REAL WORLD DATA; SIMILARITY SEARCH;

COMPUTATIONAL COMPLEXITY; INTERNET; REGRESSION ANALYSIS; SEMANTICS;

CLUSTERING ALGORITHMS;

EID: 79952506700     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1937728.1937730     Document Type: Conference Paper

References (20)

1. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In IEEE Symposium on Foundations of Computer Science, 2006.
2. O. Chum, J. Philbin, M. Isard, and A. Zisserman. Scalable near identical image and shot detection. In CIVR '07: Proceedings of the 6th ACM international conference on Image and video retrieval, pages 549-556, New York, NY, USA, 2007. ACM. (Pubitemid 350229671)
3. C.Silpa-Anan and R.Hartley. Optimised kd-trees for fast image descriptor matching. In IEEE Conference on Computer Vision and Pattern Recognition, 2008.
4. T. G. Dietterich and G. Bakiri. Solving multiclass learning problems via error-correcting output codes. In Journal of Artificial Intelligence Research, 1995.
5. J. Hays and A. A. Efros. Scene completion using millions of photographs. Commun. ACM, 51(10):87-94, 2008.
6. T. Joachims. Learning to classify text using support vector machines. In Kluwer, 2002.
7. J.Philbin, O.Chum, M. Isard, and A. J.Sivic. Object retrieval with large vocabularies and fast spatial matching. In Computer Vision and Pattern Recognition, 2007. CVPR '07. IEEE Conference on, 2007.
8. D. Knuth. The Art of Computer Programming. Addison-Wesley, 3rd edition edition, 1997.
9. M.MujaandD and G.Lowe. Fast approximate nearest neighbors with automatic algorithm confguration. In International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, 2009.
10. M.Raginsky and S.Lazebnik. Locality-sensitive binary codes from shift-invariant kernels. In The Neural Information Processing Systems, 2009.
11. R.O.Duda, J.W.Machanik, and R.C.Singleton. Function modeling experiments. Technical report, Stanford Research Institute, 1963.
12. R. Salakhutdinov and G. Hinton. Semantic hashing. In International Journal of Approximate Reasoning, 2009.
13. R. R. Salakhutdinov and G. E. Hinton. Learning a nonlinear embedding by preserving class neighbourhood structure. In AISTATS, 1993.
14. S.Arya, D.M.Mount, N.S.Netanyahu, R.Silverman, and A.Y.Wu. An optimal algorithm for approximate nearest neighbor searching. In Journal of ACM, 1998.
15. G. Shakhnarovich, P. A. Viola, and T. Darrell. Fast pose estimation with parameter-sensitive hashing. In Proceedings of the 9th IEEE International Conference on Computer Vision (ICCV), 2003.
16. J. Shi and J.Malik. Normalized cuts and image segmentation. In IEEE Transactions on pattern analysis and machine intelligence, 2000.
17. B. Stein, S. M. zu Eissen, and M. Potthast. Strategies for retrieving plagiarized documents. In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), 2007.
18. P. Wegner. A technique for counting ones in a binary computer. In Communications of the ACM (CACM), 1960.
19. Y. Weiss, A. B. Torralba, and R. Fergus. Spectral hashing. In Advances in Neural Information Processing Systems (NIPS), 2008.
20. D. Zhang, J. Wang, D. Cai, and J. Lu. Self-taught hashing for fast similarity search. In Proceedings of the 33rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR), 2010.