PARALLEL IMPLEMENTATION OF THE BOX COUNTING ALGORITHM IN OPENCL
نویسندگان
چکیده
منابع مشابه
Parallel Implementation of the Box Counting Algorithm in OpenCL
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 nov...
متن کاملdetermination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولPseudofractals and box counting algorithm
We show that for sets with the Hausdorff–Besicovitch dimension equal zero the box counting algorithm commonly used to calculate Renyi exponents (dq) can exhibit perfect scaling suggesting non zero dq’s. Properties of these pathological sets (pseudofractals) are investigated. Numerical, as well as analytical estimates for dq’s are obtained. A simple indicator is given to distinguish pseudofracta...
متن کاملOptimal Dynamic Box-Counting Algorithm
An optimal box-counting algorithm for estimating the fractal dimension of a nonempty set which changes over time is given. This nonstationary environment is characterized by the insertion of new points into the set and in many cases the deletion of some existing points from the set. In this setting, the issue at hand is to update the box-counting result at appropriate time intervals with low co...
متن کاملParallel Implementation of the Wu-Manber Algorithm Using the OpenCL Framework
One of the most significant issues of the computational biology is the multiple pattern matching for locating nucleotides and amino acid sequence patterns into biological databases. Sequential implementations for these processes have become inadequate, due to an increasing demand for more computational power. Graphic cards offer a high parallelism computational power improving the performance o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fractals
سال: 2015
ISSN: 0218-348X,1793-6543
DOI: 10.1142/s0218348x15500231