Abstract
This paper describes the implementation of a library of low-level image processing algorithms. This library is divided into two families of algorithms, one for those that apply to the spatial domain (local histogram equalization, local average filter, median filter, Sobel edge detector, and histogram evaluation), and one for those that apply to the frequency domain (forward and inverse discrete Fourier Transform, amplitude of the forward discrete Fourier transform, forward and inverse discrete cosine transform, and Butterworth filters). The efficiency of these algorithms depends on the number of processors used, the method of combining results produced by different processors (e.g., sequentially or using a binary tree), and the time required for the combination of two independently produced results compared to the time required to produce them. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
