Form classification using DP matching

19Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

In order to process many kinds of form document, form classification must be performed in the first place. However, a substantial amount of time is required to analyze and recognize such form documents according to the increase of the number of registered models. To solve this problem, we suggest document understanding with a partial matching method in which form structure recognition and form classification are performed for only some areas of the input form. In this case, the definition of the matching areas and form classification are performed by using a DP matching algorithm. By using this approach, the recognition of an input form and the extraction of field items can be processed at, a high recognition rate in a reasonable time span. In terms of applicability, the experimental recognition rate and processing time seem to be encouraging. © 2000 ACM.

Cite

CITATION STYLE

APA

Byun, Y., Lee, Y., Choi, Y. W., Kim, G., & Yoon, S. (2000). Form classification using DP matching. In Proceedings of the ACM Symposium on Applied Computing (Vol. 1, pp. 1–4). Association for Computing Machinery. https://doi.org/10.1145/335603.335611

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free