• DocumentCode
    1491264
  • Title

    On fast running max-min filtering

  • Author

    Coltuc, Dinu ; Pitas, Ioannis

  • Author_Institution
    Res. Inst. for Electr. Eng., Bucharest, Romania
  • Volume
    44
  • Issue
    8
  • fYear
    1997
  • fDate
    8/1/1997 12:00:00 AM
  • Firstpage
    660
  • Lastpage
    663
  • Abstract
    The problem of fast running max/min filters for arbitrary size windows is addressed. The size of the filter window is increased to the least power of two greater than the given size and, the input sequence is expanded. The running max/min computation uses a fast algorithm for power of two window sizes. The computational complexity (comparisons per sample) of the proposed algorithm is very close to log2 n, where n is the size of the given window. A flexible hardware implementation for n ranging between two consecutive powers of two is discussed
  • Keywords
    computational complexity; digital filters; filtering theory; pipeline processing; computational complexity; fast algorithm; fast running max-min filtering; filter window size; flexible hardware implementation; running max/min computation; Circuits; Computational complexity; Digital signal processing; Filtering algorithms; Filters; Flowcharts; Hardware; Image processing; Informatics; Signal processing;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7130
  • Type

    jour

  • DOI
    10.1109/82.618040
  • Filename
    618040
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1491264