Pattern association from noisy images by the network constraint analysis

S. Ishikawa, Y. Ogami, K. Kato
{"title":"Pattern association from noisy images by the network constraint analysis","authors":"S. Ishikawa, Y. Ogami, K. Kato","doi":"10.1109/IECON.1993.339270","DOIUrl":null,"url":null,"abstract":"This paper describes a technique for realizing visual association by the network constraint analysis. In order to make machine visual processing more practical and powerful, it is important to develop a technique for understanding various noise superimposed images. To solve this problem, a two-stage association technique is proposed based on network constraint analysis. In the first stage, strict screening of the memory which contains reference images is performed employing an acquired noisy image to yield an intermediate image, while in the second stage, rather weaker screening of the memory is done by the intermediate image and depth first search is applied to those surviving image pieces in the memory to finally obtain an associated image. An algorithm to speed up the association process is also employed in the second stage. Performance of the two-stage association is examined by an experiment employing real noisy alphabetical images and satisfactory results are obtained.<<ETX>>","PeriodicalId":132101,"journal":{"name":"Proceedings of IECON '93 - 19th Annual Conference of IEEE Industrial Electronics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IECON '93 - 19th Annual Conference of IEEE Industrial Electronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IECON.1993.339270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper describes a technique for realizing visual association by the network constraint analysis. In order to make machine visual processing more practical and powerful, it is important to develop a technique for understanding various noise superimposed images. To solve this problem, a two-stage association technique is proposed based on network constraint analysis. In the first stage, strict screening of the memory which contains reference images is performed employing an acquired noisy image to yield an intermediate image, while in the second stage, rather weaker screening of the memory is done by the intermediate image and depth first search is applied to those surviving image pieces in the memory to finally obtain an associated image. An algorithm to speed up the association process is also employed in the second stage. Performance of the two-stage association is examined by an experiment employing real noisy alphabetical images and satisfactory results are obtained.<>
基于网络约束分析的噪声图像模式关联
本文介绍了一种利用网络约束分析实现视觉关联的技术。为了使机器视觉处理更加实用和强大,开发一种理解各种噪声叠加图像的技术是非常重要的。为了解决这一问题,提出了一种基于网络约束分析的两阶段关联技术。在第一阶段,使用获取的噪声图像对包含参考图像的存储器进行严格筛选以产生中间图像,而在第二阶段,由中间图像对存储器进行较弱的筛选,并对存储器中幸存的图像块应用深度优先搜索以最终获得关联图像。第二阶段采用了一种加速关联过程的算法。采用真实的有噪声的字母图像进行实验,验证了两阶段关联的性能,得到了满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信