Skip to main content
Log in

Fast rank algorithms based on multiscale histograms and lazy calculations

  • Mathematical Theory of Pattern Recognition
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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).

    Article  Google Scholar 

  2. S. Perreault and P. Hebert, “Median filtering in constant time,” IEEE Trans. Image Processing 16, 2389–2394 (2007).

    Article  MathSciNet  Google Scholar 

  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. 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. L. P. Yaroslavsky and V. Kim, “Rank algorithms for picture processing,” Comput. Vision, Graph. Image Processing 35, 234–258 (1986).

    Article  Google Scholar 

  6. B. Weiss, “Fast median and bilateral filtering,” ACM Trans. Graph. 25(3), 519–526 (2006).

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. V. Storozhilova.

Additional information

The article was translated by the authors.

Maria V. Storozhilova. Born 1991. Student at the chair of Mathematical Physics, Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University, Russia.

Areas of interest: mathematical methods of image processing, computer vision, image filtering and enhancement, noise suppression, medical image processing, modern programming techniques.

Dmitry V. Yurin. Born 1965. PhD, senior researcher at the laboratory of Mathematical Methods of Image Processing, Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University, Russia.

Areas of interest: mathematical methods of image processing, computer vision, primary information feature detection, image filtering, 3D recovery, image segmentation, image registration and mosaicing, modern programming techniques.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Storozhilova, M.V., Yurin, D.V. Fast rank algorithms based on multiscale histograms and lazy calculations. Pattern Recognit. Image Anal. 23, 367–374 (2013). https://doi.org/10.1134/S1054661813030127

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661813030127

Keywords

Navigation