.png){kind=icon}
返回
PARALLEL IMPLEMENTATION OF THE BOX COUNTING ALGORITHM IN OPENCL
.png){kind=icon}
PRE
AI
DOI：10.1142/S0218348X15500231.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The box counting algorithm is a well-known method for the computation of the fractal dimension of an image. It is often implemented using a recursive subdivision of the image into a set of regular tiles or boxes. Parallel implementations often try to map the boxes to different compute units, and combine the results to get the total number of boxes intersecting a shape. This paper presents a novel and highly efficient method using Open Computing Language (OpenCL) kernels to perform the computation on a per-pixel basis. The mapping and reduction stages are performed in a single pass, and therefore require the enqueuing of only a single kernel. Each instance of the kernel updates the information pertaining to all the boxes containing the pixel, and simultaneously increments the box counters at multiple levels, thereby eliminating the need for another pass to perform the summation. The complete implementation and coding details of the proposed method are outlined. The performance of the method on different processors are analyzed with respect to varying image sizes.
Keyword:
Fractal Dimension
OpenCL Kernels
Box Counting Algorithm
Multifractal Analysis
Parallel Implementations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
2.9
论文数:
2.8K
被引数:
5.6K
机构
暂无机构信息
引用论文
分享收藏
Reduction in Tobacco Pollen Germination and Tube Elongation, Induced by Low Levels of Ozone.png)
Science
ScienceIF0
PREAI
分享收藏
查看更多内容