Two fast algorithms for median ltering of images using parallel computers having 2-D mesh interconnections are given. Both algorithms assume that an n n image is loaded onto the mesh with one processing element per pixel. One algorithm performs median l-tering over d d neighborhoods in O(d 2) time and works with pixel values in an arbitrarily large range. This algorithm, while theoretically sub...

This paper presents a new motion estimation algorithm to improve the performance of the existing searching algorithms at a relative low computational cost. We try to amend the incorrect and/or inaccurate estimate of motion with higher precision by using adaptive weighted median filtering and its modifications. The median filter is well-known. A more general filter, called the Adaptively Weighte...

The main contributions of this paper are in designing fast and scalable parallel algorithms for selection and median filtering. Based on the radix-! representation of data and the prune-and-search approach, we first design a fast and scalable selection algorithm on the arrays with reconfigurable optical buses (AROB). To the authors’ knowledge, this is the most time efficient algorithm yet publi...

An image analysis algorithm is described that utilizes a Graphics Processor Unit (GPU) to detect in real-time the most shallow subsurface tissue layer present in an OCT image obtained by a prototype SDOCT corneal imaging system. The system has a scanning depth range of 6mm and can acquire 15 volumes per second at the cost of lower resolution and signal-to-noise ratio (SNR) than diagnostic OCT s...