open access

https://hdl.handle.net/2115/48855

O(1) bilateral filtering with low memory usage

英語

constant time algorithm

2010-09

IEEE

2010 17th IEEE International Conference on Image Processing (ICIP)

3301-3304

We propose a O(1) algorithm for bilateral filter with low memory usage. Bilateral filter can be converted into weighted histogram operation. Applying line buffers of column histograms, we can reduce the number of calculation needed to construct recursive center-weighted local histogram. Also our method have advantage in terms of memory requirements. We used a 2-GHz CPU with our method and achieved one million pixels per 0.5 sec operation and high PSNR over 40 dB without the need for temporary frame buffers or additional instructions (downsampling, SIMD instructions, or multi-thread operations).

会議発表論文

Accepted Manuscript

© 2010 IEEE. Reprinted, with permission, from Igarashi, M., Ikebe, M., Shimoyama, S., Yamano, K., Motohisa, J., O(1) bilateral filtering with low memory usage, 2010 17th IEEE International Conference on Image Processing (ICIP), Sep. 2010. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Hokkaido University products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.