{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:35:31Z","timestamp":1730198131585,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1109\/apsipa.2015.7415348","type":"proceedings-article","created":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T19:11:46Z","timestamp":1459192306000},"page":"43-46","source":"Crossref","is-referenced-by-count":4,"title":["A fast automatic low-rank determination algorithm for noisy matrix completion"],"prefix":"10.1109","author":[{"given":"Tatsuya","family":"Yokota","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Non-local image inpainting using low-rank matrix completion","author":"li","year":"2014","journal-title":"Computer Graphics Forum"},{"key":"ref11","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"0","journal-title":"arXiv preprint arXiv 1009 5055 2010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxp008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2015.02.003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"journal-title":"Nonnegative Matrix and Tensor Factnrizations Applications to Exploratory Multi-way Data Analysis and Blind Source Separation","year":"2009","author":"cichocki","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref7","volume":"46","author":"hyvarinen","year":"2004","journal-title":"Independent Component Analysis"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref9","article-title":"A gradient descent algorithm on the Grassman manifold for matrix completion","author":"keshavan","year":"2009","journal-title":"arXiv preprint arXiv 0910 5260"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.07.021"}],"event":{"name":"2015 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)","start":{"date-parts":[[2015,12,16]]},"location":"Hong Kong","end":{"date-parts":[[2015,12,19]]}},"container-title":["2015 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7406495\/7415286\/07415348.pdf?arnumber=7415348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T14:55:11Z","timestamp":1490108111000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7415348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/apsipa.2015.7415348","relation":{},"subject":[],"published":{"date-parts":[[2015,12]]}}}