<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0500102</ARLID> <utime>20240111141013.8</utime><mtime>20190118235959.9</mtime>   <SCOPUS>85058892691</SCOPUS> <WOS>000455720600015</WOS>  <DOI>10.1109/TSP.2018.2887185</DOI>           <title language="eng" primary="1">Gradient Algorithms for Complex Non-Gaussian Independent Component/Vector Extraction, Question of Convergence</title>  <specification> <page_count>15 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0256727</ARLID><ISSN>1053-587X</ISSN><title>IEEE Transactions on Signal Processing</title><part_num/><part_title/><volume_id>67</volume_id><volume>4 (2019)</volume><page_num>1050-1064</page_num></serial>    <keyword>Blind source separation</keyword>   <keyword>blind source extraction</keyword>   <keyword>independent component analysis</keyword>   <keyword>independent vector analysis</keyword>    <author primary="1"> <ARLID>cav_un_auth*0230113</ARLID> <name1>Koldovský</name1> <name2>Z.</name2> <country>CZ</country> </author> <author primary="0"> <ARLID>cav_un_auth*0101212</ARLID> <name1>Tichavský</name1> <name2>Petr</name2> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept>Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department>SI</department> <institution>UTIA-B</institution> <full_dept>Department of Stochastic Informatics</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2019/SI/tichavsky-0500102.pdf</url> <source_size>1727 kB</source_size> </source> <source> <url>https://ieeexplore.ieee.org/document/8579170</url>  </source>        <cas_special> <project> <project_id>GA17-00902S</project_id> <agency>GA ČR</agency>  <ARLID>cav_un_auth*0345929</ARLID> </project>  <abstract language="eng" primary="1">We revise the problem of extracting one independent component from an instantaneous linear mixture of signals. The mixing matrix is parameterized by two vectors: one column of the mixing matrix, and one row of the demixing matrix. The separation is based on the non-Gaussianity of the source of interest, while the remaining background signals are assumed to be Gaussian. Three gradient-based estimation algorithms are derived using the maximum likelihood principle and are compared with the Natural Gradient algorithm for Independent Component Analysis and with One-Unit FastICA based on negentropy maximization. The ideas and algorithms are also generalized to the extraction of a vector component when the extraction proceeds jointly from a set of instantaneous mixtures. Throughout this paper, we address the problem concerning the size of the region of convergence for which the algorithms guarantee the extraction of the desired source. We show that the size is inﬂuenced by the signal-to-interference ratio on the input channels. Simulations comparing several algorithms conﬁrm this observation. They show a different size of the region of convergence under a scenario in which the source of interest is dominant or weak. Here, our proposed modiﬁcationsof the gradient methods, taking into account the dominance/weakness of the source, showimproved global convergence. </abstract>     <result_subspec>WOS</result_subspec> <RIV>BB</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10103</FORD2>    <reportyear>2020</reportyear>      <num_of_auth>2</num_of_auth>  <unknown tag="mrcbC52"> 4 A hod 4ah 20231122143746.0 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0293321</permalink>  <unknown tag="mrcbC64"> 1 Department of Stochastic Informatics UTIA-B 20201 ENGINEERING, ELECTRICAL &amp; ELECTRONIC </unknown>  <confidential>S</confidential>  <unknown tag="mrcbC86"> 2 Article Multidisciplinary Sciences </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">ENGINEERING.ELECTRICAL&amp;ELECTRONIC</unknown> <unknown tag="mrcbT16-f">5.217</unknown> <unknown tag="mrcbT16-g">0.871</unknown> <unknown tag="mrcbT16-h">8.7</unknown> <unknown tag="mrcbT16-i">0.05234</unknown> <unknown tag="mrcbT16-j">1.718</unknown> <unknown tag="mrcbT16-k">37840</unknown> <unknown tag="mrcbT16-q">314</unknown> <unknown tag="mrcbT16-s">2.098</unknown> <unknown tag="mrcbT16-y">43.38</unknown> <unknown tag="mrcbT16-x">6.59</unknown> <unknown tag="mrcbT16-3">9616</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">4.385</unknown> <unknown tag="mrcbT16-6">458</unknown> <unknown tag="mrcbT16-7">Q1</unknown> <unknown tag="mrcbT16-B">91.914</unknown> <unknown tag="mrcbT16-C">86.7</unknown> <unknown tag="mrcbT16-D">Q1*</unknown> <unknown tag="mrcbT16-E">Q1*</unknown> <unknown tag="mrcbT16-M">1.73</unknown> <unknown tag="mrcbT16-N">Q1</unknown> <unknown tag="mrcbT16-P">86.654</unknown> <arlyear>2019</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: tichavsky-0500102.pdf </unknown>    <unknown tag="mrcbU14"> 85058892691 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000455720600015 WOS </unknown> <unknown tag="mrcbU56"> 1727 kB </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256727 IEEE Transactions on Signal Processing 1053-587X 1941-0476 Roč. 67 č. 4 2019 1050 1064 </unknown> </cas_special> </bibitem>