z-logo
open-access-imgOpen Access
Guided image filtering using signal subspace projection
Author(s) -
Zhang YongQin,
Ding Yu,
Liu Jiaying,
Guo Zongming
Publication year - 2013
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2012.0351
Subject(s) - singular value decomposition , artificial intelligence , noise (video) , signal subspace , subspace topology , computer science , mathematics , image processing , pattern recognition (psychology) , filter (signal processing) , algorithm , computer vision , image (mathematics)
There are various image filtering approaches in computer vision and image processing that are effective for some types of noise, but they invariably make certain assumptions about the properties of the signal and/or noise which lack the generality for diverse image noise reduction. This study describes a novel generalised guided image filtering method with the reference image generated by signal subspace projection (SSP) technique. It adopts refined parallel analysis with Monte Carlo simulations to select the dimensionality of signal subspace in the patch‐based noisy images. The noiseless image is reconstructed from the noisy image projected onto the significant eigenimages by component analysis. Training/test image are utilised to determine the relationship between the optimal parameter value and noise deviation that maximises the output peak signal‐to‐noise ratio (PSNR). The optimal parameters of the proposed algorithm can be automatically selected using noise deviation estimation based on the smallest singular value of the patch‐based image by singular value decomposition (SVD). Finally, we present a quantitative and qualitative comparison of the proposed algorithm with the traditional guided filter and other state‐of‐the‐art methods with respect to the choice of the image patch and neighbourhood window sizes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here