Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A heuristic algorithm for hierarchical representation of form documents
Date
1998-08-20
Author
Duygulu, P
Atalay, Mehmet Volkan
Dincel, E
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
184
views
0
downloads
Cite This
In this paper our aim is to develop a logical representation for form documents. We propose a hierarchical structure to represent the logical layout of a form by using lines. The approach is top-down and no domain knowledge such as the preprinted data or filled-in data is used. Logically same but physically different forms are associated to the same hierarchical tree. This representation can handle geometrical modifications and slight variations.(1).
URI
https://hdl.handle.net/11511/53909
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
A hierarchical representation of form documents for identification and retrieval
Duygulu, Pinar; Atalay, Mehmet Volkan (Springer Science and Business Media LLC, 2003-12-01)
In this paper, we present a logical representation for form documents to be used for identification and retrieval. A hierarchical structure is proposed to represent the structure of a form by using lines and the XY-tree approach. The approach is top-down and no domain knowledge such as the preprinted data or filled-in data is used. Geometrical modifications and slight variations are handled by this representation. Logically identical forms are associated to the same or similar hierarchical structure. Identi...
A hierarchical representation of form documents for identification and retrieval
Duygulu, P; Atalay, Mehmet Volkan (2000-01-27)
In this paper, we present a logical representation for form documents to be used for identification and retrieval. A hierarchical structure is proposed to represent the logical structure of a form by using lines. The approach is top-down and no domain knowledge such as the preprinted data or filled-in data is used. Logically same forms are associated to the same hierarchical structure. This representation can handle geometrical modifications and slight variations.
A novel rank-based classifier combination scheme for speaker identification
Altincay, H; Demirekler, Mübeccel (2000-06-09)
In this paper, we propose a novel rank-based classifier combination scheme under uncertainty for speaker identification (SI). The combination is based on a heuristic method that uses Dempster-Shafer theory of evidence under some conditions. The method is based on the extraction of first and R-th level ranking statistics. Using these statistics, the pat tern classes are clustered into model sets where the classes in these sets share set specific properties. Some of these model sets are used to reflect the st...
A Computerized Method for Delay Risk Assessment Based on Fuzzy Set Theory using MS Project (TM)
BUDAYAN, Cenk; Dikmen Toker, İrem; Birgönül, Mustafa Talat; Ghaziani, Aydin (2018-08-01)
In this paper, we present a computerized method as an add-in to MS Project (TM) for risk identification and estimation of delay. A delay analysis ontology is incorporated so that the users can identify causes of delay at the activity level and assess frequency and impact of risks using their previous experience, expertise and judgement. Testing and validation findings demonstrate that the software is easy to use and gives reliable results. Decision-makers can use this software during risk identification and...
A modified algorithm for peer-to-peer security
Akleylek, Sedat; Emmungil, Levent; NURİYEV, URFAT (2007-01-01)
In this paper we present the steganographic approach to peer-to-peer systems with a modified algorithm. This gives the user a very high level of protection against being compelled to disclose its contents. Even the realization of the quantum computer cannot solve NP-hard problem in a polynomial time, a modified algorithm with steganographic use depending on Knapsack problem may make peer-to-peer systems secure.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
P. Duygulu, M. V. Atalay, and E. Dincel, “A heuristic algorithm for hierarchical representation of form documents,” 1998, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53909.