Parallel distance transforms on a linear array architecture
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
81 | en_US |
dc.citation.issue |
2 | en_US |
dc.citation.spage |
73 | en_US |
dc.citation.volume |
82 | en_US |
dc.citation.woscount |
0 | |
dc.contributor.author |
Chia, TL | en_US |
dc.contributor.author |
Wang, KB | en_US |
dc.contributor.author |
Chen, Z | en_US |
dc.contributor.author |
Lou, DC | en_US |
dc.contributor.department |
資訊科學與工程研究所 | zh_TW |
dc.contributor.department |
Institute of Computer Science and Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:42:29Z | |
dc.date.available |
2014-12-08T15:42:29Z | |
dc.date.issued |
2002-04-30 | en_US |
dc.description.abstract |
Distance transformation (DT) has been widely used for image matching and shape analysis. In this paper, a parallel algorithm for computing distance transformation is presented. First, it is shown that the algorithm has an execution time of 6N - 4 cycles, for an N x N image using a parallel architecture that requires [N/2] parallel processors. By doing so, the real time requirement is fulfilled and its execution time is independent of the image contents. In addition, a partition method is developed to process an image when the parallel architecture has a fixed number of processing elements (PEs); say two or more. The total execution time for an N x N image by employing a fixed number of PEs is 2[N-2/M + 2(M - 1)], when M is the fixed number of PEs. (C) 2002 Elsevier Science B.V. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0020-0190(01)00250-2 | en_US |
dc.identifier.issn |
0020-0190 | en_US |
dc.identifier.journal |
INFORMATION PROCESSING LETTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0020-0190(01)00250-2 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/28852 | |
dc.identifier.wosnumber |
WOS:000174003100002 | |
dc.language.iso |
en_US | en_US |
dc.subject |
distance transformation | en_US |
dc.subject |
linear array | en_US |
dc.subject |
parallel processing | en_US |
dc.subject |
partition method | en_US |
dc.title |
Parallel distance transforms on a linear array architecture | en_US |
dc.type |
Article | en_US |
檔案
- 000174003100002.pdf (288.5 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chia, T., Wang, K., Chen, Z., & Lou, D. (2002). Parallel distance transforms on a linear array architecture. INFORMATION PROCESSING LETTERS, 82(2), 73–81. https://doi.org/10.1016/S0020-0190(01)00250-2
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/28852