메뉴 건너뛰기




Volumn 3872 LNCS, Issue , 2006, Pages 280-290

Towards versatile document analysis systems

Author keywords

CART; Classification; Computational geometry; DAS methodology; Document image content extraction; Hashing; K Nearest Neighbors; K d trees; Spatial data structures; Versatile document analysis systems

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; DATA REDUCTION; DATA STRUCTURES; FEATURE EXTRACTION; IMAGE ANALYSIS;

EID: 33745530605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11669487_25     Document Type: Conference Paper
Times cited : (10)

References (16)
  • 1
    • 21944448361 scopus 로고    scopus 로고
    • Thirty years at the pattern recognition front
    • King-Sun Fu Prize Lecture, address = Barcelona, Spain
    • Pavlidis, T.: Thirty years at the pattern recognition front. In: King-Sun Fu Prize Lecture, 11th ICPR. (2000), address = Barcelona, Spain)
    • (2000) 11th ICPR
    • Pavlidis, T.1
  • 5
    • 13344275837 scopus 로고    scopus 로고
    • Style consistent classification of isogenous patterns
    • Sarkar, P., Nagy, G.: Style consistent classification of isogenous patterns. IEEE Trans. on PAMI 27 (2005)
    • (2005) IEEE Trans. on PAMI , vol.27
    • Sarkar, P.1    Nagy, G.2
  • 11
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18 (1975) 509-517
    • (1975) Communications of the ACM , vol.18 , pp. 509-517
    • Bentley, J.L.1
  • 12
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18 (1975) 509-517
    • (1975) Commun. ACM , vol.18 , pp. 509-517
    • Bentley, J.L.1
  • 13
    • 84945709355 scopus 로고
    • An algorithm for finding best matches in logarithmic expected time
    • Freidman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3 (1977) 209-226
    • (1977) ACM Trans. Math. Softw. , vol.3 , pp. 209-226
    • Freidman, J.H.1    Bentley, J.L.2    Finkel, R.A.3
  • 14
    • 0017631930 scopus 로고
    • Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
    • Lee, D.T., Wong, C.K.: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Inf. 9 (1977) 23-29
    • (1977) Acta Inf. , vol.9 , pp. 23-29
    • Lee, D.T.1    Wong, C.K.2


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