29 April 2016 Memory efficient and constant time 2D-recursive spatial averaging filter for embedded implementations
Author Affiliations +
Spatial Averaging Filters (SAF) are extensively used in image processing for image smoothing and denoising. Their latest implementations have already achieved constant time computational complexity regardless of kernel size. However, all the existing O(1) algorithms require additional memory for temporary data storage. In order to minimize memory usage in embedded systems, we introduce a new two-dimensional recursive SAF. It uses previous resultant pixel values along both rows and columns to calculate the current one. It can achieve constant time computational complexity without using any additional memory usage. Experimental comparisons with previous SAF implementations shows that the proposed 2D-Recursive SAF does not require any additional memory while offering a computational time similar to the most efficient existing SAF algorithm. These features make it especially suitable for embedded systems with limited memory capacity.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qifeng Gan, Qifeng Gan, Lama Seoud, Lama Seoud, Houssem Ben Tahar, Houssem Ben Tahar, J.M. Pierre Langlois, J.M. Pierre Langlois, "Memory efficient and constant time 2D-recursive spatial averaging filter for embedded implementations", Proc. SPIE 9897, Real-Time Image and Video Processing 2016, 989705 (29 April 2016); doi: 10.1117/12.2223740; https://doi.org/10.1117/12.2223740


Error image aware content restoration
Proceedings of SPIE (December 08 2015)
Image Registration Algorithm For A PC-Based System
Proceedings of SPIE (January 17 1988)
Post-Filtering Of Transforms-Coded Irnagest
Proceedings of SPIE (December 15 1988)
Two-dimensional block diagonal LMS adaptive algorithm
Proceedings of SPIE (April 07 1993)

Back to Top