메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1607-1614

Coherency sensitive hashing

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; HUMAN EYE; IMAGE PAIRS; IMAGE PLANE; MATCHING PATCH; PATCH MATCHING; SENSITIVE HASHING; TEXTURED REGIONS;

EID: 84856670335     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2011.6126421     Document Type: Conference Paper
Times cited : (170)

References (21)
  • 1
    • 0032201716 scopus 로고    scopus 로고
    • An optimal algorithm for approximate nearest neighbor searching
    • S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A.Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45(6):891-923, 1998.
    • (1998) Journal of the ACM , vol.45 , Issue.6 , pp. 891-923
    • Arya, S.1    Mount, D.2    Netanyahu, N.3    Silverman, R.4    Wu, A.5
  • 4
    • 70349655522 scopus 로고    scopus 로고
    • Patch Match: A randomized correspondence algorithm for structural image editing
    • C. Barnes, E. Shechtman, A. Finkelstein, and D. B. Goldman. PatchMatch: A randomized correspondence algorithm for structural image editing. In SIGGRAPH, 28(3), 2009.
    • (2009) SIGGRAPH , vol.28 , pp. 3
    • Barnes, C.1    Shechtman, E.2    Finkelstein, A.3    Goldman, D.B.4
  • 6
    • 33847386213 scopus 로고    scopus 로고
    • The gray-code filter kernels
    • G. Ben-Artzi, H. Hel-Or, and Y. Hel-Or. The gray-code filter kernels. In PAMI, pages 382-393, 2007.
    • (2007) PAMI , pp. 382-393
    • Ben-Artzi, G.1    Hel-Or, H.2    Hel-Or, Y.3
  • 7
    • 24644478715 scopus 로고    scopus 로고
    • A non-local algorithm for image denoising
    • A. Buades, B. Coll, and J. Morel. A non-local algorithm for image denoising. In CVPR, volume 2, pages 60-65, 2005.
    • (2005) CVPR , vol.2 , pp. 60-65
    • Buades, A.1    Coll, B.2    Morel, J.3
  • 9
    • 0035148826 scopus 로고    scopus 로고
    • Image quilting for texture synthesis and transfer
    • A. A. Efros and W. T. Freeman. Image quilting for texture synthesis and transfer. SIGGRAPH, pages 341-346, 2001.
    • (2001) SIGGRAPH , pp. 341-346
    • Efros, A.A.1    Freeman, W.T.2
  • 10
    • 0033285309 scopus 로고    scopus 로고
    • Texture synthesis by nonparametric sampling
    • A. A. Efros and T. K. Leung. Texture synthesis by nonparametric sampling. In ICCV, pages 1033-1038, 1999.
    • (1999) ICCV , pp. 1033-1038
    • Efros, A.A.1    Leung, T.K.2
  • 12
    • 25844493640 scopus 로고    scopus 로고
    • Real-time pattern matching using projection kernels
    • Y. Hel-Or and H. Hel-Or. Real-time pattern matching using projection kernels. In PAMI, pages 1430-1445, 2005.
    • (2005) PAMI , pp. 1430-1445
    • Hel-Or, Y.1    Hel-Or, H.2
  • 13
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: towards removing the curse of dimensionality
    • P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Symposium on Theory of Computing, pages 604-613, 1998.
    • (1998) Symposium on Theory of Computing , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 14
    • 84856643151 scopus 로고    scopus 로고
    • CSH Webpage
    • S. Korman. CSH webpage. www.eng.tau.ac.il/simonk/CSH/index.html.
    • Korman, S.1
  • 15
    • 77954004426 scopus 로고    scopus 로고
    • Graphcut textures: Image and video synthesis using graph cuts
    • V. Kwatra, A. Schdl, I. Essa, G. Turk, and A. Bobick. Graphcut textures: Image and video synthesis using graph cuts. SIGGRAPH, 22(3):277-286, 2003.
    • (2003) SIGGRAPH , vol.22 , Issue.3 , pp. 277-286
    • Kwatra, V.1    Schdl, A.2    Essa, I.3    Turk, G.4    Bobick, A.5
  • 16
    • 70349675925 scopus 로고    scopus 로고
    • Fast approximate nearest neighbors with automatic algorithm configuration
    • INSTICC Press
    • M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISSAPP, pages 331-340. INSTICC Press, 2009.
    • (2009) VISSAPP , pp. 331-340
    • Muja, M.1    Lowe, D.G.2
  • 18
    • 51949116409 scopus 로고    scopus 로고
    • Summarizing visual data using bidirectional similarity
    • IEEE
    • D. Simakov, Y. Caspi, E. Shechtman, and M. Irani. Summarizing visual data using bidirectional similarity. In CVPR, pages 1-8. IEEE, 2008.
    • (2008) CVPR , pp. 1-8
    • Simakov, D.1    Caspi, Y.2    Shechtman, E.3    Irani, M.4
  • 19
    • 77953866477 scopus 로고    scopus 로고
    • Synthesis of bidirectional texture functions on arbitrary surfaces
    • X. Tong, J. Zhang, L. Liu, X. Wang, B. Guo, and H. Shum. Synthesis of bidirectional texture functions on arbitrary surfaces. ACM Trans. on Graphics, 21(3):665-672, 2002.
    • (2002) ACM Trans. on Graphics , vol.21 , Issue.3 , pp. 665-672
    • Tong, X.1    Zhang, J.2    Liu, L.3    Wang, X.4    Guo, B.5    Shum, H.6
  • 20
    • 0034448271 scopus 로고    scopus 로고
    • Fast texture synthesis using treestructured vector quantization
    • L.-Y. Wei and M. Levoy. Fast texture synthesis using treestructured vector quantization. In SIGGRAPH, 2000.
    • (2000) SIGGRAPH
    • Wei, L.-Y.1    Levoy, M.2
  • 21
    • 33847381028 scopus 로고    scopus 로고
    • Space-time completion of video
    • Y. Wexler, E. Shechtman, and M. Irani. Space-time completion of video. PAMI, 29:463-476, 2007.
    • (2007) PAMI , vol.29 , pp. 463-476
    • Wexler, Y.1    Shechtman, E.2    Irani, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.