<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606204873</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128101004.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00034-014-9847-9</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00034-014-9847-9</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A Descent Algorithm-Based Parallel Variable Dual Matrix Model and Application to Blind Source Separation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[T.-J. Zeng, Q.-Y. Feng]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, we focus on the problem of blind source separation (BSS). To solve the problem efficiently, a new algorithm is proposed. First, a parallel variable dual-matrix model (PVDMM) that considers all the numerical relations between a mixing matrix and a separating matrix is proposed. Different constrained terms are used to construct the cost function for every sub-algorithm. These constrained terms reflect a numerical relation. Therefore, a number of undesired solutions are excluded, the search region is reduced, and the convergence efficiency of the algorithm is ultimately improved. Parallel sub-algorithms are proven to converge to a separable matrix only if the cost function approaches zero. Second, a descent algorithm (DA) as a PVDMM optimizing approach is proposed in this paper as well. Apparently, the efficiency of the algorithm depends completely on the DA. Unlike the traditional descent method, the DA defines step length by solving inequality instead of merely utilizing the Wolfe- or Armijo-type search rule. Stimulation results indicate that the DA can improve computational efficiency. Under mild conditions, the DA has been proven to have strong convergence properties. Numerical results also show that the method is very efficient and robust. Finally, we applied the combinative algorithm to the BSS problem. Computer simulations illustrate its good performance.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Blind source separation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Joint diagonalization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Parallel variable dual-matrix model</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Descent algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zeng</subfield>
   <subfield code="D">T.-J</subfield>
   <subfield code="u">School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Feng</subfield>
   <subfield code="D">Q.-Y</subfield>
   <subfield code="u">School of Information Science and Technology, Southwest Jiaotong University, Chengdu, 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/1(2015-01-01), 269-300</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">34:1&lt;269</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-014-9847-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-014-9847-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">Zeng</subfield>
   <subfield code="D">T.-J</subfield>
   <subfield code="u">School of Information Science and Technology, Southwest Jiaotong University, Chengdu, 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">Feng</subfield>
   <subfield code="D">Q.-Y</subfield>
   <subfield code="u">School of Information Science and Technology, Southwest Jiaotong University, Chengdu, 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/1(2015-01-01), 269-300</subfield>
   <subfield code="x">0278-081X</subfield>
   <subfield code="q">34:1&lt;269</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">34</subfield>
   <subfield code="o">34</subfield>
  </datafield>
 </record>
</collection>
