TreeCANN - k-d tree coherence approximate nearest neighbor algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7575 LNCS, Issue PART 4, 2012, Pages 602-615

  Olonetsky, Igor ^a   Avidan, Shai ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximate nearest neighbor search; patch matching

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; APPROXIMATE NEAREST NEIGHBOR SEARCH; COMPUTATIONAL LOADS; DATA SETS; DESIGN DECISIONS; EXACT ALGORITHMS; EXACT MATCHING; FAST ALGORITHMS; IMAGE PLANE; INTEGRAL IMAGES; K-D TREE; MATCHING PATCH; OPTIMAL ALGORITHM; ORDERS OF MAGNITUDE; PATCH MATCHING; PROPAGATION STEP; SEED MATCHING; SPARSE GRID; STATE-OF-THE-ART METHODS;

ALGORITHMS; COMPUTER VISION; FORESTRY; TREES (MATHEMATICS);

IMAGE MATCHING;

ALGORITHMS; FORESTRY; NEURAL NETWORKS; PATTERN RECOGNITION;

EID: 84867841903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33765-9_43     Document Type: Conference Paper

References (15)

1. Efros, A.A., Leung, T.K.: Texture synthesis by non-parametric sampling. In: ICCV, vol. 2, pp. 1033-1038 (1999)
2. Buades, A., Coll, B., Morel, J.: A non-local algorithm for image denoising. In: CVPR, vol. 2, pp. 60-65 (2005)
3. Simakov, D., Caspi, Y., Shechtman, E., Iran, M.: Summarizing visual data using bidirectional similarity. In: CVPR, pp. 1-8 (2008)
4. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching. ACM 45, 891-923 (1998)
5. Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.: PatchMatch: a randomized correspondence algorithm for structural image editing. ACM Transactions on Graphics (Proc. SIGGRAPH) 28 (2009)
6. Korman, S., Avidan, S.: Coherency sensitive hashing. In: ICCV, pp. 1607-1614 (2011)
7. Xiao, C., Liu, M., Nie, Y., Dong, Z.: Fast exact nearest patch matching for patch-based image editing and processing. IEEETrans.Vis. Comput.Graph. 17, 1122-1134 (2011)
8. Wei, L.-Y., Levoy, M.: Fast texture synthesis using tree-structured vector quantization. In: SIGGRAPH, pp. 479-488 (2000)
9. Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: VISSAPP, pp. 331-340 (2009)
10. Ashikhmin, M.: Synthesizing natural textures. In: Proc. Symposium on Interactive 3D Graphics, pp. 217-226 (2001)
11. Tong, X., Zhang, J., Liu, L., Wang, X., Guo, B., Shum, H.: Synthesis of bidirectional texture functions on arbitrary surfaces. ACM Trans. on Graphics 21, 665-672 (2002)
12. Barnes, C., Shechtman, E., Goldman, D.B., Finkelstein, A.: The Generalized Patch-Match Correspondence Algorithm. In: Daniilidis, K. (ed.) ECCV 2010, Part III. LNCS, vol. 6313, pp. 29-43. Springer, Heidelberg (2010)
13. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Symposium on Theory of Computing, pp. 604-613 (1998)
14. Kumar, N., Zhang, L., Nayar, S.: What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images? In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part II. LNCS, vol. 5303, pp. 364-378. Springer, Heidelberg (2008)
15. Mount, D. M., Arya, S.: Ann: A library for approximate nearest neighbor searching (2006), http://www.cs.umd.edu/~mount/ANN/