Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, JYen_US
dc.contributor.authorLee, CWen_US
dc.contributor.authorChen, Zen_US
dc.date.accessioned2014-12-08T15:02:54Z-
dc.date.available2014-12-08T15:02:54Z-
dc.date.issued1996en_US
dc.identifier.issn0932-8092en_US
dc.identifier.urihttp://hdl.handle.net/11536/1511-
dc.description.abstractThis paper proposes a method of using relationships between adjacent frames to identify business forms. First, we use the relations between adjacent frames in the business form to represent each form as two graphs. We then convert these graphs to two 1-D strings, which are used to perform matching. This approach enables forms to be identified quickly, and it places no restrictions on the layout of the business forms.en_US
dc.language.isoen_USen_US
dc.subjectbusiness formen_US
dc.subjectadjacent frameen_US
dc.subjectgraph constructionen_US
dc.subject1-D stringen_US
dc.subjectmatchingen_US
dc.titleIdentification of business forms using relationships between adjacent framesen_US
dc.typeArticleen_US
dc.identifier.journalMACHINE VISION AND APPLICATIONSen_US
dc.citation.volume9en_US
dc.citation.issue2en_US
dc.citation.spage56en_US
dc.citation.epage64en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1996VD74500002-
dc.citation.woscount10-
Appears in Collections:Articles