Loading…
Online recognition of sketched arrow-connected diagrams
We introduce a new, online, stroke-based recognition system for hand-drawn diagrams which belong to a group of documents with an explicit structure obvious to humans but only loosely defined from the machine point of view. We propose a model for recognition by selection of symbol candidates, based o...
Saved in:
Published in: | International journal on document analysis and recognition 2016-09, Vol.19 (3), p.253-267 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c316t-f9fb0c45e61e03d853c36b3bb89d9c6421e2e08803cdff7872f2fd494451344d3 |
---|---|
cites | cdi_FETCH-LOGICAL-c316t-f9fb0c45e61e03d853c36b3bb89d9c6421e2e08803cdff7872f2fd494451344d3 |
container_end_page | 267 |
container_issue | 3 |
container_start_page | 253 |
container_title | International journal on document analysis and recognition |
container_volume | 19 |
creator | Bresler, Martin Průša, Daniel Hlaváč, Václav |
description | We introduce a new, online, stroke-based recognition system for hand-drawn diagrams which belong to a group of documents with an explicit structure obvious to humans but only loosely defined from the machine point of view. We propose a model for recognition by selection of symbol candidates, based on evaluation of relations between candidates using a set of predicates. It is suitable for simpler structures where the relations are explicitly given by symbols, arrows in the case of diagrams. Knowledge of a specific diagram domain is used—the two domains are flowcharts and finite automata. Although the individual pipeline steps are tailored for these, the system can readily be adapted for other domains. Our entire diagram recognition pipeline is outlined. Its core parts are text/non-text separation, symbol segmentation, their classification and structural analysis. Individual parts have been published by the authors previously and so are described briefly and referenced. Thorough evaluation on benchmark databases shows the accuracy of the system reaches the state of the art and is ready for practical use. The paper brings several contributions: (a) the entire system and its state-of-the-art performance; (b) the methodology exploring document structure when it is loosely defined; (c) the thorough experimental evaluation; (d) the new annotated database for online sketched flowcharts and finite automata diagrams. |
doi_str_mv | 10.1007/s10032-016-0269-z |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1880742251</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1880742251</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-f9fb0c45e61e03d853c36b3bb89d9c6421e2e08803cdff7872f2fd494451344d3</originalsourceid><addsrcrecordid>eNp1kMtKAzEUhoMoWKsP4G7AdTS3STJLKWqFQje6DjPJSZ3aJjWZIvbpTRkRN27OBf7vHPgQuqbklhKi7nKpnGFCJSZMNvhwgiZUcI6ZZvXp78z5ObrIeU0IVVLpCVLLsOkDVAlsXIV-6GOooq_yOwz2DVzVphQ_sY0hgB3K7vp2ldptvkRnvt1kuPrpU_T6-PAym-PF8ul5dr_AllM5YN_4jlhRg6RAuNM1t1x2vOt04xorBaPAgGhNuHXeK62YZ96JRoiaciEcn6Kb8e4uxY895MGs4z6F8tLQginBWElOER1TNsWcE3izS_22TV-GEnP0Y0Y_pvgxRz_mUBg2MrlkwwrSn8v_Qt_oCWfn</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1880742251</pqid></control><display><type>article</type><title>Online recognition of sketched arrow-connected diagrams</title><source>Springer Nature</source><creator>Bresler, Martin ; Průša, Daniel ; Hlaváč, Václav</creator><creatorcontrib>Bresler, Martin ; Průša, Daniel ; Hlaváč, Václav</creatorcontrib><description>We introduce a new, online, stroke-based recognition system for hand-drawn diagrams which belong to a group of documents with an explicit structure obvious to humans but only loosely defined from the machine point of view. We propose a model for recognition by selection of symbol candidates, based on evaluation of relations between candidates using a set of predicates. It is suitable for simpler structures where the relations are explicitly given by symbols, arrows in the case of diagrams. Knowledge of a specific diagram domain is used—the two domains are flowcharts and finite automata. Although the individual pipeline steps are tailored for these, the system can readily be adapted for other domains. Our entire diagram recognition pipeline is outlined. Its core parts are text/non-text separation, symbol segmentation, their classification and structural analysis. Individual parts have been published by the authors previously and so are described briefly and referenced. Thorough evaluation on benchmark databases shows the accuracy of the system reaches the state of the art and is ready for practical use. The paper brings several contributions: (a) the entire system and its state-of-the-art performance; (b) the methodology exploring document structure when it is loosely defined; (c) the thorough experimental evaluation; (d) the new annotated database for online sketched flowcharts and finite automata diagrams.</description><identifier>ISSN: 1433-2833</identifier><identifier>EISSN: 1433-2825</identifier><identifier>DOI: 10.1007/s10032-016-0269-z</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Automata theory ; Computer Science ; Image Processing and Computer Vision ; On-line systems ; Original Paper ; Pattern Recognition ; Recognition ; Structural analysis</subject><ispartof>International journal on document analysis and recognition, 2016-09, Vol.19 (3), p.253-267</ispartof><rights>Springer-Verlag Berlin Heidelberg 2016</rights><rights>Copyright Springer Science & Business Media 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-f9fb0c45e61e03d853c36b3bb89d9c6421e2e08803cdff7872f2fd494451344d3</citedby><cites>FETCH-LOGICAL-c316t-f9fb0c45e61e03d853c36b3bb89d9c6421e2e08803cdff7872f2fd494451344d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27915,27916</link.rule.ids></links><search><creatorcontrib>Bresler, Martin</creatorcontrib><creatorcontrib>Průša, Daniel</creatorcontrib><creatorcontrib>Hlaváč, Václav</creatorcontrib><title>Online recognition of sketched arrow-connected diagrams</title><title>International journal on document analysis and recognition</title><addtitle>IJDAR</addtitle><description>We introduce a new, online, stroke-based recognition system for hand-drawn diagrams which belong to a group of documents with an explicit structure obvious to humans but only loosely defined from the machine point of view. We propose a model for recognition by selection of symbol candidates, based on evaluation of relations between candidates using a set of predicates. It is suitable for simpler structures where the relations are explicitly given by symbols, arrows in the case of diagrams. Knowledge of a specific diagram domain is used—the two domains are flowcharts and finite automata. Although the individual pipeline steps are tailored for these, the system can readily be adapted for other domains. Our entire diagram recognition pipeline is outlined. Its core parts are text/non-text separation, symbol segmentation, their classification and structural analysis. Individual parts have been published by the authors previously and so are described briefly and referenced. Thorough evaluation on benchmark databases shows the accuracy of the system reaches the state of the art and is ready for practical use. The paper brings several contributions: (a) the entire system and its state-of-the-art performance; (b) the methodology exploring document structure when it is loosely defined; (c) the thorough experimental evaluation; (d) the new annotated database for online sketched flowcharts and finite automata diagrams.</description><subject>Automata theory</subject><subject>Computer Science</subject><subject>Image Processing and Computer Vision</subject><subject>On-line systems</subject><subject>Original Paper</subject><subject>Pattern Recognition</subject><subject>Recognition</subject><subject>Structural analysis</subject><issn>1433-2833</issn><issn>1433-2825</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNp1kMtKAzEUhoMoWKsP4G7AdTS3STJLKWqFQje6DjPJSZ3aJjWZIvbpTRkRN27OBf7vHPgQuqbklhKi7nKpnGFCJSZMNvhwgiZUcI6ZZvXp78z5ObrIeU0IVVLpCVLLsOkDVAlsXIV-6GOooq_yOwz2DVzVphQ_sY0hgB3K7vp2ldptvkRnvt1kuPrpU_T6-PAym-PF8ul5dr_AllM5YN_4jlhRg6RAuNM1t1x2vOt04xorBaPAgGhNuHXeK62YZ96JRoiaciEcn6Kb8e4uxY895MGs4z6F8tLQginBWElOER1TNsWcE3izS_22TV-GEnP0Y0Y_pvgxRz_mUBg2MrlkwwrSn8v_Qt_oCWfn</recordid><startdate>20160901</startdate><enddate>20160901</enddate><creator>Bresler, Martin</creator><creator>Průša, Daniel</creator><creator>Hlaváč, Václav</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20160901</creationdate><title>Online recognition of sketched arrow-connected diagrams</title><author>Bresler, Martin ; Průša, Daniel ; Hlaváč, Václav</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-f9fb0c45e61e03d853c36b3bb89d9c6421e2e08803cdff7872f2fd494451344d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Automata theory</topic><topic>Computer Science</topic><topic>Image Processing and Computer Vision</topic><topic>On-line systems</topic><topic>Original Paper</topic><topic>Pattern Recognition</topic><topic>Recognition</topic><topic>Structural analysis</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bresler, Martin</creatorcontrib><creatorcontrib>Průša, Daniel</creatorcontrib><creatorcontrib>Hlaváč, Václav</creatorcontrib><collection>CrossRef</collection><jtitle>International journal on document analysis and recognition</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bresler, Martin</au><au>Průša, Daniel</au><au>Hlaváč, Václav</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Online recognition of sketched arrow-connected diagrams</atitle><jtitle>International journal on document analysis and recognition</jtitle><stitle>IJDAR</stitle><date>2016-09-01</date><risdate>2016</risdate><volume>19</volume><issue>3</issue><spage>253</spage><epage>267</epage><pages>253-267</pages><issn>1433-2833</issn><eissn>1433-2825</eissn><abstract>We introduce a new, online, stroke-based recognition system for hand-drawn diagrams which belong to a group of documents with an explicit structure obvious to humans but only loosely defined from the machine point of view. We propose a model for recognition by selection of symbol candidates, based on evaluation of relations between candidates using a set of predicates. It is suitable for simpler structures where the relations are explicitly given by symbols, arrows in the case of diagrams. Knowledge of a specific diagram domain is used—the two domains are flowcharts and finite automata. Although the individual pipeline steps are tailored for these, the system can readily be adapted for other domains. Our entire diagram recognition pipeline is outlined. Its core parts are text/non-text separation, symbol segmentation, their classification and structural analysis. Individual parts have been published by the authors previously and so are described briefly and referenced. Thorough evaluation on benchmark databases shows the accuracy of the system reaches the state of the art and is ready for practical use. The paper brings several contributions: (a) the entire system and its state-of-the-art performance; (b) the methodology exploring document structure when it is loosely defined; (c) the thorough experimental evaluation; (d) the new annotated database for online sketched flowcharts and finite automata diagrams.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s10032-016-0269-z</doi><tpages>15</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1433-2833 |
ispartof | International journal on document analysis and recognition, 2016-09, Vol.19 (3), p.253-267 |
issn | 1433-2833 1433-2825 |
language | eng |
recordid | cdi_proquest_journals_1880742251 |
source | Springer Nature |
subjects | Automata theory Computer Science Image Processing and Computer Vision On-line systems Original Paper Pattern Recognition Recognition Structural analysis |
title | Online recognition of sketched arrow-connected diagrams |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T06%3A29%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Online%20recognition%20of%20sketched%20arrow-connected%20diagrams&rft.jtitle=International%20journal%20on%20document%20analysis%20and%20recognition&rft.au=Bresler,%20Martin&rft.date=2016-09-01&rft.volume=19&rft.issue=3&rft.spage=253&rft.epage=267&rft.pages=253-267&rft.issn=1433-2833&rft.eissn=1433-2825&rft_id=info:doi/10.1007/s10032-016-0269-z&rft_dat=%3Cproquest_cross%3E1880742251%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c316t-f9fb0c45e61e03d853c36b3bb89d9c6421e2e08803cdff7872f2fd494451344d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1880742251&rft_id=info:pmid/&rfr_iscdi=true |