@conference {13638,
	title = {Robust table-form structure analysis based on box-driven reasoning},
	booktitle = {Document Analysis and Recognition, 1995., Proceedings of the Third International Conference on},
	volume = {1},
	year = {1995},
	month = {1995/08//},
	pages = {218 -221 vol.1 - 218 -221 vol.1},
	abstract = {Table form document structure analysis is an important problem in the document processing domain. The paper presents a method called Box Driven Reasoning (BDR) to robustly analyze the structure of table form documents which include touching characters and broken lines. Most previous methods employ a line oriented approach. Real documents are copied repeatedly and overlaid with printed data, resulting in characters which touch cells and lines which are broken. BDR deals with regions directly, in contrast with other previous methods. Experimental tests show that BDR reliably recognizes cells and strings in document images with touching characters and broken lines},
	keywords = {analysis;table, analysis;touching, BDR;box, characters;character, document, domain;robust, driven, form, image, images;document, lines;document, mechanisms;, PROCESSING, processing;inference, reasoning;broken, recognition;data, structure, structures;document, table},
	doi = {10.1109/ICDAR.1995.598980},
	author = {Hori,O. and David Doermann}
}
@conference {14835,
	title = {Model group indexing for recognition},
	booktitle = {Computer Vision and Pattern Recognition, 1991. Proceedings CVPR {\textquoteright}91., IEEE Computer Society Conference on},
	year = {1991},
	month = {1991/06//},
	pages = {4 - 9},
	abstract = {It is shown that an index space can be a powerful tool for reducing the image-model match search by a factor of <e1>k</e1><sup>G-3 </sup>, but only when accompanied by some mechanism, such as grouping, that prevents the system from having to consider all matches between image groups of size G and model groups of size <e1>G</e1>. It is also shown that if image groups are to index a single point at recognition time, then the index space must contain pointers to each model group over a 2-D sheet, and should therefore be 2<e1>G</e1>-4 dimensional. A simple indexing system has been implemented to demonstrate these concepts, and a series of experiments have been conducted to investigate the tradeoffs between space and time. They indicate that the speedups are achievable, but require a large amount of space},
	keywords = {2-D, dimensional;image, group, groups;image-model, indexing;pattern, lookup;, match, pattern, recognition;data, recognition;pointers;computer, search;index, sheet;2G-4, space;indexing, structures;table, system;model, vision;computerised},
	doi = {10.1109/CVPR.1991.139652},
	author = {Clemens,D. T and Jacobs, David W.}
}
