DOI QR코드

DOI QR Code

An Efficient Median Filter Algorithm for Floating-point Images

부동소수점 형식 이미지를 위한 효율적인 중간값 필터 알고리즘

  • Kim, Jin Wook (Dept. of Computer Science, Korea National Open University)
  • Received : 2022.06.06
  • Accepted : 2022.06.23
  • Published : 2022.06.30

Abstract

Floating-point images that express pixel information as real numbers are used in HDR images. There have been various researches on efficient median filter algorithms, but most of them are applicable to 8-bit depth images and there are only a few number of algorithms applicable to floating-point images, including Gil and Werman's algorithm. In this paper, we propose a median filter algorithm that works efficiently on floating-point images by improving Kim's algorithm, which improved Gil and Werman's algorithm. Experimental results show that the execution time is improved by about 10% compared to the Kim's algorithm by reducing the redundant work for the repetitively used binary search tree and applying the inverted index.

픽셀의 정보를 실숫값으로 표현하는 부동소수점 형식 이미지는 HDR 이미지 등에서 사용된다. 효율적인 중간값 필터 알고리즘에 관한 연구는 다양하게 이뤄졌지만 대부분 8비트 깊이 이하의 이미지에 적용할 수 있고 부동소수점 형식 이미지에 적용할 수 있는 알고리즘은 Gil과 Werman의 알고리즘을 비롯하여 제한적으로만 존재한다. 본 논문에서는 Gil과 Werman의 알고리즘을 개선한 Kim의 알고리즘을 다시 개선하여 부동소수점 형식 이미지에 대해 효율적으로 동작하는 중간값 필터 알고리즘을 제안한다. 반복적으로 사용되는 이진 탐색 트리에 대한 중복 작업을 줄이고 역인덱스를 적용하여 실험 결과 Kim 알고리즘보다 약 10% 수행시간이 향상됨을 보인다.

Keywords

Acknowledgement

This research was supported by Korea National Open University Research Fund

References

  1. M. Le Pendu, C. Guillemot and D. Thoreau, "Adaptive Re-Quantization for High Dynamic Range Video Compression," in Proc. of 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.7367-7371, 2014. DOI: 10.1109/ICASSP.2014.6855031
  2. A. Darmont, High Dynamic Range Imaging: Sensors and Architectures, SPIE press, 2013.
  3. T. Fang, "On Performance of Lossless Compression for HDR image Quantized in Color Space," Signal Processing: Image Communication, vol.24, no.5, pp.397-404, 2009. DOI: 10.1016/j.image.2009.01.002
  4. R. Chityala and S. Pudipeddi, Image Processing and Acquisition using Python, 2nd ed. CRC Press, 2021.
  5. P. Maragos and R. Schafer, "Morphological Filters-Part II: Their Relations to Median, Order-Statistic Filters," IEEE Trans. on Acoustics, Speech, Signal Processing, vol.35, no.8, pp.1170-1184, 1987. DOI: 10.1109/TASSP.1987.1165254
  6. D. Mayerich, B. H. McCormick and J. Keyser, "Noise and Artifact Removal in Knife-Edge Scanning Microscopy," ISBI, pp.556-559, 2007. DOI: 10.1109/ISBI.2007.356912
  7. Y. Choe, L. C. Abbott, D. Han, P. S. Huang, J. Keyser, J. Kwon, D. Mayerich, Z. Melek and B. H. McCormick, "Knife-Edge Scanning Microscopy: High-Throughput Imaging and Analysis of Massive Volumnes of Biological Microstructures," High-Throughput Image Reconstruction and Analysis: Intelligent Microscopy Applications, pp.11-37, 2008.
  8. J. Lee, W. An and Y. Choe, "Mapping the Full Vascular Network in the Mouse Brain at Submicrometer Resolution," 39th Annual International Conference of the IEEE EMBC, 2017. DOI: 10.1109/EMBC.2017.8037564
  9. T. Huang, G. Yang and G. Tang, "A Fast Two-Dimensional Median Filtering Algorithm," IEEE Trans. on Acoustics, Speech and Signal Processing, vol.27, pp.13-18, 1979. DOI: 10.1109/TASSP.1979.1163188
  10. B. Weiss, "Fast Median and Bilateral Filtering," ACM Trans. Graph., vol.25, pp.519-526, 2006. DOI: 10.1145/1141911.1141918
  11. S. Perreault and Patrick Hebert, "Median Filtering in Constant Time," IEEE Trans. on Image Processing, vol.16, no.9, pp.2389-2394, 2007. DOI: 10.1109/TIP.2007.902329
  12. A. Alekseychuk, "Hierarchical Recursive Running Median," 19th IEEE International Conference on Image Processing, pp.109-112, 2012.
  13. K. D. Sherwin and K. I. Wang, "Median Filters on FPGAs for Infinite Data and Large, Rectangular Windows," ACM Trans. Reconfig. Technol. Syst., 2022. DOI: 10.1145/3530273
  14. P. Szanto and B. Feher, "Hierarchical Histogram-based Median Filter for GPUs," Acta Polytechnica Hungarica, vol.15, no.2, pp.49-68, 2018. https://doi.org/10.12700/APH.15.7.2018.7.3
  15. R. W. Floyd and R. L. Rivest, "Algorithm 489: the Algorithm SELECT - for Finding the i-th smallest of n elements [M1]," Communications of the ACM, vol.18, p.173, 1975. https://doi.org/10.1145/360680.360694
  16. R. J. Tibshirani, "Fast Computation of the Median by Successive Binning," arXiv:0806.3301v2 [stat.CO], 2009.
  17. J. Gil and M. Werman, "Computing 2-d Min, Median, and Max Filters," IEEE Trans. Pattern Anal. Mach. Intell., vol.15, no.5, pp.504-507, 1993. DOI: 10.1109/34.211471
  18. J. W. Kim, "Computing Median Filter for over 16-bit Depth Images," j.inst.Korean.electr.electron. eng, vol.24, no.2, pp.507-513, 2020. DOI: 10.7471/ikeee.2020.24.2.507