메뉴 건너뛰기




Volumn 31, Issue 9, 1998, Pages 1205-1220

A feature point clustering approach to the recognition of form documents

Author keywords

Document analysis; Feature point clustering; Maximin clustering algorithm; Weighted graph matching

Indexed keywords

ALGORITHMS; CHARACTER RECOGNITION; GRAPH THEORY; PATTERN MATCHING; PATTERN RECOGNITION;

EID: 0032165667     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(97)00162-3     Document Type: Article
Times cited : (10)

References (17)
  • 4
    • 0001014061 scopus 로고
    • Segmentation methods for character recognition: From segmentation to document structure analysis
    • H. Fujisawa, Y. Nakano and K. Kurino, Segmentation methods for character recognition: from segmentation to document structure analysis, Proc. IEEE 80(7), 1079-1092 (1992).
    • (1992) Proc. IEEE , vol.80 , Issue.7 , pp. 1079-1092
    • Fujisawa, H.1    Nakano, Y.2    Kurino, K.3
  • 6
    • 0039610717 scopus 로고
    • Toward a practical document understanding of table-form documents: Its framework and knowledge representation
    • T. Watanabe, Q. Luo and N. Sugie, Toward a practical document understanding of table-form documents: its framework and knowledge representation, Proc. 2nd Int. Conf. on Document Analysis and Recognition pp. 510-515 (1993).
    • (1993) Proc. 2nd Int. Conf. on Document Analysis and Recognition , pp. 510-515
    • Watanabe, T.1    Luo, Q.2    Sugie, N.3
  • 7
    • 0028375376 scopus 로고
    • Skeleton generation of engineering drawings via contour matching
    • C. C. Han and K. C. Fan, Skeleton generation of engineering drawings via contour matching, Pattern Recognition 27, 261-275 (1994).
    • (1994) Pattern Recognition , vol.27 , pp. 261-275
    • Han, C.C.1    Fan, K.C.2
  • 10
    • 0018732476 scopus 로고
    • Error-correcting isomorphisms of attributed relational graphs for pattern analysis
    • W. H. Tsai and K. S. Fu, Error-correcting isomorphisms of attributed relational graphs for pattern analysis, IEEE Trans Systems Man Cybernet. 9(12), 757-768 (1979).
    • (1979) IEEE Trans Systems Man Cybernet , vol.9 , Issue.12 , pp. 757-768
    • Tsai, W.H.1    Fu, K.S.2
  • 11
    • 0018716288 scopus 로고
    • Discrete relaxation for matching relational structures
    • L. Kitchen and A. Rosenfeld, Discrete relaxation for matching relational structures, IEEE Trans System Man, Cybernet. 9(2), 869-874 (1979).
    • (1979) IEEE Trans System Man, Cybernet , vol.9 , Issue.2 , pp. 869-874
    • Kitchen, L.1    Rosenfeld, A.2
  • 14
    • 0022918794 scopus 로고
    • A new algorithm for graph monomorphism based on the projections of the product graph
    • F. A. Akinniyi, A. K. C. Wong and D. A. Stacey, A new algorithm for graph monomorphism based on the projections of the product graph, IEEE Trans. Systems Man, Cybernet. 16(5), 740-751 (1986).
    • (1986) IEEE Trans. Systems Man, Cybernet , vol.16 , Issue.5 , pp. 740-751
    • Akinniyi, F.A.1    Wong, A.K.C.2    Stacey, D.A.3
  • 15
    • 0024069925 scopus 로고
    • An eigendecomposition approach to weighted graph matching problems
    • S.U. Ama, An eigendecomposition approach to weighted graph matching problems, IEEE Trans. Pattern Anal. Machine Intell. 10(5), 695-703 (1988).
    • (1988) IEEE Trans. Pattern Anal. Machine Intell. , vol.10 , Issue.5 , pp. 695-703
    • Ama, S.U.1
  • 16
    • 0027593722 scopus 로고
    • A linear programming approach for the weighted graph matching problem
    • H. A. Almohamad and S. O. Duffuaa, A linear programming approach for the weighted graph matching problem, IEEE Trans. Pattern Anal. Mach. Intell. 15(5), 522-525 (1993).
    • (1993) IEEE Trans. Pattern Anal. Mach. Intell. , vol.15 , Issue.5 , pp. 522-525
    • Almohamad, H.A.1    Duffuaa, S.O.2


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