Unconstrained seal imprint verification using attributed stroke graph matching

Seong Whan Lee, Jin H. Kim

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

Seal imprint verification by human visual inspection is a serious bottleneck of office automation in Oriental countries. In this paper, we propose a new scheme † The basic idea of the new scheme using attributed stroke graph matching was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages,(4) Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching. A major advantage of our scheme is that our scheme can handle seal imprints under much fewer 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 languageEnglish
Pages (from-to)653-664
Number of pages12
JournalPattern Recognition
Volume22
Issue number6
Publication statusPublished - 1989 Dec 1

Fingerprint

Seals
Office automation
Inspection
Cameras
Processing

Keywords

  • Attributed stroke graph
  • Distance measure
  • Fast minimum square error transform
  • Spatial distributions of stroke skeletons
  • Unconstrained seal imprint verification

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Unconstrained seal imprint verification using attributed stroke graph matching. / Lee, Seong Whan; Kim, Jin H.

In: Pattern Recognition, Vol. 22, No. 6, 01.12.1989, p. 653-664.

Research output: Contribution to journalArticle

@article{e7da6af07a2a4a25b2346b3a8d0deebe,
title = "Unconstrained seal imprint verification using attributed stroke graph matching",
abstract = "Seal imprint verification by human visual inspection is a serious bottleneck of office automation in Oriental countries. In this paper, we propose a new scheme† † The basic idea of the new scheme using attributed stroke graph matching was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages,(4) Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching. A major advantage of our scheme is that our scheme can handle seal imprints under much fewer 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 = "Attributed stroke graph, Distance measure, Fast minimum square error transform, Spatial distributions of stroke skeletons, Unconstrained seal imprint verification",
author = "Lee, {Seong Whan} and Kim, {Jin H.}",
year = "1989",
month = "12",
day = "1",
language = "English",
volume = "22",
pages = "653--664",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "6",

}

TY - JOUR

T1 - Unconstrained seal imprint verification using attributed stroke graph matching

AU - Lee, Seong Whan

AU - Kim, Jin H.

PY - 1989/12/1

Y1 - 1989/12/1

N2 - Seal imprint verification by human visual inspection is a serious bottleneck of office automation in Oriental countries. In this paper, we propose a new scheme† † The basic idea of the new scheme using attributed stroke graph matching was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages,(4) Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching. A major advantage of our scheme is that our scheme can handle seal imprints under much fewer 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 - Seal imprint verification by human visual inspection is a serious bottleneck of office automation in Oriental countries. In this paper, we propose a new scheme† † The basic idea of the new scheme using attributed stroke graph matching was first reported at the International Conference on Computer Processing of Chinese and Oriental Languages,(4) Toronto, Canada, August 1988. for automatic seal imprint verification using attributed stroke graph matching. A major advantage of our scheme is that our scheme can handle seal imprints under much fewer 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 - Attributed stroke graph

KW - Distance measure

KW - Fast minimum square error transform

KW - Spatial distributions of stroke skeletons

KW - Unconstrained seal imprint verification

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

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

M3 - Article

AN - SCOPUS:0024880693

VL - 22

SP - 653

EP - 664

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 6

ER -