<?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 Others may have better in Intel® Integrated Performance Primitives</title>
    <link>https://community.intel.com/t5/Intel-Integrated-Performance/Fast-nearest-neighbor-computation/m-p/990379#M22224</link>
    <description>Others may have better suggestions, but in general IPP is a signal processing (1D) and image processing (2D) library.  For example, IPP has a nearest neighbor image resize algorithm which simply fills each point in the destination image with the single value at the "nearest" 2D coordinate in the source image.  A quick google search shows the 'ANN' library for nearest neighbor search with high dimensionality.  I have not used it, but is this the kind of functionality you're looking for?</description>
    <pubDate>Sat, 08 Sep 2012 01:16:40 GMT</pubDate>
    <dc:creator>Jeffrey_M_Intel1</dc:creator>
    <dc:date>2012-09-08T01:16:40Z</dc:date>
    <item>
      <title>Fast nearest neighbor computation</title>
      <link>https://community.intel.com/t5/Intel-Integrated-Performance/Fast-nearest-neighbor-computation/m-p/990378#M22223</link>
      <description>&lt;P&gt;Dear All,&lt;/P&gt;
&lt;P&gt;I am looking for good c++ libraries for fast computation of the nearest neighbor on relatevly large dataset (100000 entries) and relatively high dimension (10-20 dimensions). The number of queries will be as large as the point dataset.&lt;/P&gt;
&lt;P&gt;Do anyone know if such libraries are included in&amp;nbsp;the IPP?&lt;/P&gt;
&lt;P&gt;If not, may anyone redirect me to good libraries?&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;I thank you for your kind assistance.&lt;/P&gt;
&lt;P&gt;My best regards, TRD&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;
&lt;P&gt;P.S. As I am new in this forum, I am not sure this question fits with this subsection. In that case, I would kindly ask to be redirected to the good place.&lt;/P&gt;
&lt;P&gt;&lt;/P&gt;</description>
      <pubDate>Fri, 07 Sep 2012 09:32:06 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Integrated-Performance/Fast-nearest-neighbor-computation/m-p/990378#M22223</guid>
      <dc:creator>Giuseppe_P_1</dc:creator>
      <dc:date>2012-09-07T09:32:06Z</dc:date>
    </item>
    <item>
      <title>Others may have better</title>
      <link>https://community.intel.com/t5/Intel-Integrated-Performance/Fast-nearest-neighbor-computation/m-p/990379#M22224</link>
      <description>Others may have better suggestions, but in general IPP is a signal processing (1D) and image processing (2D) library.  For example, IPP has a nearest neighbor image resize algorithm which simply fills each point in the destination image with the single value at the "nearest" 2D coordinate in the source image.  A quick google search shows the 'ANN' library for nearest neighbor search with high dimensionality.  I have not used it, but is this the kind of functionality you're looking for?</description>
      <pubDate>Sat, 08 Sep 2012 01:16:40 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Integrated-Performance/Fast-nearest-neighbor-computation/m-p/990379#M22224</guid>
      <dc:creator>Jeffrey_M_Intel1</dc:creator>
      <dc:date>2012-09-08T01:16:40Z</dc:date>
    </item>
  </channel>
</rss>

