An asynchronous thinning algorithm

Theo Pavlidis
{"title":"An asynchronous thinning algorithm","authors":"Theo Pavlidis","doi":"10.1016/0146-664X(82)90041-7","DOIUrl":null,"url":null,"abstract":"<div><p>A problem common to many areas of pictorial information processing is the transformation of a bilevel (two-color) image into a line drawing. The first step in such a process is discussed: transformation of the bilevel image into another bilevel image that is “thin.” An algorithm is proposed that can be implemented in either parallel or sequential fashion, and therefore is suitable for a mixed operation where a group of processors operate in parallel with each one examining sequentially the pixels of a part of the image assigned to it. It is possible to process images in pieces and thin correctly parts that are intersected by the dividing lines. Therefore, the method can be used on large images, such as maps and engineering drawings. The algorithm may also be run with certain options that label the thinned image so that exact reconstruction of the original is possible.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 2","pages":"Pages 133-157"},"PeriodicalIF":0.0000,"publicationDate":"1982-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90041-7","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0146664X82900417","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A problem common to many areas of pictorial information processing is the transformation of a bilevel (two-color) image into a line drawing. The first step in such a process is discussed: transformation of the bilevel image into another bilevel image that is “thin.” An algorithm is proposed that can be implemented in either parallel or sequential fashion, and therefore is suitable for a mixed operation where a group of processors operate in parallel with each one examining sequentially the pixels of a part of the image assigned to it. It is possible to process images in pieces and thin correctly parts that are intersected by the dividing lines. Therefore, the method can be used on large images, such as maps and engineering drawings. The algorithm may also be run with certain options that label the thinned image so that exact reconstruction of the original is possible.

一种异步细化算法
在图像信息处理的许多领域中,一个共同的问题是将双层(双色)图像转换成线条图。讨论了该过程的第一步:将双层图像转换为另一层“薄”的双层图像。提出了一种可以并行或顺序方式实现的算法,因此适用于混合操作,其中一组处理器并行操作,每个处理器依次检查分配给它的图像的一部分的像素。这是可能的处理图像的碎片和薄正确的部分,是由分隔线相交。因此,该方法可用于大型图像,如地图和工程图纸。该算法也可以与某些选项一起运行,这些选项标记了稀释后的图像,以便可以精确地重建原始图像。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信