{"title":"SIMD网格处理器的高效组件标记","authors":"Whanki Yong, M. Brady","doi":"10.1109/ICPP.1994.99","DOIUrl":null,"url":null,"abstract":"A new component labeling algorithm for SIMD meshes is presented whose time complexity is O(frac{{n^2 }} {{p^2 }} + n) for an n ¿ n image on a p ¿ p mesh. The algorithm is efficient in terms of total work for p leqslant n^{frac{1} {2}} . It was evaluated on a MasPar MP-1 with 1K processors and 64KB of memory per processor. For most of the 1K ¿ 1K size test inputs, our algorithm is faster than a neighbor updating algorithm that is extremely simple but asymptotically slower on images of large diameter.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Component Labeling on SIMD Mesh Processors\",\"authors\":\"Whanki Yong, M. Brady\",\"doi\":\"10.1109/ICPP.1994.99\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new component labeling algorithm for SIMD meshes is presented whose time complexity is O(frac{{n^2 }} {{p^2 }} + n) for an n ¿ n image on a p ¿ p mesh. The algorithm is efficient in terms of total work for p leqslant n^{frac{1} {2}} . It was evaluated on a MasPar MP-1 with 1K processors and 64KB of memory per processor. For most of the 1K ¿ 1K size test inputs, our algorithm is faster than a neighbor updating algorithm that is extremely simple but asymptotically slower on images of large diameter.\",\"PeriodicalId\":162043,\"journal\":{\"name\":\"1994 International Conference on Parallel Processing Vol. 3\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 International Conference on Parallel Processing Vol. 3\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.1994.99\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 International Conference on Parallel Processing Vol. 3","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.1994.99","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Component Labeling on SIMD Mesh Processors
A new component labeling algorithm for SIMD meshes is presented whose time complexity is O(frac{{n^2 }} {{p^2 }} + n) for an n ¿ n image on a p ¿ p mesh. The algorithm is efficient in terms of total work for p leqslant n^{frac{1} {2}} . It was evaluated on a MasPar MP-1 with 1K processors and 64KB of memory per processor. For most of the 1K ¿ 1K size test inputs, our algorithm is faster than a neighbor updating algorithm that is extremely simple but asymptotically slower on images of large diameter.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
