{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T18:51:15Z","timestamp":1699383075730},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p> For the purpose of estimating the mixing matrix under the nonstrictly sparse condition, this paper presents the algorithms to approximate the mixing matrix in two different situations in which the source vectors are 1-sparse and (m - 1)-sparse. When the source signals are 1-sparse, we use the generalized spherical coordinate transformation to convert the matrix of observation signals into the new one, which makes the process of estimating column A become the process of finding the center point of these new data. For the situation that source signals are (m - 1)-sparse, we propose a new algorithm for the underdetermined mixtures blind source separation based on hyperplane clustering. The algorithm firstly finds out the linearly independent vectors from the observations, and secondly determines all the normal vectors of hyperplanes by analyzing the number of observations that are in the same hyperplane. Finally, we identify the column vectors of the mixing matrix A by calculating the vectors which are orthogonal to the clustered normal vectors. These two new algorithms for estimating the mixing matrix are more suitable for the general cases as they have lower requirement for the sparsity of the observations. <\/jats:p>","DOI":"10.1142\/s0218001409006965","type":"journal-article","created":{"date-parts":[[2009,3,20]],"date-time":"2009-03-20T10:36:08Z","timestamp":1237545368000},"page":"71-85","source":"Crossref","is-referenced-by-count":6,"title":["A NEW ALGORITHM FOR THE UNDERDETERMINED BLIND SOURCE SEPARATION BASED ON SPARSE COMPONENT ANALYSIS"],"prefix":"10.1142","volume":"23","author":[{"given":"HAI-LIN","family":"LIU","sequence":"first","affiliation":[{"name":"Faculty of Applied Mathematics, Guangdong University of Technology, Guangzhou 510006, China"}]},{"given":"CHU-JUN","family":"YAO","sequence":"additional","affiliation":[{"name":"Faculty of Huali, Guangdong University of Technology, Guangzhou 510006, China"}]},{"given":"JIA-XUN","family":"HOU","sequence":"additional","affiliation":[{"name":"Faculty of Applied Mathematics, Guangdong University of Technology, Guangzhou 510006, China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.02.010"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-1684(01)00120-7"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/0470845899"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.849840"},{"key":"rf5","volume-title":"Mulitscale Optim. Meth.","author":"Georgiev P. G.","year":"2005"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-006-2020-8"},{"key":"rf7","first-page":"863","volume":"13","author":"Lee T. W.","journal-title":"Neural Comput."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015826"},{"key":"rf9","first-page":"423","volume":"54","author":"Li Y.","journal-title":"IEEE Trans. Sign. Process."},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1162\/089976604773717586"},{"key":"rf11","first-page":"2072","volume":"11","author":"Liu H. L.","journal-title":"Acta Electronica Sin."},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2007.02.004"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.828896"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001409006965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:17:31Z","timestamp":1565144251000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001409006965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":13,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2009,2]]}},"alternative-id":["10.1142\/S0218001409006965"],"URL":"https:\/\/doi.org\/10.1142\/s0218001409006965","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}