<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic median filtering in Intel® Integrated Performance Primitives</title>
    <link>https://community.intel.com/t5/Intel-Integrated-Performance/median-filtering/m-p/1092597#M24980</link>
    <description>Just started to work with the Intel Performance Primitives. Looks like a fantastic software library !

As a first test, I tried ippiFilterMedianBorder. The u8 and u16 versions are blazingly fast, ippiFilterMedianBorderr_32f_C1R is quite slow and ippiFilterMedianBorderr_32f_C3R and ippiFilterMedianBorderr_32f_AC4R are missing.

This suggests that the u8 and u16 implementation is based on histograms (e.g. as discussed in Fast Median and Bilateral Filtering,
Ben Weiss†, Shell &amp;amp; Slate Software Corp or in Median Filtering in Constant Time, Simon Perreault and Patrick Hébert).

However, for a fast floating-point implementation, may I suggest the "dancing links" solution described in "Median Filtering is Equivalent to Sorting
Jukka Suomela, Helsinki Institute for Information Technology HIIT" ?

The Intel document "[APMF] Fast Algorithms for Median Filtering, Application Note, Intel Corp. Document number 79835, 2001." doesn't seem to be available anywhere on the web.</description>
    <pubDate>Sun, 17 Apr 2016 06:05:38 GMT</pubDate>
    <dc:creator>Adriaan_van_Os</dc:creator>
    <dc:date>2016-04-17T06:05:38Z</dc:date>
    <item>
      <title>median filtering</title>
      <link>https://community.intel.com/t5/Intel-Integrated-Performance/median-filtering/m-p/1092597#M24980</link>
      <description>Just started to work with the Intel Performance Primitives. Looks like a fantastic software library !

As a first test, I tried ippiFilterMedianBorder. The u8 and u16 versions are blazingly fast, ippiFilterMedianBorderr_32f_C1R is quite slow and ippiFilterMedianBorderr_32f_C3R and ippiFilterMedianBorderr_32f_AC4R are missing.

This suggests that the u8 and u16 implementation is based on histograms (e.g. as discussed in Fast Median and Bilateral Filtering,
Ben Weiss†, Shell &amp;amp; Slate Software Corp or in Median Filtering in Constant Time, Simon Perreault and Patrick Hébert).

However, for a fast floating-point implementation, may I suggest the "dancing links" solution described in "Median Filtering is Equivalent to Sorting
Jukka Suomela, Helsinki Institute for Information Technology HIIT" ?

The Intel document "[APMF] Fast Algorithms for Median Filtering, Application Note, Intel Corp. Document number 79835, 2001." doesn't seem to be available anywhere on the web.</description>
      <pubDate>Sun, 17 Apr 2016 06:05:38 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Integrated-Performance/median-filtering/m-p/1092597#M24980</guid>
      <dc:creator>Adriaan_van_Os</dc:creator>
      <dc:date>2016-04-17T06:05:38Z</dc:date>
    </item>
  </channel>
</rss>

