使用零交叉在固定大小的阵列上平行立体

Q4 Computer Science 模式识别与人工智能 Pub Date : 1992-08-30 DOI:10.1109/ICPR.1992.202135

P. Chakrapani, A. Khokhar, V. Prasanna

{"title":"使用零交叉在固定大小的阵列上平行立体","authors":"P. Chakrapani, A. Khokhar, V. Prasanna","doi":"10.1109/ICPR.1992.202135","DOIUrl":null,"url":null,"abstract":"Presents a processor-time optimal partitioned implementation of a stereo matching algorithm using zero crossing points as matching primitives. The authors provide O(nm/P) time algorithm on square root P* square root P processor mesh array, where n is the number of zero crossing points in the left image, m is the set of possible candidate points in the right image for a given zero crossing point, and 1<or=P<or=n. The sequential algorithm takes O(nm/sup 2/) time while the faster sequential algorithm shown in the paper runs in O(nm) time.<<ETX>>","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Parallel stereo on fixed size arrays using zero crossings\",\"authors\":\"P. Chakrapani, A. Khokhar, V. Prasanna\",\"doi\":\"10.1109/ICPR.1992.202135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a processor-time optimal partitioned implementation of a stereo matching algorithm using zero crossing points as matching primitives. The authors provide O(nm/P) time algorithm on square root P* square root P processor mesh array, where n is the number of zero crossing points in the left image, m is the set of possible candidate points in the right image for a given zero crossing point, and 1<or=P<or=n. The sequential algorithm takes O(nm/sup 2/) time while the faster sequential algorithm shown in the paper runs in O(nm) time.<<ETX>>\",\"PeriodicalId\":34917,\"journal\":{\"name\":\"模式识别与人工智能\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"模式识别与人工智能\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1992.202135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"模式识别与人工智能","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/ICPR.1992.202135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种以零交叉点为匹配基元的立体匹配算法的处理器时间最优分割实现。本文在平方根P*平方根P处理器网格阵列上提供了O(nm/P)时间算法，其中n为左侧图像中零交叉点的个数，m为右侧图像中给定零交叉点的可能候选点集，1>

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Parallel stereo on fixed size arrays using zero crossings

Presents a processor-time optimal partitioned implementation of a stereo matching algorithm using zero crossing points as matching primitives. The authors provide O(nm/P) time algorithm on square root P* square root P processor mesh array, where n is the number of zero crossing points in the left image, m is the set of possible candidate points in the right image for a given zero crossing point, and 1>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊