{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:26:25Z","timestamp":1771701985409,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811623790","type":"print"},{"value":"9789811623806","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-2380-6_15","type":"book-chapter","created":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:02:47Z","timestamp":1631782967000},"page":"165-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Algorithm for Image Deconvolution Based on a Rank Constrained Inverse Matrix Approximation Problem"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Soto-Quiros","sequence":"first","affiliation":[]},{"given":"Juan","family":"Jose Fallas-Monge","sequence":"additional","affiliation":[]},{"given":"Jeffry","family":"Chavarr\u00eda-Molina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"key":"15_CR1","unstructured":"Campisi P, Egiazarian K (2013) Blind image deconvolution: theory and applications. CRC Press"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Chung J, Chung M (2013) Computing optimal low-rank matrix approximations for image processing. In: Proceddings IEEE 2013 Asilomar conference on signals, systems and computers, pp 670\u2013674. https:\/\/doi.org\/10.1109\/ACSSC.2013.6810366","DOI":"10.1109\/ACSSC.2013.6810366"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Eckart C, Young G (1936) The approximation of one matrix by another of lower rank. Psychometrika 1(3):211\u2013218. https:\/\/doi.org\/10.1007\/BF02288367","DOI":"10.1007\/BF02288367"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Wu T, Sarmadi S, Venkatasubramanian V, Pothen A, Kalyanaraman A (2015) Fast SVD computations for synchrophasor algorithms. IEEE Trans Power Syst 31(2):1651\u20131652. https:\/\/doi.org\/10.1109\/TPWRS.2015.2412679","DOI":"10.1109\/TPWRS.2015.2412679"},{"key":"15_CR5","unstructured":"Allen-Zhu Z, Li Y (2016) LazySVD: even faster SVD decomposition yet without agonizing pain. In: Advances in neural information processing systems, 974\u2013982"},{"key":"15_CR6","unstructured":"Courrieu P (2005) Fast computation of Moore-Penrose inverse matrices. Neural information processing. Lett Rev 8(2):25\u201329"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Katsikis V, Pappas D (2008) Fast computing of the Moore-Penrose inverse matrix. Electron J Linear Algebra 17:637\u2013650. https:\/\/doi.org\/10.13001\/1081-3810.1287","DOI":"10.13001\/1081-3810.1287"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Lu S, Wang X, Zhang G, Zhou Z (2015) Effective algorithms of the Moore-Penrose inverse matrices for extreme learning machine. Intel Data Anal 19(4):743\u2013760. https:\/\/doi.org\/10.3233\/IDA-150743","DOI":"10.3233\/IDA-150743"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Barata J, Hussein M (2012) The Moore-Penrose pseudoinverse: a tutorial review of the theory. Brazilian J Phys 42:146\u2013165. https:\/\/doi.org\/10.1007\/s13538-011-0052-z","DOI":"10.1007\/s13538-011-0052-z"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Fazel M, Candes E, Recht B, Parrilo P (2008) Compressed sensing and robust recovery of low rank matrices. In: 42nd Asilomar conference on signals, systems and computers, pp 1043\u20131047. https:\/\/doi.org\/10.1109\/ACSSC.2008.5074571","DOI":"10.1109\/ACSSC.2008.5074571"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Zhou T, Tao D (2012) Bilateral random projections. In: IEEE international symposium on information theory proceedings, pp 1286\u20131290. https:\/\/doi.org\/10.1109\/ISIT.2012.6283064","DOI":"10.1109\/ISIT.2012.6283064"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Telfer B, Casasent D (1994) Fast method for updating robust pseudoinverse and Ho-Kashyap associative processors. IEEE Trans Syst Man Cybern 24(9):1387\u20131390. https:\/\/doi.org\/10.1109\/21.310515","DOI":"10.1109\/21.310515"},{"key":"15_CR13","unstructured":"Benson M, Frederickson P (1986) Fast parallel algorithms for the Moore-Penrose pseudo-inverse. In: Second conference on hypercube multiprocessors. https:\/\/www.osti.gov\/biblio\/7181991-fast-parallel-algorithms-moore-penrose-pseudo-inverse"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Halko N, Martinsson P, Tropp J (2011) Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288. https:\/\/doi.org\/10.1137\/090771806","DOI":"10.1137\/090771806"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Deshpande A, Vempala S (2006) Adaptive sampling and fast low-rank matrix approximation. In: Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Springer, pp 292\u2013303. https:\/\/doi.org\/10.1007\/11830924_28","DOI":"10.1007\/11830924_28"},{"key":"15_CR16","unstructured":"Dattorro J (2005) Convex optimization $$\\dagger $$ Euclidean distance geometry. Meboo Publishing. https:\/\/ccrma.stanford.edu\/~dattorro\/0976401304.pdf"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Cragon H (2000) Computer architecture and implementation. Cambridge University Press","DOI":"10.1017\/CBO9781139164412"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Soto-Quiros P, Torokhti A (2019) Improvement in accuracy for dimensionality reduction and reconstruction of noisy signals. Part II: the case of signal samples. Signal Process 154:272\u2013279. https:\/\/doi.org\/10.1016\/j.sigpro.2018.09.020","DOI":"10.1016\/j.sigpro.2018.09.020"},{"key":"15_CR19","unstructured":"NASA (2020) NASA solar system exploration database. Online, Accessed 10 Sept 2020. https:\/\/solarsystem.nasa.gov\/raw-images\/raw-image-viewer"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of Sixth International Congress on Information and Communication Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-2380-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:21:04Z","timestamp":1631784064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-2380-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,17]]},"ISBN":["9789811623790","9789811623806"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-2380-6_15","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,17]]},"assertion":[{"value":"17 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}