Mukundan, R.2016-04-212016-04-212015Mukundan, R. (2015) Parallel Implementation of the Box Counting Algorithm in OpenCL. Fractals, 23(3), pp. 1550023, 8pp.http://hdl.handle.net/10092/12052The 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 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 analysed with respect to varying image sizes.enPreprint of an article published in Fractals 23(3), 09/2015, 8 p. 10.1142/S0218348X15500231 © copyright World Scientific Publishing Company. http://www.worldscientific.com/worldscinet/fractalsfractal dimensionOpenCL kernalsBox counting algorithmMultifractal analysisParallel implementationsJournal ArticleField of Research::11 - Medical and Health Sciences::1103 - Clinical Sciences::110320 - Radiology and Organ ImagingFields of Research::46 - Information and computing sciences::4603 - Computer vision and multimedia computation::460306 - Image processinghttps://doi.org/10.1142/S0218348X15500231