Pattern Recognition and Image Analysis

, Volume 23, Issue 3, pp 367–374 | Cite as

Fast rank algorithms based on multiscale histograms and lazy calculations

Mathematical Theory of Pattern Recognition
  • 125 Downloads

Abstract

Rank algorithms allow effective solutions for image smoothing and impulse noise suppression, but most of them are computationally complex. On the base of multiscale histograms, we propose algorithms for fast computations of EV and KNV neighborhood average, sliding equalization and search for an arbitrary element in a rank series (median filtering is a particular case of this algorithm). An approach using lazy calculations for fast updating of multiscale histograms is proposed. Using the developed algorithms, we have achieved a processing speed for EV and KNV neighborhood average algorithms that is close to the fastest known median filtering algorithm.

Keywords

rank algorithm image denoising image sharpening image filtering lazy calculations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Huang, G. Yang, and G. Tang. “A fast two-dimensional median filtering algorithm,” IEEE Trans. Acoust., Speech, Signal Proc. 27(1), 13–18 (1979).CrossRefGoogle Scholar
  2. 2.
    S. Perreault and P. Hebert, “Median filtering in constant time,” IEEE Trans. Image Processing 16, 2389–2394 (2007).CrossRefMathSciNetGoogle Scholar
  3. 3.
    M. V. Storozhilova and D. V. Yurin, “Fast rank algorithms based on multiscale histograms,” in Proc. 21st Int. Conf. on Computer Graphics GraphiCon’2011 (Moscow, 2011), pp. 132–135.Google Scholar
  4. 4.
    C. Tomasi and R. Manduchi, “Bilateral filtering for gray and color images,” in Proc. 6th Int. IEEE Conf. on Computer Vision (ICCV’98) (Bombay, Jan. 1998), pp. 839–846.Google Scholar
  5. 5.
    L. P. Yaroslavsky and V. Kim, “Rank algorithms for picture processing,” Comput. Vision, Graph. Image Processing 35, 234–258 (1986).CrossRefGoogle Scholar
  6. 6.
    B. Weiss, “Fast median and bilateral filtering,” ACM Trans. Graph. 25(3), 519–526 (2006).CrossRefGoogle Scholar
  7. 7.
    M. Storozhilova and D. Yurin, “Fast rank algorithms with multiscale histograms lazy updating,” in Proc. 8th Open German-Russian Workshop “Pattern Recognition and Image Understanding” (OGRW-8-2011) (Nizhni Novgorod, Nov. 2011), pp. 380–383.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2013

Authors and Affiliations

  1. 1.Laboratory of Mathematical Methods of Image Processing, Faculty of Computational Mathematics and CyberneticLomonosov Moscow State UniversityLeninskie Gory, MoscowRussia

Personalised recommendations