Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ICDAR.2005.164
DC Field | Value | |
---|---|---|
dc.title | A multi-level component grouping algorithm and its applications | |
dc.contributor.author | Yuan, B. | |
dc.contributor.author | Tan, C.L. | |
dc.date.accessioned | 2013-07-04T08:44:34Z | |
dc.date.available | 2013-07-04T08:44:34Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Yuan, B.,Tan, C.L. (2005). A multi-level component grouping algorithm and its applications. Proceedings of the International Conference on Document Analysis and Recognition, ICDAR 2005 : 1178-1181. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/ICDAR.2005.164" target="_blank">https://doi.org/10.1109/ICDAR.2005.164</a> | |
dc.identifier.isbn | 0769524206 | |
dc.identifier.issn | 15205363 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/42148 | |
dc.description.abstract | This paper describes a fast and effective component grouping algorithm for some layout analysis problems of textual document images. Based on an empirical function, it discovers neighborhood relations at the component level. Time-consuming algorithms that operate globally among components may obtain significant performance boost from the localization information that this grouping algorithm provides. Some of the applications using this grouping function are also demonstrated. © 2005 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ICDAR.2005.164 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1109/ICDAR.2005.164 | |
dc.description.sourcetitle | Proceedings of the International Conference on Document Analysis and Recognition, ICDAR | |
dc.description.volume | 2005 | |
dc.description.page | 1178-1181 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.