CS Events

Qualifying Exam

Tables evidence grounding

 

Download as iCal file

Thursday, April 25, 2019, 11:00am

 

Abstract:

Structured data often comes in tabular format. Many existing applications use structured tables as input such as spreadsheets, HTML, Excel, and CSV. However, there is a plethora of circumstances that can lead to generating images of tables (scanning invoices, sharing user manuals, downloading read-only publications, etc.). In such scenarios, we don’t have access to the table structure. To be able to use the aforementioned applications in the given scenarios, we are investigating ways of inferring the hidden structures from tables images. By extracting table fields in the form of an undirected graph G and finding the corresponding Line graph L(G), AKA edge-to-vertex dual graph, we are able to model the structure-inference problem as a vertex classification.

Speaker: Mohamed Abdellatif

Location : CoRE B (305)

Committee

Prof. Ahmed Elgammal, Prof. Bahman Kalantari, Prof. Abdeslam Boularias, Prof. Gerard De Melo

Event Type: Qualifying Exam

Abstract: 

Organization

Dept. of Computer Science