A Largest Matching Area Approach to Image Denoising


Autoria(s): Gaston, Jack; Ji, Ming; Crookes, Daniel
Data(s)

25/03/2016

Formato

application/pdf

Identificador

http://pure.qub.ac.uk/portal/en/publications/a-largest-matching-area-approach-to-image-denoising(f4dcf27b-79b2-4a97-92c1-4c0cda762a81).html

http://dx.doi.org/10.1109/ICASSP.2016.7471865

http://pure.qub.ac.uk/ws/files/18161685/ICASSP2016_2.pdf

Idioma(s)

eng

Publicador

Institute of Electrical and Electronics Engineers (IEEE)

Direitos

info:eu-repo/semantics/openAccess

Fonte

Gaston , J , Ji , M & Crookes , D 2016 , A Largest Matching Area Approach to Image Denoising . in Proceedings of the 2016 IEEE International Conference on Acoustics, Speech and Signal Processing . Institute of Electrical and Electronics Engineers (IEEE) , pp. 1194-1198 , The 41st IEEE International Conference on Acoustics, Speech and Signal Processing , Shanghai , China , 20-25 March . DOI: 10.1109/ICASSP.2016.7471865

Tipo

contributionToPeriodical

Resumo

Given the success of patch-based approaches to image denoising,this paper addresses the ill-posed problem of patch size selection.Large patch sizes improve noise robustness in the presence of good matches, but can also lead to artefacts in textured regions due to the rare patch effect; smaller patch sizes reconstruct details more accurately but risk over-fitting to the noise in uniform regions. We propose to jointly optimize each matching patch’s identity and size for gray scale image denoising, and present several implementations.The new approach effectively selects the largest matching areas, subject to the constraints of the available data and noise level, to improve noise robustness. Experiments on standard test images demonstrate our approach’s ability to improve on fixed-size reconstruction, particularly at high noise levels, on smoother image regions.