<?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 Re: Multi-frame image processing in Intel® Integrated Performance Primitives</title>
    <link>https://community.intel.com/t5/Intel-Integrated-Performance/Multi-frame-image-processing/m-p/901621#M12846</link>
    <description>&lt;DIV style="margin:0px;"&gt;
&lt;DIV id="quote_reply" style="width: 100%; margin-top: 5px;"&gt;
&lt;DIV style="margin-left:2px;margin-right:2px;"&gt;Quoting - &lt;A href="https://community.intel.com/en-us/profile/419914"&gt;Bob Hayes&lt;/A&gt;&lt;/DIV&gt;
&lt;DIV style="background-color:#E5E5E5; padding:5px;border: 1px; border-style: inset;margin-left:2px;margin-right:2px;"&gt;&lt;EM&gt;I'm trying to average large numbers of frames on a pixel basis. I.e., I want to calculate a frame, with each pixel value being the average of the previous n frames. It seems to me that IPP image functions are largely concerned with a single frame or at most two frames of video. Has anyone tried to solve this type of problem using IPP? I realize that this problem is often solved in HW by the camera, but I don't have that option. It is a data reduction issue: I'm not trying to do this at the framerate. While I realize that I can solve the problem by doing algebra on two frames at a time, I am curious if there are any optimized functions for this type of video processing problem. Perhaps it's more accurately viewed as a vector or math kernel implementation.&lt;BR /&gt;&lt;BR /&gt;Thanks.&lt;/EM&gt;&lt;/DIV&gt;
&lt;/DIV&gt;
&lt;/DIV&gt;
Hi Bob,&lt;BR /&gt;You could use the incremental mean calculation ( M(N) = (N-1)*M(N-1)/N + X(N)/N, where M(N) is the mean at frame N and X(N) is the pixel value at frame(N)) . But that means that your mean is the mean of all preceding frames. You can also use a running average approach: M(N) = lr*M(N-1) + (1-lr)*X(N)., where lr is a number between 0 and 1. That way the 'influence' of a frame will decay in time. Both versions are easily implemented in IPP.&lt;BR /&gt;&lt;BR /&gt;Hope this helps and with regards,&lt;BR /&gt;&lt;BR /&gt;Rob&lt;BR /&gt;</description>
    <pubDate>Tue, 27 Oct 2009 13:08:38 GMT</pubDate>
    <dc:creator>Rob_Ottenhoff</dc:creator>
    <dc:date>2009-10-27T13:08:38Z</dc:date>
    <item>
      <title>Multi-frame image processing</title>
      <link>https://community.intel.com/t5/Intel-Integrated-Performance/Multi-frame-image-processing/m-p/901620#M12845</link>
      <description>I'm trying to average large numbers of frames on a pixel basis. I.e., I want to calculate a frame, with each pixel value being the average of the previous n frames. It seems to me that IPP image functions are largely concerned with a single frame or at most two frames of video. Has anyone tried to solve this type of problem using IPP? I realize that this problem is often solved in HW by the camera, but I don't have that option. It is a data reduction issue: I'm not trying to do this at the framerate. While I realize that I can solve the problem by doing algebra on two frames at a time, I am curious if there are any optimized functions for this type of video processing problem. Perhaps it's more accurately viewed as a vector or math kernel implementation.&lt;BR /&gt;&lt;BR /&gt;Thanks.</description>
      <pubDate>Mon, 26 Oct 2009 21:46:23 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Integrated-Performance/Multi-frame-image-processing/m-p/901620#M12845</guid>
      <dc:creator>Bob_Hayes</dc:creator>
      <dc:date>2009-10-26T21:46:23Z</dc:date>
    </item>
    <item>
      <title>Re: Multi-frame image processing</title>
      <link>https://community.intel.com/t5/Intel-Integrated-Performance/Multi-frame-image-processing/m-p/901621#M12846</link>
      <description>&lt;DIV style="margin:0px;"&gt;
&lt;DIV id="quote_reply" style="width: 100%; margin-top: 5px;"&gt;
&lt;DIV style="margin-left:2px;margin-right:2px;"&gt;Quoting - &lt;A href="https://community.intel.com/en-us/profile/419914"&gt;Bob Hayes&lt;/A&gt;&lt;/DIV&gt;
&lt;DIV style="background-color:#E5E5E5; padding:5px;border: 1px; border-style: inset;margin-left:2px;margin-right:2px;"&gt;&lt;EM&gt;I'm trying to average large numbers of frames on a pixel basis. I.e., I want to calculate a frame, with each pixel value being the average of the previous n frames. It seems to me that IPP image functions are largely concerned with a single frame or at most two frames of video. Has anyone tried to solve this type of problem using IPP? I realize that this problem is often solved in HW by the camera, but I don't have that option. It is a data reduction issue: I'm not trying to do this at the framerate. While I realize that I can solve the problem by doing algebra on two frames at a time, I am curious if there are any optimized functions for this type of video processing problem. Perhaps it's more accurately viewed as a vector or math kernel implementation.&lt;BR /&gt;&lt;BR /&gt;Thanks.&lt;/EM&gt;&lt;/DIV&gt;
&lt;/DIV&gt;
&lt;/DIV&gt;
Hi Bob,&lt;BR /&gt;You could use the incremental mean calculation ( M(N) = (N-1)*M(N-1)/N + X(N)/N, where M(N) is the mean at frame N and X(N) is the pixel value at frame(N)) . But that means that your mean is the mean of all preceding frames. You can also use a running average approach: M(N) = lr*M(N-1) + (1-lr)*X(N)., where lr is a number between 0 and 1. That way the 'influence' of a frame will decay in time. Both versions are easily implemented in IPP.&lt;BR /&gt;&lt;BR /&gt;Hope this helps and with regards,&lt;BR /&gt;&lt;BR /&gt;Rob&lt;BR /&gt;</description>
      <pubDate>Tue, 27 Oct 2009 13:08:38 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Integrated-Performance/Multi-frame-image-processing/m-p/901621#M12846</guid>
      <dc:creator>Rob_Ottenhoff</dc:creator>
      <dc:date>2009-10-27T13:08:38Z</dc:date>
    </item>
  </channel>
</rss>

