{"title":"可重构网格计算机上的直方图","authors":"J. Jenq, S. Sahni","doi":"10.1109/IPPS.1992.223008","DOIUrl":null,"url":null,"abstract":"The authors develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N*N image is computed by an N*N RMESH in O( square root B log /sub square root B/(N/ square root B) for B<N, O( square root N) for B=N, and O( square root B) for N<B<or=N/sup 2/. B is the number of gray scale values. Histogram modification is done in O( square root N) time by an N*N RMESH.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"44 23","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Histogramming on a reconfigurable mesh computer\",\"authors\":\"J. Jenq, S. Sahni\",\"doi\":\"10.1109/IPPS.1992.223008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N*N image is computed by an N*N RMESH in O( square root B log /sub square root B/(N/ square root B) for B<N, O( square root N) for B=N, and O( square root B) for N<B<or=N/sup 2/. B is the number of gray scale values. Histogram modification is done in O( square root N) time by an N*N RMESH.<<ETX>>\",\"PeriodicalId\":340070,\"journal\":{\"name\":\"Proceedings Sixth International Parallel Processing Symposium\",\"volume\":\"44 23\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1992.223008\",\"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 Sixth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1992.223008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
摘要
作者开发了可重构网格(RMESH)算法，用于窗口广播、数据移位和连续求和。然后使用这些来开发有效的算法来计算图像的直方图并执行直方图修改。N*N图像的直方图由N*N的RMESH在O(√B log /sub√B/(N/√B) for B>中计算。
The authors develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N*N image is computed by an N*N RMESH in O( square root B log /sub square root B/(N/ square root B) for B>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
