File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s11075-018-0621-0
- Scopus: eid_2-s2.0-85056355195
- WOS: WOS:000485980200014
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Lanczos method for large-scale quaternion singular value decomposition
Title | Lanczos method for large-scale quaternion singular value decomposition |
---|---|
Authors | |
Keywords | Color images Quaternion SVD Partial bidiagonalization Lanczos method |
Issue Date | 2019 |
Citation | Numerical Algorithms, 2019, v. 82 n. 2, p. 699-717 How to Cite? |
Abstract | © 2018, Springer Science+Business Media, LLC, part of Springer Nature. In many color image processing and recognition applications, one of the most important targets is to compute the optimal low-rank approximations to color images, which can be reconstructed with a small number of dominant singular value decomposition (SVD) triplets of quaternion matrices. All existing methods are designed to compute all SVD triplets of quaternion matrices at first and then to select the necessary dominant ones for reconstruction. This way costs quite a lot of operational flops and CPU times to compute many superfluous SVD triplets. In this paper, we propose a Lanczos-based method of computing partial (several dominant) SVD triplets of the large-scale quaternion matrices. The partial bidiagonalization of large-scale quaternion matrices is derived by using the Lanczos iteration, and the reorthogonalization and thick-restart techniques are also utilized in the implementation. An algorithm is presented to compute the partial quaternion singular value decomposition. Numerical examples, including principal component analysis, color face recognition, video compression and color image completion, illustrate that the performance of the developed Lanczos-based method for low-rank quaternion approximation is better than that of the state-of-the-art methods. |
Persistent Identifier | http://hdl.handle.net/10722/276616 |
ISSN | 2023 Impact Factor: 1.7 2023 SCImago Journal Rankings: 0.829 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jia, Zhigang | - |
dc.contributor.author | Ng, Michael K. | - |
dc.contributor.author | Song, Guang Jing | - |
dc.date.accessioned | 2019-09-18T08:34:09Z | - |
dc.date.available | 2019-09-18T08:34:09Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Numerical Algorithms, 2019, v. 82 n. 2, p. 699-717 | - |
dc.identifier.issn | 1017-1398 | - |
dc.identifier.uri | http://hdl.handle.net/10722/276616 | - |
dc.description.abstract | © 2018, Springer Science+Business Media, LLC, part of Springer Nature. In many color image processing and recognition applications, one of the most important targets is to compute the optimal low-rank approximations to color images, which can be reconstructed with a small number of dominant singular value decomposition (SVD) triplets of quaternion matrices. All existing methods are designed to compute all SVD triplets of quaternion matrices at first and then to select the necessary dominant ones for reconstruction. This way costs quite a lot of operational flops and CPU times to compute many superfluous SVD triplets. In this paper, we propose a Lanczos-based method of computing partial (several dominant) SVD triplets of the large-scale quaternion matrices. The partial bidiagonalization of large-scale quaternion matrices is derived by using the Lanczos iteration, and the reorthogonalization and thick-restart techniques are also utilized in the implementation. An algorithm is presented to compute the partial quaternion singular value decomposition. Numerical examples, including principal component analysis, color face recognition, video compression and color image completion, illustrate that the performance of the developed Lanczos-based method for low-rank quaternion approximation is better than that of the state-of-the-art methods. | - |
dc.language | eng | - |
dc.relation.ispartof | Numerical Algorithms | - |
dc.subject | Color images | - |
dc.subject | Quaternion SVD | - |
dc.subject | Partial bidiagonalization | - |
dc.subject | Lanczos method | - |
dc.title | Lanczos method for large-scale quaternion singular value decomposition | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s11075-018-0621-0 | - |
dc.identifier.scopus | eid_2-s2.0-85056355195 | - |
dc.identifier.volume | 82 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 699 | - |
dc.identifier.epage | 717 | - |
dc.identifier.eissn | 1572-9265 | - |
dc.identifier.isi | WOS:000485980200014 | - |
dc.identifier.issnl | 1017-1398 | - |