FAST TWO-DIMENSIONAL MEDIAN FILTERING ALGORITHM.

T. S. Huang, G. J. Yang, G. Y. Tang

Research output: Contribution to conferencePaper

Abstract

A fast algorithm is presented for doing two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m multiplied by n, the computer time required is O(n).

Original languageEnglish (US)
Pages128-113
Number of pages16
StatePublished - Jan 1 2017
EventProc IEEE Comput Soc Conf Pattern Recognition Image Process - Chicago, IL, USA
Duration: May 31 1978Jun 2 1978

Conference

ConferenceProc IEEE Comput Soc Conf Pattern Recognition Image Process
CityChicago, IL, USA
Period5/31/786/2/78

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'FAST TWO-DIMENSIONAL MEDIAN FILTERING ALGORITHM.'. Together they form a unique fingerprint.

  • Cite this

    Huang, T. S., Yang, G. J., & Tang, G. Y. (2017). FAST TWO-DIMENSIONAL MEDIAN FILTERING ALGORITHM.. 128-113. Paper presented at Proc IEEE Comput Soc Conf Pattern Recognition Image Process, Chicago, IL, USA, .