纹理距离计算的集成电路

G. Lakshmikanth, M. Abd-El-Barr, H. Raafat, R. Bolton
{"title":"纹理距离计算的集成电路","authors":"G. Lakshmikanth, M. Abd-El-Barr, H. Raafat, R. Bolton","doi":"10.1109/ASIC.1989.123217","DOIUrl":null,"url":null,"abstract":"A systolic-array-based architecture for texture distance computation is presented. Texture information is extracted and then represented as a set of histograms for various texture features. On the basis of this representation and the concept of event set distance, a transportation-like simplex algorithm is used to compute the texture distances between pairs of textures. Using this algorithm, the texture matching process is reduced to finding a solution to the streamlined transportation simplex problem. The solution to this problem requires two algorithms. The first algorithm is used to obtain the initial basic feasible solution (IBFS) based on Russel's approximation. The second algorithm tests the optimality of the computed IBFS. The authors also present the design and implementation of a prototype VLSI chip which maps the systolic implementation of the two algorithms onto silicon.<<ETX>>","PeriodicalId":245997,"journal":{"name":"Proceedings., Second Annual IEEE ASIC Seminar and Exhibit,","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An integrated circuit for texture distance computation\",\"authors\":\"G. Lakshmikanth, M. Abd-El-Barr, H. Raafat, R. Bolton\",\"doi\":\"10.1109/ASIC.1989.123217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A systolic-array-based architecture for texture distance computation is presented. Texture information is extracted and then represented as a set of histograms for various texture features. On the basis of this representation and the concept of event set distance, a transportation-like simplex algorithm is used to compute the texture distances between pairs of textures. Using this algorithm, the texture matching process is reduced to finding a solution to the streamlined transportation simplex problem. The solution to this problem requires two algorithms. The first algorithm is used to obtain the initial basic feasible solution (IBFS) based on Russel's approximation. The second algorithm tests the optimality of the computed IBFS. The authors also present the design and implementation of a prototype VLSI chip which maps the systolic implementation of the two algorithms onto silicon.<<ETX>>\",\"PeriodicalId\":245997,\"journal\":{\"name\":\"Proceedings., Second Annual IEEE ASIC Seminar and Exhibit,\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings., Second Annual IEEE ASIC Seminar and Exhibit,\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASIC.1989.123217\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings., Second Annual IEEE ASIC Seminar and Exhibit,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASIC.1989.123217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种基于收缩阵列的纹理距离计算体系结构。提取纹理信息,然后将其表示为各种纹理特征的一组直方图。在此基础上,结合事件集距离的概念,采用类传输单纯形算法计算纹理对之间的纹理距离。该算法将纹理匹配过程简化为求解流线运输单纯形问题。解决这个问题需要两种算法。第一种算法基于Russel近似获得初始基本可行解(IBFS)。第二个算法测试计算的IBFS的最优性。作者还介绍了一个原型VLSI芯片的设计和实现,该芯片将这两种算法的压缩实现映射到硅上
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An integrated circuit for texture distance computation
A systolic-array-based architecture for texture distance computation is presented. Texture information is extracted and then represented as a set of histograms for various texture features. On the basis of this representation and the concept of event set distance, a transportation-like simplex algorithm is used to compute the texture distances between pairs of textures. Using this algorithm, the texture matching process is reduced to finding a solution to the streamlined transportation simplex problem. The solution to this problem requires two algorithms. The first algorithm is used to obtain the initial basic feasible solution (IBFS) based on Russel's approximation. The second algorithm tests the optimality of the computed IBFS. The authors also present the design and implementation of a prototype VLSI chip which maps the systolic implementation of the two algorithms onto silicon.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信