Incremental Distance Transforms (IDT)
| Autor: | Schouten, Theo E., van den Broek, Egon, Erçil, A., Çetin, M., Boyer, K., Lee, S.-W. |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Chamfer
Mathematical optimization Speedup Fast Exact Euclidean Distance (FEED) incremental implementation Euclidean geometry IR-73395 Software Science GeneralLiterature_REFERENCE(e.g. dictionaries encyclopedias glossaries) Mathematics EWI-18265 Pixel business.industry HMI-IE: Information Engineering Video processing Incremental Distance Transforms (IDT) METIS-270964 Euclidean distance distance maps/transforms Delta modulation Benchmark (computing) Artificial intelligence business Algorithm |
| Zdroj: | ICPR 2010 20th International conference on Pattern recognition, 23-26 August, 2010, pp. 237-240 ICPR 2010 20th International conference on Pattern recognition, 23-26 August, 2010, 237-240. Los Alamos : IEEE STARTPAGE=237;ENDPAGE=240;TITLE=ICPR 2010 20th International conference on Pattern recognition, 23-26 August, 2010 ICPR 20th IEEE International Conference on Pattern Recognition (ICPR 2010), 237-240 STARTPAGE=237;ENDPAGE=240;TITLE=20th IEEE International Conference on Pattern Recognition (ICPR 2010) |
| Popis: | A new generic scheme for incremental implementations of distance transforms (DT) is presented: Incremental Distance Transforms (IDT). This scheme is applied on the city-block, Chamfer, and three recent exact Euclidean DT (E2DT). A benchmark shows that for all five DT, the incremental implementation results in a significant speedup: 3.4 -10 times. However, significant differences (i.e., up to 12.5 times) among the DT remain present. The FEED transform, one of the recent E2DT, even showed to be faster than both city-block and Chamfer DT. So, through a very efficient incremental processing scheme for DT, a relief is found for E2DT's computational burden. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|