Memory efficient and constant time 2D-recursive spatial averaging filter for embedded implementations

DOIResolve DOI: http://doi.org/10.1117/12.2223740
AuthorSearch for: ; Search for: ; Search for: ; Search for:
EditorSearch for: Kehtarnavaz, Nasser; Search for: Carlsohn, Matthias F.
TypeArticle
Proceedings titleApplications of Real-Time Image Processing
Series titleSPIE Proceedings; no. 9897
ConferenceSPIE Photonics Europe, Sunday 3 April 2016, Brussels, Belgium
Pages989705
Subjectmean filtering; spatial averaging; memory efficient; recursion algorithm
AbstractSpatial 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.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC publication
This is a non-NRC publication

"Non-NRC publications" are publications authored by NRC employees prior to their employment by NRC.

NPARC number23000998
Export citationExport as RIS
Report a correctionReport a correction
Record identifier4e9b0bf2-eae9-4d36-9d86-4ea3d85898e8
Record created2016-11-25
Record modified2016-11-28
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)