메뉴 건너뛰기




Volumn , Issue , 2010, Pages 946-949

NAVIDOMASS: Structural-based approaches towards handling historical documents

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; FOURIER DESCRIPTORS; GRAPH MATCHING PROBLEMS; GRAPH-BASED REPRESENTATIONS; HISTORICAL DOCUMENTS;

EID: 78149488665     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2010.237     Document Type: Conference Paper
Times cited : (16)

References (14)
  • 1
    • 33644533840 scopus 로고    scopus 로고
    • Structure-texture image decomposition-modeling, algorithms, and parameter selection
    • DOI 10.1007/s11263-006-4331-z
    • J.-F. Aujol, G. Gilboa, T. Chan, and S. Osher. Structure-texture image decomposition - modeling, algorithms, and parameter selection. International Journal of Computer Vision, 67(1):111-136, 2006. (Pubitemid 43296539)
    • (2006) International Journal of Computer Vision , vol.67 , Issue.1 , pp. 111-136
    • Aujol, J.-F.1    Gilboa, G.2    Chan, T.3    Osher, S.4
  • 2
    • 84944036030 scopus 로고    scopus 로고
    • Towards bridging the gap between statistical and structural pattern recognition: Two new concepts in graph matching
    • H. Bunke, S. Günter, and X. Jiang. Towards bridging the gap between statistical and structural pattern recognition: Two new concepts in graph matching. In ICAPR, pages 1-11, 2001.
    • (2001) ICAPR , pp. 1-11
    • Bunke, H.1    Günter, S.2    Jiang, X.3
  • 3
    • 71249137692 scopus 로고    scopus 로고
    • Drop Caps Decomposition for Indexing - A New Letter Extraction Method
    • M. Coustaty, J.-M. Ogier, R. Pareti, and N. Vincent. Drop Caps Decomposition For Indexing - A New Letter Extraction Method. In 10th ICDAR, pages 476-480.
    • 10th ICDAR , pp. 476-480
    • Coustaty, M.1    Ogier, J.-M.2    Pareti, R.3    Vincent, N.4
  • 4
    • 70349970383 scopus 로고    scopus 로고
    • Adding a noise component to a color decomposition model for improving color texture extraction
    • S. Dubois, M. Lugiez, R. Péteri, and M. Ménard. Adding a noise component to a color decomposition model for improving color texture extraction. Proceedings CGIV 2008 and MCS08, pages 394-398, 2008.
    • (2008) Proceedings CGIV 2008 and MCS08 , pp. 394-398
    • Dubois, S.1    Lugiez, M.2    Péteri, R.3    Ménard, M.4
  • 5
    • 84941155240 scopus 로고
    • Well separated clusters and optimal fuzzy-partitions
    • J. C. Dunn. Well separated clusters and optimal fuzzy-partitions. Journal of Cybernetics, 4:95-104, 1974.
    • (1974) Journal of Cybernetics , vol.4 , pp. 95-104
    • Dunn, J.C.1
  • 6
    • 9644254228 scopus 로고    scopus 로고
    • Efficient graph-based image segmentation
    • P. F. Felzenszwalb and D. P. Huttenlocher. Efficient graph-based image segmentation. IJCV, 59(2):167-181, 2004.
    • (2004) IJCV , vol.59 , Issue.2 , pp. 167-181
    • Felzenszwalb, P.F.1    Huttenlocher, D.P.2
  • 8
    • 70549098344 scopus 로고    scopus 로고
    • Attributed graph matching using local descriptions
    • 11th Int. Conf. on ACVIS
    • S. Jouili, I. Mili, and S. Tabbone. Attributed graph matching using local descriptions. In 11th Int. Conf. on ACVIS, LNCS 5807, pages 89-99, 2009.
    • (2009) LNCS , vol.5807 , pp. 89-99
    • Jouili, S.1    Mili, I.2    Tabbone, S.3
  • 9
    • 70349317704 scopus 로고    scopus 로고
    • Graph matching based on node signatures
    • 7th IAPR-TC-15 Int. Workshop on GbRPR
    • S. Jouili and S. Tabbone. Graph matching based on node signatures. In 7th IAPR-TC-15 Int. Workshop on GbRPR, LNCS 5534, pages 154-163, 2009.
    • (2009) LNCS , vol.5534 , pp. 154-163
    • Jouili, S.1    Tabbone, S.2
  • 10
    • 0002719797 scopus 로고
    • The hungarian method for the assignment problem
    • H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1-2):83-97, 1955.
    • (1955) Naval Research Logistics Quarterly , vol.2 , Issue.1-2 , pp. 83-97
    • Kuhn, H.W.1
  • 11
    • 34047235224 scopus 로고    scopus 로고
    • Ancient initial letters indexing
    • Washington, DC, USA, IEEE Computer Society
    • R. Pareti and N. Vincent. Ancient initial letters indexing. In 18th Int. Conf. on Pattern Recognition, pages 756-759, Washington, DC, USA, 2006. IEEE Computer Society.
    • (2006) 18th Int. Conf. on Pattern Recognition , pp. 756-759
    • Pareti, R.1    Vincent, N.2
  • 12
    • 64849091214 scopus 로고    scopus 로고
    • Approximate graph edit distance computation by means of bipartite graph matching
    • K. Riesen and H. Bunke. Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput., 27(7):950-959, 2009.
    • (2009) Image Vision Comput. , vol.27 , Issue.7 , pp. 950-959
    • Riesen, K.1    Bunke, H.2
  • 13
    • 38149011441 scopus 로고    scopus 로고
    • Graph embedding in vector spaces by means of prototype selection
    • IAPR Workshop on GbRPR
    • K. Riesen, M. Neuhaus, and H. Bunke. Graph embedding in vector spaces by means of prototype selection. IAPR Workshop on GbRPR, LNCS 4538, pages 383-393, 2007.
    • (2007) LNCS , vol.4538 , pp. 383-393
    • Riesen, K.1    Neuhaus, M.2    Bunke, H.3
  • 14
    • 0036843713 scopus 로고    scopus 로고
    • Shape-based image retrieval using generic Fourier descriptor
    • DOI 10.1016/S0923-5965(02)00084-X, PII S092359650200084X
    • D. Zhang and G. Lu. Shape-based image retrieval using generic fourier descriptor. Signal Processing: Image Communication, 17:825-848, 2002. (Pubitemid 35282149)
    • (2002) Signal Processing: Image Communication , vol.17 , Issue.10 , pp. 825-848
    • Zhang, D.1    Lu, G.2


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