{"title":"Exploiting data parallelism in vision on the Connection Machine system","authors":"H. Voorhees, D. M. Fritzsche, L. W. Tucker","doi":"10.1109/ICPR.1990.119442","DOIUrl":null,"url":null,"abstract":"The authors show how the data parallel programming model can be applied to high level vision tasks needed for object recognition. The architecture and programming model of the Connection Machine System are reviewed. Utilities for representing and manipulating sets of data, the primary representation outside of the image plane, are described using communications primitives, especially segmented scans. Several algorithms for matching and evidence accumulation, which are constructed from the utilities, are compared. The techniques emphasize the use of sorting and sparse representations of space in order to limit the combinatorial processing requirements of high-level vision.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"285 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. 10th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1990.119442","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
The authors show how the data parallel programming model can be applied to high level vision tasks needed for object recognition. The architecture and programming model of the Connection Machine System are reviewed. Utilities for representing and manipulating sets of data, the primary representation outside of the image plane, are described using communications primitives, especially segmented scans. Several algorithms for matching and evidence accumulation, which are constructed from the utilities, are compared. The techniques emphasize the use of sorting and sparse representations of space in order to limit the combinatorial processing requirements of high-level vision.<>