{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T14:10:44Z","timestamp":1756995044806,"version":"3.40.5"},"reference-count":37,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T00:00:00Z","timestamp":1586476800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Mathematics and Mathematical Sciences"],"published-print":{"date-parts":[[2020,4,10]]},"abstract":"<jats:p>This paper proposes an effective and robust method for image alignment and recovery on a set of linearly correlated data via Frobenius and <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:msub><mml:mrow><mml:mi>L<\/mml:mi><\/mml:mrow><mml:mrow><mml:mn>2,1<\/mml:mn><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> norms. The most popular and successful approach is to model the robust PCA problem as a low-rank matrix recovery problem in the presence of sparse corruption. The existing algorithms still lack in dealing with the potential impact of outliers and heavy sparse noises for image alignment and recovery. Thus, the new algorithm tackles the potential impact of outliers and heavy sparse noises via using novel ideas of affine transformations and Frobenius and <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><mml:mrow><mml:msub><mml:mrow><mml:mi>L<\/mml:mi><\/mml:mrow><mml:mrow><mml:mn>2,1<\/mml:mn><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> norms. To attain this, affine transformations and Frobenius and <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\"><mml:mrow><mml:msub><mml:mrow><mml:mi>L<\/mml:mi><\/mml:mrow><mml:mrow><mml:mn>2,1<\/mml:mn><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> norms are incorporated in the decomposition process. As such, the new algorithm is more resilient to errors, outliers, and occlusions. To solve the convex optimization involved, an alternating iterative process is also considered to alleviate the complexity. Conducted simulations on the recovery of face images and handwritten digits demonstrate the effectiveness of the new approach compared with the main state-of-the-art works.<\/jats:p>","DOI":"10.1155\/2020\/8136384","type":"journal-article","created":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:34:29Z","timestamp":1586561669000},"page":"1-9","source":"Crossref","is-referenced-by-count":7,"title":["New Robust Principal Component Analysis for Joint Image Alignment and Recovery via Affine Transformations, Frobenius and <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:msub><mml:mrow><mml:mi>L<\/mml:mi><\/mml:mrow><mml:mrow><mml:mn>2,1<\/mml:mn><\/mml:mrow><\/mml:msub><\/mml:mrow><\/mml:math> Norms"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9334-8588","authenticated-orcid":true,"given":"Habte Tadesse","family":"Likassa","sequence":"first","affiliation":[{"name":"Department of Statistics, Ambo University, Ambo, Ethiopia"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/jproc.2018.2853589"},{"first-page":"2080","volume-title":"Robust principal component analysis: exact recovery of corrupted low-rank matrices via convex optimization","year":"2009","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-5419-2"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/tcsvt.2015.2455711"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2012.88"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2015.2465956"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2014.02.015"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2932470"},{"first-page":"1089","volume-title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","year":"2011","key":"15"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2011.2158250"},{"issue":"6","key":"21","first-page":"1219","volume":"37","year":"2014","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2016.2555239"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2016.02.009"},{"issue":"1","key":"27","first-page":"749","volume":"15","year":"2014","journal-title":"The Journal of Machine Learning Research"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2018.2826566"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/tip.2018.2790481"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2017.2748590"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3339-y"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1137\/060655523"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/jproc.2018.2853141"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2009.191"},{"key":"38","first-page":"107","volume":"22","year":"2000","journal-title":"Departmental Papers (CIS)"},{"issue":"1","key":"39","first-page":"320","volume":"17","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.02.006"},{"volume":"26","year":"2012","key":"45"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2887260"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2880454"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2830771"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"volume":"10949","volume-title":"Accurate registration of in vivo time-lapse images","year":"2019","key":"52"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1109\/access.2015.2430359"},{"key":"54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011468"},{"issue":"4","key":"55","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","year":"2010","journal-title":"SIAM Journal on Optimization"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1137\/080730421"},{"key":"57","doi-asserted-by":"publisher","DOI":"10.1109\/tip.2003.819861"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1109\/34.291440"}],"container-title":["International Journal of Mathematics and Mathematical Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijmms\/2020\/8136384.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijmms\/2020\/8136384.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijmms\/2020\/8136384.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T23:31:44Z","timestamp":1587598304000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/ijmms\/2020\/8136384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,10]]},"references-count":37,"alternative-id":["8136384","8136384"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8136384","relation":{},"ISSN":["0161-1712","1687-0425"],"issn-type":[{"type":"print","value":"0161-1712"},{"type":"electronic","value":"1687-0425"}],"subject":[],"published":{"date-parts":[[2020,4,10]]}}}