Parallel algorithms for regular architectures: meshes and pyramids
Parallel algorithms for regular architectures: meshes and pyramids
Communications of the ACM
Sorting on a mesh-connected parallel computer
Communications of the ACM
Two-Dimensional Digital Signal Processing II: Transforms and Median Filters
Two-Dimensional Digital Signal Processing II: Transforms and Median Filters
Computing 2-D Min, Median, and Max Filters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient serial and parallel algorithms for median filtering
IEEE Transactions on Signal Processing
Parallel Algorithms for Median Filtering on Arrays with Reconfigurable Optical Buses
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
| Hi-index | 0.01 |
Two fast algorithms for median filtering of images using parallel computers having 2-D mesh interconnections are given. Both algorithms assume that an n x n image is loaded onto the mesh with one processing element per pixel. One algorithm performs median filtering over d x d neighborhoods in O(d^2) time and works with pixel values in an arbitrarily large range. This algorithm, while theoretically suboptimal, achieves a lower constant than a previously published asymptotically-optimal algorithm and is simpler to program. The second algorithm assumes that the range of pixel values is limited and relatively small, and it accomplishes median filtering in O(d) time.