메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Improvement of retrieval speed and required amount of memory for geometric hashing by combining local invariants

Author keywords

[No Author keywords available]

Indexed keywords

OBJECT RECOGNITION;

EID: 84898481596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5244/C.21.103     Document Type: Conference Paper
Times cited : (18)

References (16)
  • 1
    • 0032201716 scopus 로고    scopus 로고
    • An optimal algorithm for approximate nearest neighbor searching
    • Sunil Arya, David M. Mount, Ruth Silverman, and Angela Y.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    David, M.2    Ruth Silverman, M.3    Angela, Y.W.4
  • 2
    • 33745827782 scopus 로고    scopus 로고
    • SURF: Speeded up robust features
    • May
    • Herbert Bay, Tinne Tuytelaars, and Luc Van Gool. SURF: Speeded up robust features. In LNCS (Proc. ECCV'06), volume 3951, pages 404-417, May 2006.
    • (2006) LNCS (Proc. ECCV'06) , vol.3951 , pp. 404-417
    • Bay, H.1    Tuytelaars, T.2    Van Gool, L.3
  • 3
    • 4544259509 scopus 로고    scopus 로고
    • Localitysensitive hashing scheme based on p-stable distributions
    • Mayur Datar, Piotr Indyk, Nicole Immorlica, and Vahab S. Mirrokni. Localitysensitive hashing scheme based on p-stable distributions. In Proc. 20th SCG, pages 253-262, 2004.
    • (2004) Proc. 20th SCG , pp. 253-262
    • Datar, M.1    Indyk, P.2    Immorlica, N.3    Vahab, S.M.4
  • 4
    • 80052145109 scopus 로고    scopus 로고
    • Some tradeoffs and a new algorithm for geometric hashing
    • Michael Hoffman and Michael Lindenbaum. Some tradeoffs and a new algorithm for geometric hashing. In Proc. ICPR'98, pages 1700-1704, 1998.
    • (1998) Proc. ICPR'98 , pp. 1700-1704
    • Hoffman, M.1    Lindenbaum, M.2
  • 5
    • 84898406871 scopus 로고    scopus 로고
    • http://imlab.jp/LLAH/.
  • 6
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th ACM STOC, pages 604-613, 1998.
    • (1998) Proc. 30th ACM STOC , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 7
    • 5044233274 scopus 로고    scopus 로고
    • PCA-SIFT: A more distinctive representation for local image descriptors
    • Yan Ke and Rahul Sukthankar. PCA-SIFT: A more distinctive representation for local image descriptors. In Proc. CVPR'04, volume 2, pages 506-513, 2004.
    • (2004) Proc. CVPR'04 , vol.2 , pp. 506-513
    • Ke, Y.1    Sukthankar, R.2
  • 8
    • 0024177564 scopus 로고
    • Geometric hashing: A general and efficient model-based recognition scheme
    • Yehezkel Lamdan and Haim J. Wolfson. Geometric hashing: a general and efficient model-based recognition scheme. In Proc. ICCV'88, pages 238-249, 1988.
    • (1988) Proc. ICCV'88 , pp. 238-249
    • Lamdan, Y.1    Haim, J.W.2
  • 9
    • 3042535216 scopus 로고    scopus 로고
    • Distinctive image features from scale-invariant keypoints
    • David G. Lowe. Distinctive image features from scale-invariant keypoints. Proc. ICCV'04, 60(2):91-110, 2004.
    • (2004) Proc. ICCV'04 , vol.60 , Issue.2 , pp. 91-110
    • David, G.L.1
  • 10
    • 33745530668 scopus 로고    scopus 로고
    • Use of affine invariants in locally likely arrangement hashing for camera-based document image retrieval
    • February
    • Tomohiro Nakai, Koichi Kise, and Masakazu Iwamura. Use of affine invariants in locally likely arrangement hashing for camera-based document image retrieval. In LNCS (Proc. DAS'06), volume 3872, pages 541-552, February 2006.
    • (2006) LNCS (Proc. DAS'06) , vol.3872 , pp. 541-552
    • Nakai, T.1    Kise, K.2    Iwamura, M.3
  • 11
    • 33845592987 scopus 로고    scopus 로고
    • Scalable recognition with a vocabulary tree
    • David Nist́er and Henrik Steẃenius. Scalable recognition with a vocabulary tree. In Proc. CVPR'06, volume 2, pages 2161-2168, 2006.
    • (2006) Proc. CVPR'06 , vol.2 , pp. 2161-2168
    • Nist́er, D.1    Steẃenius, H.2
  • 12
    • 0025719208 scopus 로고
    • Efficient detection of three-dimensional structural motifs in biological macromolecules by computer vision techniques
    • Ruth Nussinov and Haim J.Wolfson. Efficient detection of three-dimensional structural motifs in biological macromolecules by computer vision techniques. In Proc. Nat'l Acad. Sci. U. S. A., volume 88, pages 10495-10499, 1991.
    • (1991) Proc. Nat'l Acad. Sci. U. S. A , vol.88 , pp. 10495-10499
    • Nussinov, R.1    Haim, J.W.2
  • 13
    • 84898415630 scopus 로고
    • Using projective invariants for constant time library indexing in model based vision
    • Charles A. Rothwell, Andrew Zisserman, David A. Forsyth, and Joseph L. Mundy. Using projective invariants for constant time library indexing in model based vision. In Proc. BMVC'91, 1991.
    • (1991) Proc. BMVC'91
    • Charles, A.1    Andrew Zisserman, R.2    David, A.F.3    Joseph, L.M.4
  • 14
    • 0031139628 scopus 로고    scopus 로고
    • Local grayvalue invariants for image retrieval
    • May
    • Cordelia Schmid and Roger Mohr. Local grayvalue invariants for image retrieval. IEEE Trans. PAMI, 19(5):530-535, May 1997.
    • (1997) IEEE Trans. PAMI , vol.19 , Issue.5 , pp. 530-535
    • Schmid, C.1    Mohr, R.2
  • 15
    • 0027831232 scopus 로고
    • Robust affine invariant matching with application to line features
    • June
    • Franc C. D. Tsai. Robust affine invariant matching with application to line features. In Proc. CVPR '93, pages 393-399, June 1993.
    • (1993) Proc. CVPR , vol.93 , pp. 393-399
    • Franc, C.1    Tsai, D.2
  • 16
    • 0031247975 scopus 로고    scopus 로고
    • Geometric hashing: An overview
    • Haim J. Wolfson and Isidore Rigoutsos. Geometric hashing: an overview. IEEE Comp. Sci. and Eng., 4(4):10-21, 1997.
    • (1997) IEEE Comp. Sci. and Eng , vol.4 , Issue.4 , pp. 10-21
    • Haim, J.W.1    Rigoutsos, I.2


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