Pattern Recognition and Image Analysis

, Volume 23, Issue 3, pp 367–374

Fast rank algorithms based on multiscale histograms and lazy calculations

Mathematical Theory of Pattern Recognition

DOI: 10.1134/S1054661813030127

Cite this article as:
Storozhilova, M.V. & Yurin, D.V. Pattern Recognit. Image Anal. (2013) 23: 367. doi:10.1134/S1054661813030127
  • 114 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 

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