PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 1, 1979IEEE Transactions on Acoustics Speech and Signal Processing1,390 citations

A fast two-dimensional median filtering algorithm

View Full Paper
THThomas S. HuangGYGang YangGTGongguo Tang

Key Points

  • This research aims to develop a faster algorithm for two-dimensional median filtering.
  • Developed an algorithm based on storing and updating gray level histograms.
  • Algorithm operates with a window size of m × n.
  • Evaluated computer time efficiency in terms of O(n).
  • The new algorithm significantly reduces processing time compared to conventional sorting methods.
  • Achieved a time complexity of O(n) for processing images.
  • Improvement in speed allows for more efficient image processing applications.

Abstract

We present a fast algorithm for 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 × n, the computer time required is 0(n).

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Huang et al. (1979) studied this question.

synapsesocial.com/papers/69d75d53f44a16d01ef30908https://doi.org/10.1109/tassp.1979.1163188
Ask AI
Helpful
Bookmark
Share
View Full Paper