Enhanced residual noise estimation of low rank approximation for image denoising
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Dai-Gyoung | - |
dc.contributor.author | Shamsi, Zahid Hussain | - |
dc.date.accessioned | 2021-06-22T11:43:25Z | - |
dc.date.available | 2021-06-22T11:43:25Z | - |
dc.date.issued | 2018-06 | - |
dc.identifier.issn | 0925-2312 | - |
dc.identifier.issn | 1872-8286 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/5852 | - |
dc.description.abstract | Recently, the application of rank minimization to image denoising has shown remarkable denoising results. However, due to iterative nature of low rank optimization, the estimation of noise for next iteration is an essential requirement after each iteration. In the existing approaches, the noise is estimated at the level of patches using l(2) norm based comparison of the observed image and its denoised version. Because of l(2) norm comparison, these patch-wise noise estimates may be affected in the presence of moderate and severe levels of noise. Also, the patch-wise noise estimates are inferred without considering the geometric details of a given image. Moreover, the number of iterations is pre-specified, heuristically, depending on the known initial noise in the image which limits the applicability of the existing algorithms for practical situation where the noise level is not a priori. In this paper, we attempt to address these limitations by introducing the notion of residual noise for iterative rank minimization. The estimation of residual noise also involves image geometry and statistical characteristics along with patch-wise comparison. In addition to more reliable noise estimation, the residual noise can also be employed as an effective stopping criterion for iterative denoising process. Furthermore, the residual noise estimation is a key factor for computation of thresholding weights, which in turn, yield a more reliable truncated singular value decomposition (SVD) for iterative rank minimization algorithms. Based on more precise truncated SVD, we propose to preserve geometric features like edges and texture in the presence of severe noise. Experimental results show that the proposed method provides better or equivalent results as compared to various state-of-the-art denoising algorithms. (c) 2018 Elsevier B.V. All rights reserved. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | Enhanced residual noise estimation of low rank approximation for image denoising | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1016/j.neucom.2018.02.063 | - |
dc.identifier.scopusid | 2-s2.0-85044268666 | - |
dc.identifier.wosid | 000429323200001 | - |
dc.identifier.bibliographicCitation | Neurocomputing, v.293, pp 1 - 11 | - |
dc.citation.title | Neurocomputing | - |
dc.citation.volume | 293 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 11 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.subject.keywordPlus | ANISOTROPIC DIFFUSION | - |
dc.subject.keywordPlus | REMOVAL | - |
dc.subject.keywordPlus | MINIMIZATION | - |
dc.subject.keywordPlus | SPARSE | - |
dc.subject.keywordPlus | SPACE | - |
dc.subject.keywordAuthor | Low rank minimization | - |
dc.subject.keywordAuthor | Nuclear norm | - |
dc.subject.keywordAuthor | Singular value decomposition | - |
dc.subject.keywordAuthor | Filtered noise | - |
dc.subject.keywordAuthor | Residual noise | - |
dc.subject.keywordAuthor | Denoising | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0925231218302236?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.