메뉴 건너뛰기




Volumn 43, Issue 1, 2010, Pages 153-159

Approximate input sensitive algorithms for point pattern matching

Author keywords

Approximation; Geometric pattern matching; Hausdorff distance; Randomization

Indexed keywords

APPROXIMATE MATCHING; APPROXIMATION; CARDINALITIES; DISTANCE FUNCTIONS; GENERAL METHOD; GEOMETRIC PATTERN MATCHING; HAUSDORFF DISTANCE; HAUSDORFF METRIC; POINT PATTERN MATCHING; POINT SET; RANDOMIZATION; RUNTIMES; SENSITIVE ALGORITHMS; SIMILARITY TRANSFORMATION;

EID: 68949097529     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2009.05.014     Document Type: Article
Times cited : (19)

References (22)
  • 2
    • 0001848776 scopus 로고    scopus 로고
    • Geometric range searching and its relatives
    • B. Chazelle, J.E. Goodman, R. Pollack Eds, Advances in Discrete and Computational Geometry
    • P. Agarwal, J. Erickson, Geometric range searching and its relatives, in: B. Chazelle, J.E. Goodman, R. Pollack (Eds.), Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol. 23, 1996, pp. 1-56.
    • (1996) Contemporary Mathematics , vol.23 , pp. 1-56
    • Agarwal, P.1    Erickson, J.2
  • 3
    • 84889707143 scopus 로고    scopus 로고
    • D. Aiger, K. Kedem, Exact and approximate geometric pattern matching for point sets in the plane under similarity transformations, in: CCCG 2007, 2007, pp. 181-184.
    • D. Aiger, K. Kedem, Exact and approximate geometric pattern matching for point sets in the plane under similarity transformations, in: CCCG 2007, 2007, pp. 181-184.
  • 4
    • 0032348702 scopus 로고    scopus 로고
    • Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
    • Akutsu T., Tamaki H., and Tokuyama T. Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. Discrete & Computational Geometry 20 3 (1998) 307-331
    • (1998) Discrete & Computational Geometry , vol.20 , Issue.3 , pp. 307-331
    • Akutsu, T.1    Tamaki, H.2    Tokuyama, T.3
  • 5
    • 0030260527 scopus 로고    scopus 로고
    • Point set pattern matching in 3-D
    • Boxer L. Point set pattern matching in 3-D. Pattern Recognition Letters 17 12 (1996) 1293-1297
    • (1996) Pattern Recognition Letters , vol.17 , Issue.12 , pp. 1293-1297
    • Boxer, L.1
  • 6
    • 0020882219 scopus 로고    scopus 로고
    • J.F. Canny, A variational approach to edge detection, in: AAAI 1983, 1983, pp. 54-58.
    • J.F. Canny, A variational approach to edge detection, in: AAAI 1983, 1983, pp. 54-58.
  • 7
    • 0039173457 scopus 로고
    • Cutting hyperplanes for divide-and-conquer
    • Chazelle B. Cutting hyperplanes for divide-and-conquer. Discrete & Computational Geometry 9 (1993) 145-158
    • (1993) Discrete & Computational Geometry , vol.9 , pp. 145-158
    • Chazelle, B.1
  • 8
    • 38149009694 scopus 로고    scopus 로고
    • Improved approximation bounds for planar point pattern matching
    • Cho M., and Mount D.M. Improved approximation bounds for planar point pattern matching. Algorithmica 50 2 (2008) 175-207
    • (2008) Algorithmica , vol.50 , Issue.2 , pp. 175-207
    • Cho, M.1    Mount, D.M.2
  • 9
    • 0032317816 scopus 로고    scopus 로고
    • Pattern matching for spatial point sets, Foundation of Computer
    • D.E. Cardoze, L.J. Schulman, Pattern matching for spatial point sets, Foundation of Computer Science (1998) 156-165.
    • (1998) Science , pp. 156-165
    • Cardoze, D.E.1    Schulman, L.J.2
  • 11
    • 0000314230 scopus 로고
    • On sets of distances of n points
    • Erdos P. On sets of distances of n points. American Mathematical Monthly 53 (1946) 248-250
    • (1946) American Mathematical Monthly , vol.53 , pp. 248-250
    • Erdos, P.1
  • 12
    • 38149060125 scopus 로고    scopus 로고
    • G.D. Fonseca, Approximate range searching: the absolute model, in: WADS 2007, 2007, pp. 2-14.
    • G.D. Fonseca, Approximate range searching: the absolute model, in: WADS 2007, 2007, pp. 2-14.
  • 14
    • 21144432140 scopus 로고    scopus 로고
    • Combinatorial and experimental methods for approximate point pattern matching
    • Gavrilov M., Indyk P., Motwani R., and Venkatasubramanian S. Combinatorial and experimental methods for approximate point pattern matching. Algorithmica 38 1 (2003) 59-90
    • (2003) Algorithmica , vol.38 , Issue.1 , pp. 59-90
    • Gavrilov, M.1    Indyk, P.2    Motwani, R.3    Venkatasubramanian, S.4
  • 19
  • 20
  • 21
    • 0031237788 scopus 로고    scopus 로고
    • Efficiently locating objects using the Hausdorff distance
    • Rucklidge W. Efficiently locating objects using the Hausdorff distance. International Journal of Computer Vision 24 3 (1997) 251-270
    • (1997) International Journal of Computer Vision , vol.24 , Issue.3 , pp. 251-270
    • Rucklidge, W.1
  • 22
    • 51249182705 scopus 로고
    • Extremal problems in discrete geometry
    • Szemeredi E., and Trotter W.T. Extremal problems in discrete geometry. Combinatorica 3 (1983) 381-392
    • (1983) Combinatorica , vol.3 , pp. 381-392
    • Szemeredi, E.1    Trotter, W.T.2


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