By Topic

Cache oblivious algorithm of average filtering in image processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mrityunjay Ghosh ; Department of MCA, Brainware Group of Institutions, Kolkata, India ; Srabani Mukhopadhyaya

Cache oblivious algorithms are cache conscious and cache efficient algorithms, independent of cache size of the computer system. We consider the simple average filtering algorithm in the field of image processing. This algorithm is used for image enhancement technique. The algorithm incurs huge number of cache misses while it processes the image matrix. We propose a cache oblivious version of average filtering algorithm. The new algorithm makes better utilization of cache than does original average filtering algorithm. The experiments indicate that the new algorithm performs better reducing the cache misses by at most 80% than its traditional counterpart being independent of cache size for various input matrices.

Published in:

Informatics, Electronics & Vision (ICIEV), 2012 International Conference on

Date of Conference:

18-19 May 2012