{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:36:38Z","timestamp":1768073798953,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T00:00:00Z","timestamp":1738195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T00:00:00Z","timestamp":1738195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201473"],"award-info":[{"award-number":["12201473"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62377019"],"award-info":[{"award-number":["62377019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171189"],"award-info":[{"award-number":["12171189"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science Foundation of Wuhan Institute of Technology","award":["K202256"],"award-info":[{"award-number":["K202256"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["CCNU24JC004"],"award-info":[{"award-number":["CCNU24JC004"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["CCNU24AI002"],"award-info":[{"award-number":["CCNU24AI002"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10915-025-02801-8","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T08:49:52Z","timestamp":1738226992000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Poisson Tensor Completion via Nonconvex Regularization and Nonlocal Self-Similarity for Multi-dimensional Image Recovery"],"prefix":"10.1007","volume":"102","author":[{"given":"Duo","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sijia","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5387-4129","authenticated-orcid":false,"given":"Xiongjun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,30]]},"reference":[{"issue":"3","key":"2801_CR1","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1109\/TIP.2010.2073477","volume":"20","author":"F Luisier","year":"2010","unstructured":"Luisier, F., Blu, T., Unser, M.: Image denoising in mixed Poisson\u2013Gaussian noise. IEEE Trans. Image Process. 20(3), 696\u2013708 (2010)","journal-title":"IEEE Trans. Image Process."},{"key":"2801_CR2","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhu, Y., Nichols, E., Wang, Q., Zhang, S., Smith, C., Howard, S.: A Poisson-Gaussian denoising dataset with real fluorescence microscopy images. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 11710\u201311718 (2019)","DOI":"10.1109\/CVPR.2019.01198"},{"issue":"2","key":"2801_CR3","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1093\/imaiai\/iaaa020","volume":"10","author":"AD McRae","year":"2021","unstructured":"McRae, A.D., Davenport, M.A.: Low-rank matrix completion and denoising under Poisson noise. Inform. Inference: J. IMA 10(2), 697\u2013720 (2021)","journal-title":"Inform. Inference: J. IMA"},{"issue":"6","key":"2801_CR4","doi-asserted-by":"crossref","first-page":"3636","DOI":"10.1109\/TIT.2016.2549040","volume":"62","author":"A Soni","year":"2016","unstructured":"Soni, A., Jain, S., Haupt, J., Gonella, S.: Noisy matrix completion under sparse factor models. IEEE Trans. Inform. Theory 62(6), 3636\u20133661 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"2801_CR5","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1109\/TSP.2015.2500192","volume":"64","author":"Y Cao","year":"2016","unstructured":"Cao, Y., Xie, Y.: Poisson matrix recovery and completion. IEEE Trans. Signal Process. 64(6), 1609\u20131620 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1\u20134","key":"2801_CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F.L.: The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6(1\u20134), 164\u2013189 (1927)","journal-title":"J. Math. Phys."},{"issue":"3","key":"2801_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"issue":"3","key":"2801_CR8","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"2801_CR9","doi-asserted-by":"crossref","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"2801_CR10","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., Cichocki, A.: Tensor ring decomposition. arXiv:1606.05535 (2016)"},{"key":"2801_CR11","doi-asserted-by":"crossref","unstructured":"Zheng, Y.-B., Huang, T.-Z., Zhao, X.-L., Zhao, Q., Jiang, T.-X.: Fully-connected tensor network decomposition and its application to higher-order tensor completion. In: Proceedings of the AAAI Conference on Artificial Intelligence vol. 35, pp. 11071\u201311078 (2021)","DOI":"10.1609\/aaai.v35i12.17321"},{"issue":"1","key":"2801_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/18M1203626","volume":"62","author":"D Hong","year":"2020","unstructured":"Hong, D., Kolda, T.G., Duersch, J.A.: Generalized canonical polyadic tensor decomposition. SIAM Rev. 62(1), 133\u2013163 (2020)","journal-title":"SIAM Rev."},{"issue":"6","key":"2801_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C.J., Lim, L.-H.: Most tensor problems are NP-hard. J. ACM 60(6), 45 (2013)","journal-title":"J. ACM"},{"issue":"1","key":"2801_CR14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2013","unstructured":"Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 208\u2013220 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2801_CR15","doi-asserted-by":"crossref","unstructured":"Mu, C., Huang, B., Wright, J., Goldfarb, D.: Square deal: Lower bounds and improved relaxations for tensor recovery. In: International Conference on Machine Learning, pp. 73\u201381. PMLR (2014)","DOI":"10.1109\/ICCV.2015.17"},{"issue":"5","key":"2801_CR16","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua, J.A., Phien, H.N., Tuan, H.D., Do, M.N.: Efficient tensor completion for color image and video recovery: low-rank tensor train. IEEE Trans. Image Process. 26(5), 2466\u20132479 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"2801_CR17","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1007\/s10915-019-01044-8","volume":"81","author":"M Ding","year":"2019","unstructured":"Ding, M., Huang, T.-Z., Ji, T.-Y., Zhao, X.-L., Yang, J.-H.: Low-rank tensor completion using matrix factorization based on tensor train rank and total variation. J. Sci. Comput. 81, 941\u2013964 (2019)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2801_CR18","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1109\/TNNLS.2022.3181378","volume":"35","author":"Y Qiu","year":"2024","unstructured":"Qiu, Y., Zhou, G., Zhao, Q., Xie, S.: Noisy tensor completion via low-rank tensor ring. IEEE Trans. Neural Netw. Learn. Syst. 35(1), 1127\u20131141 (2024)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"2801_CR19","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/s10915-022-01841-8","volume":"92","author":"Y-B Zheng","year":"2022","unstructured":"Zheng, Y.-B., Huang, T.-Z., Zhao, X.-L., Zhao, Q.: Tensor completion via fully-connected tensor network decomposition with regularized factors. J. Sci. Comput. 92(1), 8 (2022)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2801_CR20","doi-asserted-by":"crossref","first-page":"A474","DOI":"10.1137\/110841229","volume":"35","author":"CD Martin","year":"2013","unstructured":"Martin, C.D., Shafer, R., LaRue, B.: An order-p tensor factorization with applications in imaging. SIAM J. Sci. Comput. 35(1), A474\u2013A490 (2013)","journal-title":"SIAM J. Sci. Comput."},{"key":"2801_CR21","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1109\/TIP.2022.3155949","volume":"31","author":"W Qin","year":"2022","unstructured":"Qin, W., Wang, H., Zhang, F., Wang, J., Luo, X., Huang, T.: Low-rank high-order tensor completion with applications in visual data. IEEE Trans. Image Process. 31, 2433\u20132448 (2022)","journal-title":"IEEE Trans. Image Process."},{"key":"2801_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Ely, G., Aeron, S., Hao, N., Kilmer, M.: Novel methods for multilinear data completion and de-noising based on tensor-SVD. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3842\u20133849 (2014)","DOI":"10.1109\/CVPR.2014.485"},{"issue":"2","key":"2801_CR23","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/s10915-020-01356-0","volume":"85","author":"X Zhao","year":"2020","unstructured":"Zhao, X., Bai, M., Ng, M.K.: Nonconvex optimization for robust tensor completion from grossly sparse observations. J. Sci. Comput. 85(2), 46 (2020)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"2801_CR24","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/TPAMI.2019.2891760","volume":"42","author":"C Lu","year":"2020","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., Yan, S.: Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 925\u2013938 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"2801_CR25","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1109\/TNNLS.2021.3051650","volume":"33","author":"H Wang","year":"2022","unstructured":"Wang, H., Zhang, F., Wang, J., Huang, T., Huang, J., Liu, X.: Generalized nonconvex approach for low-tubal-rank tensor recovery. IEEE Trans. Neural Netw. Learn. Syst. 33(8), 3305\u20133319 (2022)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"3","key":"2801_CR26","doi-asserted-by":"crossref","first-page":"e2299","DOI":"10.1002\/nla.2299","volume":"27","author":"G Song","year":"2020","unstructured":"Song, G., Ng, M.K., Zhang, X.: Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebra Appl. 27(3), e2299 (2020)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"2801_CR27","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/s10915-021-01437-8","volume":"87","author":"D Qiu","year":"2021","unstructured":"Qiu, D., Bai, M., Ng, M.K., Zhang, X.: Robust low transformed multi-rank tensor methods for image alignment. J. Sci. Comput. 87(1), 24 (2021)","journal-title":"J. Sci. Comput."},{"key":"2801_CR28","first-page":"100479","volume":"13","author":"X Zhang","year":"2023","unstructured":"Zhang, X., Wu, J., Ng, M.K.: Multilinear multitask learning by transformed tensor singular value decomposition. Mach. Learn. Appl. 13, 100479 (2023)","journal-title":"Mach. Learn. Appl."},{"issue":"3","key":"2801_CR29","doi-asserted-by":"crossref","first-page":"035001","DOI":"10.1088\/1361-6420\/abd85b","volume":"37","author":"D Qiu","year":"2021","unstructured":"Qiu, D., Bai, M., Ng, M.K., Zhang, X.: Nonlocal robust tensor recovery with nonconvex regularization. Inverse Probl. 37(3), 035001 (2021)","journal-title":"Inverse Probl."},{"issue":"8","key":"2801_CR30","first-page":"4239","volume":"44","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Ng, M.K.: Low rank tensor completion with Poisson observations. IEEE Trans. Pattern Anal. Mach. Intell. 44(8), 4239\u20134251 (2022)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2801_CR31","doi-asserted-by":"crossref","first-page":"110735","DOI":"10.1016\/j.patcog.2024.110735","volume":"156","author":"Q Feng","year":"2024","unstructured":"Feng, Q., Hou, J., Kong, W., Xu, C., Wang, J.: Poisson tensor completion with transformed correlated total variation regularization. Pattern Recognit. 156, 110735 (2024)","journal-title":"Pattern Recognit."},{"issue":"456","key":"2801_CR32","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"2801_CR33","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/22M1473236","volume":"16","author":"K Gao","year":"2023","unstructured":"Gao, K., Huang, Z.-H.: Tensor robust principal component analysis via tensor fibered rank and $$\\ell _p$$ minimization. SIAM J. Imaging Sci. 16(1), 423\u2013460 (2023)","journal-title":"SIAM J. Imaging Sci."},{"issue":"6","key":"2801_CR34","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1109\/JSTSP.2018.2879185","volume":"12","author":"H Kong","year":"2018","unstructured":"Kong, H., Xie, X., Lin, Z.: t-Schatten-$$p$$ norm for low-rank tensor recovery. IEEE J. Sel. Topics Signal Process. 12(6), 1405\u20131419 (2018)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"2801_CR35","doi-asserted-by":"crossref","unstructured":"Qiu, D., Yang, B., Zhang, X.: Robust tensor completion via dictionary learning and generalized nonconvex regularization for visual data recovery. IEEE Trans. Circuits Syst. Video Technol. 34(11), 11026\u201311039 (2024)","DOI":"10.1109\/TCSVT.2024.3413992"},{"issue":"2","key":"2801_CR36","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10915-022-02006-3","volume":"93","author":"H He","year":"2022","unstructured":"He, H., Ling, C., Xie, W.: Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD. J. Sci. Comput. 93(2), 47 (2022)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"2801_CR37","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2022.3142846","volume":"68","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Ng, M.K.: Sparse nonnegative tensor factorization and completion with noisy observations. IEEE Trans. Inform. Theory 68(4), 2551\u20132572 (2022)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"2801_CR38","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1137\/18M1202311","volume":"12","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Ng, M.K.: A corrected tensor nuclear norm minimization method for noisy low-rank tensor completion. SIAM J. Imaging Sci. 12(2), 1231\u20131273 (2019)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1\u20132","key":"2801_CR39","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"2801_CR40","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.laa.2015.07.021","volume":"485","author":"E Kernfeld","year":"2015","unstructured":"Kernfeld, E., Kilmer, M., Aeron, S.: Tensor-tensor products with invertible linear transforms. Linear Algebra Appl. 485, 545\u2013570 (2015)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2801_CR41","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11425-015-5079-0","volume":"59","author":"Y Wen","year":"2016","unstructured":"Wen, Y., Chan, R., Zeng, T.: Primal-dual algorithms for total variation based image restoration under Poisson noise. Sci. China Math. 59(1), 141\u2013160 (2016)","journal-title":"Sci. China Math."},{"issue":"2","key":"2801_CR42","first-page":"894","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"11","key":"2801_CR43","doi-asserted-by":"crossref","first-page":"5714","DOI":"10.1109\/TSP.2012.2212015","volume":"60","author":"G Marjanovic","year":"2012","unstructured":"Marjanovic, G., Solo, V.: On $$ \\ell _q $$ optimization and matrix completion. IEEE Trans. Signal Process. 60(11), 5714\u20135724 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"35","key":"2801_CR44","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11(35), 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"2801_CR45","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: International Conference on Machine Learning, pp. 37\u201345. PMLR (2013)"},{"key":"2801_CR46","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.acha.2023.03.007","volume":"65","author":"G-J Song","year":"2023","unstructured":"Song, G.-J., Ng, M.K., Zhang, X.: Tensor completion by multi-rank via unitary transformation. Appl. Comput. Harmon. Anal. 65, 348\u2013373 (2023)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"8","key":"2801_CR47","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1109\/TIP.2007.901238","volume":"16","author":"K Dabov","year":"2007","unstructured":"Dabov, K., Foi, A., Katkovnik, V., Egiazarian, K.: Image denoising by sparse 3-D transform-domain collaborative filtering. IEEE Trans. Image Process. 16(8), 2080\u20132095 (2007)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"2801_CR48","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2801_CR49","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/140971518","volume":"8","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Dosovitskiy, A., Brox, T., Pock, T.: On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision. SIAM J. Imaging Sci. 8(1), 331\u2013372 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"2801_CR50","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","volume":"9","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Hao, R., Yin, W., Su, Z.: Parallel matrix factorization for low-rank tensor completion. Inverse Probl. Imaging 9(2), 601\u2013624 (2015)","journal-title":"Inverse Probl. Imaging"},{"key":"2801_CR51","doi-asserted-by":"crossref","first-page":"110678","DOI":"10.1016\/j.patcog.2024.110678","volume":"155","author":"S Yuan","year":"2024","unstructured":"Yuan, S., Huang, K.: A generalizable framework for low-rank tensor completion with numerical priors. Pattern Recognit. 155, 110678 (2024)","journal-title":"Pattern Recognit."},{"issue":"4","key":"2801_CR52","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIP.2003.819861","volume":"13","author":"Z Wang","year":"2004","unstructured":"Wang, Z., Bovik, A.C., Sheikh, H.R., Simoncelli, E.P.: Image quality assessment: from error visibility to structural similarity. IEEE Trans. Image Process. 13(4), 600\u2013612 (2004)","journal-title":"IEEE Trans. Image Process."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02801-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02801-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02801-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T17:41:49Z","timestamp":1739900509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02801-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,30]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2801"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02801-8","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,30]]},"assertion":[{"value":"7 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"76"}}