{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T15:14:30Z","timestamp":1718637270802},"reference-count":12,"publisher":"IGI Global","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>In this article for the separation of Super Gaussian and Sub-Gaussian signals, we have considered the Multi-User Kurtosis(MUK), Infomax (Information Maximization) and Extended Infomax algorithms. For Extended Infomax we have taken two different non-linear functions and new coefficients and for Infomax we have taken a single non-linear function. We have derived MUK algorithm with stochastic gradient update iteratively using MUK cost function abided by a Gram-Schmidt orthogonalization to project on to the criterion constraint. Amongst the various standards available for measuring blind source separation, Cross-correlation coefficient and Kurtosis are considered to analyze the performance of the algorithms. An important finding of this study, as is evident from the performance table, is that the Kurtosis and Correlation coefficient values are the most favorable for the Extended Infomax algorithm, when compared with the others.<\/jats:p>","DOI":"10.4018\/ijrsda.2019010101","type":"journal-article","created":{"date-parts":[[2018,12,12]],"date-time":"2018-12-12T15:34:28Z","timestamp":1544628868000},"page":"1-17","source":"Crossref","is-referenced-by-count":1,"title":["A Comparative Study of Infomax, Extended Infomax and Multi-User Kurtosis Algorithms for Blind Source Separation"],"prefix":"10.4018","volume":"6","author":[{"given":"Monorama","family":"Swaim","sequence":"first","affiliation":[{"name":"Silicon Institute of Technology, Bhubaneswar, IN"}]},{"given":"Rutuparna","family":"Panda","sequence":"additional","affiliation":[{"name":"Veer Surendra Sai University of Technology, Odisha, IN"}]},{"given":"Prithviraj","family":"Kabisatpathy","sequence":"additional","affiliation":[{"name":"C. V. Raman College of Engineering, Odisha, IN"}]}],"member":"2432","reference":[{"key":"IJRSDA.2019010101-0","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017746"},{"key":"IJRSDA.2019010101-1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1995.7.6.1129"},{"key":"IJRSDA.2019010101-2","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1995.7.6.1129"},{"key":"IJRSDA.2019010101-3","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(94)90029-9"},{"issue":"3","key":"IJRSDA.2019010101-4","first-page":"542","article-title":"Blind separation of independent sources from convolutive mixtures","volume":"E86-A","author":"P.Comon","year":"2003","journal-title":"IEICE Trans. on Fundamentals"},{"issue":"11","key":"IJRSDA.2019010101-5","first-page":"225","article-title":"ICA methods for blind source separation of instantaneous mixtures: A case study. Neural Information Process.","volume":"11","author":"N.Das","year":"2007","journal-title":"Letters and Reviews"},{"key":"IJRSDA.2019010101-6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2255046"},{"issue":"461","key":"IJRSDA.2019010101-7","first-page":"55","article-title":"A Method of Blind Source Separation for Mixed Voice Separation in Noisy and Reverberating Environment.","volume":"108","author":"M.Kadou","year":"2009","journal-title":"IEICE Tech. Rep."},{"key":"IJRSDA.2019010101-8","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016719"},{"key":"IJRSDA.2019010101-9","article-title":"A hybrid algorithm for blind source separation of a convolutive mixture of three speech sources","author":"S. F.Minhas","year":"2014","journal-title":"EURASIP Journal on Advances in Signal Processing"},{"key":"IJRSDA.2019010101-10","doi-asserted-by":"publisher","DOI":"10.1109\/78.887044"},{"key":"IJRSDA.2019010101-11","first-page":"619","author":"M.Swain","year":"2017","journal-title":"Study of a Multiuser Kurtosis Algorithm and an Information Maximization Algorithm for Blind Source Separation. In Computational Intelligence in Data Mining"}],"container-title":["International Journal of Rough Sets and Data Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=219807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T14:24:54Z","timestamp":1651847094000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJRSDA.2019010101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":12,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.4018\/ijrsda.2019010101","relation":{},"ISSN":["2334-4598","2334-4601"],"issn-type":[{"value":"2334-4598","type":"print"},{"value":"2334-4601","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}