{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:00:09Z","timestamp":1760608809396,"version":"3.37.3"},"reference-count":16,"publisher":"Wiley","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People\u2019s Republic of China","doi-asserted-by":"publisher","award":["20120061110045","201115022","20121103"],"award-info":[{"award-number":["20120061110045","201115022","20121103"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007847","name":"Natural Science Foundation of Jilin Province","doi-asserted-by":"publisher","award":["20120061110045","201115022","20121103"],"award-info":[{"award-number":["20120061110045","201115022","20121103"]}],"id":[{"id":"10.13039\/100007847","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004032","name":"Jilin University","doi-asserted-by":"publisher","award":["20120061110045","201115022","20121103"],"award-info":[{"award-number":["20120061110045","201115022","20121103"]}],"id":[{"id":"10.13039\/501100004032","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>In a real world application, we seldom get all images at one time. Considering this case, if a company hired an employee, all his images information needs to be recorded into the system; if we rerun the face recognition algorithm, it will be time consuming. To address this problem, In this paper, firstly, we proposed a novel subspace incremental method called incremental graph regularized nonnegative matrix factorization (IGNMF) algorithm which imposes manifold into incremental nonnegative matrix factorization algorithm (INMF); thus, our new algorithm is able to preserve the geometric structure in the data under incremental study framework; secondly, considering we always get many face images belonging to one person or many different people as a batch, we improved our IGNMF algorithms to Batch-IGNMF algorithms (B-IGNMF), which implements incremental study in batches. Experiments show that (1) the recognition rate of our IGNMF and B-IGNMF algorithms is close to GNMF algorithm while it runs faster than GNMF. (2) The running times of our IGNMF and B-IGNMF algorithms are close to INMF while the recognition rate outperforms INMF. (3) Comparing with other popular NMF-based face recognition incremental algorithms, our IGNMF and B-IGNMF also outperform then both the recognition rate and the running time.<\/jats:p>","DOI":"10.1155\/2014\/928051","type":"journal-article","created":{"date-parts":[[2014,5,19]],"date-time":"2014-05-19T17:27:48Z","timestamp":1400520468000},"page":"1-10","source":"Crossref","is-referenced-by-count":11,"title":["Incremental Graph Regulated Nonnegative Matrix Factorization for Face Recognition"],"prefix":"10.1155","volume":"2014","author":[{"given":"Zhe-Zhou","family":"Yu","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun 130012, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Hao","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun 130012, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8268-0430","authenticated-orcid":true,"given":"Bin","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun 130012, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Chao","family":"Pang","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun 130012, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Cheng","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Jilin University, Changchun 130012, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"6","key":"1","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1109\/TKDE.2012.51","volume":"25","year":"2013","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"4","first-page":"1457","volume":"5","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.04.030"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2011.2157359"},{"journal-title":"Journal of Machine Learning Research","year":"2012","key":"10"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2008.918957"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2039050"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.09.002"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/410674"},{"issue":"7","key":"18","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/TNNLS.2012.2197827","volume":"23","year":"2012","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/34.879790"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954342"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2014\/928051.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2014\/928051.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2014\/928051.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T09:27:12Z","timestamp":1498123632000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2014\/928051\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":16,"alternative-id":["928051","928051"],"URL":"https:\/\/doi.org\/10.1155\/2014\/928051","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2014]]}}}