<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606205837</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128101009.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20151001xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00034-015-0021-9</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00034-015-0021-9</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Optimization of Filter Combination for Query by Humming</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Qiang Wang, Zhiyuan Guo, Jun Guo, Gang Liu]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In a multimedia information retrieval system, the response time to a query is crucial for user experience. For a practical QBH system, developers not only need to devise an effective method of melody match, but also need to consider the response speed to a query. Although the index-based methods can effectively reduce the latency, to meet the strict requirements in most real situations where, for example, the database contains hundreds of thousands of songs, further efforts are needed. To strike a balance between response speed and retrieval accuracy, this paper presents an optimal design for filter combination (FC) applied in a query by humming (QBH) system. In the design of FC, we first make use of a greedy algorithm to sort filters and then group filters to reduce the total number of levels of filters. To further accelerate the speed of retrieval and present results within a time limit, we adopt the dynamic programming to optimize the confidence threshold in each filter. The proposed methodology can greatly accelerate the retrieval process with the cost of sacrificing the least accuracy. A four-level filtering QBH system is evaluated on a large-scale database of 100,000 MIDI files. The experimental results demonstrate the feasibility of the proposed method.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2015</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Query by humming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Locality sensitive hashing</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Filter combination</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Dynamic programming</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Music information retrieval</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Wang</subfield>
   <subfield code="D">Qiang</subfield>
   <subfield code="u">China Electronics Technology Group Corporation No. 38 Research Institute, Hefei, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Guo</subfield>
   <subfield code="D">Zhiyuan</subfield>
   <subfield code="u">China Electronics Technology Group Corporation No. 38 Research Institute, Hefei, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Guo</subfield>
   <subfield code="D">Jun</subfield>
   <subfield code="u">Beijing University of Posts and Telecommunications, Beijing, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Liu</subfield>
   <subfield code="D">Gang</subfield>
   <subfield code="u">Beijing University of Posts and Telecommunications, Beijing, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Circuits, Systems, and Signal Processing</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">34/10(2015-10-01), 3373-3393</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">34:10&lt;3373</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">34</subfield>
   <subfield code="o">34</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00034-015-0021-9</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00034-015-0021-9</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Wang</subfield>
   <subfield code="D">Qiang</subfield>
   <subfield code="u">China Electronics Technology Group Corporation No. 38 Research Institute, Hefei, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Guo</subfield>
   <subfield code="D">Zhiyuan</subfield>
   <subfield code="u">China Electronics Technology Group Corporation No. 38 Research Institute, Hefei, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Guo</subfield>
   <subfield code="D">Jun</subfield>
   <subfield code="u">Beijing University of Posts and Telecommunications, Beijing, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Liu</subfield>
   <subfield code="D">Gang</subfield>
   <subfield code="u">Beijing University of Posts and Telecommunications, Beijing, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Circuits, Systems, and Signal Processing</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">34/10(2015-10-01), 3373-3393</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">34:10&lt;3373</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">34</subfield>
   <subfield code="o">34</subfield>
  </datafield>
 </record>
</collection>
