Attributed stroke graph matching for seal imprint verification

Seongwhan Lee; Jin H. Kim

doi:10.1016/0167-8655(89)90046-9

Attributed stroke graph matching for seal imprint verification

Seongwhan Lee, Jin H. Kim

Department of Artificial Intelligence

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

In this paper, a new scheme^** ** The basic idea of the new scheme using attributed stroke graph matching for seal imprint verification was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages, Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching is proposed. Our scheme can handle seal imprints under much less constraints. The shape of seals can be a square, an ellipse, a circle, or any close loop. The boundary of the seal imprints is allowed to be imperfect. Furthermore, it is insensitive to the distance between the TV-camera and seal imprints. Experimental results confirm that the proposed scheme might be feasible for practical applications.

Original language	English
Pages (from-to)	137-145
Number of pages	9
Journal	Pattern Recognition Letters
Volume	9
Issue number	2
DOIs	https://doi.org/10.1016/0167-8655(89)90046-9
Publication status	Published - 1989 Feb

Keywords

Seal imprint verification
attributed stroke graph matching
fast minimum square error transform

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Artificial Intelligence

Access to Document

10.1016/0167-8655(89)90046-9

Cite this

@article{fb57401207a843fbab4425490fd48376,

title = "Attributed stroke graph matching for seal imprint verification",

abstract = "In this paper, a new scheme** ** The basic idea of the new scheme using attributed stroke graph matching for seal imprint verification was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages, Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching is proposed. Our scheme can handle seal imprints under much less constraints. The shape of seals can be a square, an ellipse, a circle, or any close loop. The boundary of the seal imprints is allowed to be imperfect. Furthermore, it is insensitive to the distance between the TV-camera and seal imprints. Experimental results confirm that the proposed scheme might be feasible for practical applications.",

keywords = "Seal imprint verification, attributed stroke graph matching, fast minimum square error transform",

author = "Seongwhan Lee and Kim, {Jin H.}",

year = "1989",

month = feb,

doi = "10.1016/0167-8655(89)90046-9",

language = "English",

volume = "9",

pages = "137--145",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Attributed stroke graph matching for seal imprint verification

AU - Lee, Seongwhan

AU - Kim, Jin H.

PY - 1989/2

Y1 - 1989/2

N2 - In this paper, a new scheme** ** The basic idea of the new scheme using attributed stroke graph matching for seal imprint verification was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages, Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching is proposed. Our scheme can handle seal imprints under much less constraints. The shape of seals can be a square, an ellipse, a circle, or any close loop. The boundary of the seal imprints is allowed to be imperfect. Furthermore, it is insensitive to the distance between the TV-camera and seal imprints. Experimental results confirm that the proposed scheme might be feasible for practical applications.

AB - In this paper, a new scheme** ** The basic idea of the new scheme using attributed stroke graph matching for seal imprint verification was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages, Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching is proposed. Our scheme can handle seal imprints under much less constraints. The shape of seals can be a square, an ellipse, a circle, or any close loop. The boundary of the seal imprints is allowed to be imperfect. Furthermore, it is insensitive to the distance between the TV-camera and seal imprints. Experimental results confirm that the proposed scheme might be feasible for practical applications.

KW - Seal imprint verification

KW - attributed stroke graph matching

KW - fast minimum square error transform

UR - http://www.scopus.com/inward/record.url?scp=38249024663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249024663&partnerID=8YFLogxK

U2 - 10.1016/0167-8655(89)90046-9

DO - 10.1016/0167-8655(89)90046-9

M3 - Article

AN - SCOPUS:38249024663

SN - 0167-8655

VL - 9

SP - 137

EP - 145

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 2

ER -

Attributed stroke graph matching for seal imprint verification

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this