z-logo
open-access-imgOpen Access
Super‐resolution reconstruction based on multisource bidirectional similarity and non‐local similarity matching
Author(s) -
Liang Meiyu,
Du Junping,
Cao Shouxin,
Li Linghui
Publication year - 2015
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.2014.0658
Subject(s) - artificial intelligence , similarity (geometry) , pattern recognition (psychology) , computer science , subpixel rendering , weighting , matching (statistics) , computer vision , structural similarity , mathematics , image (mathematics) , pixel , medicine , statistics , radiology
A novel super‐resolution (SR) reconstruction algorithm based on multisource bidirectional similarity and non‐local similarity matching for multi‐exposure dynamic image sequences is proposed in this study. First, luminance compensation for multi‐exposure dynamic images is implemented based on multisource bidirectional similarity. Then, combining a self‐adaptive regional correlation evaluation strategy and a weighting strategy based on pseudo‐Zernike moment feature similarity and structural similarity yields a novel and robust non‐local similarity matching scheme (PZ‐NSM) to learn non‐local similarity priors between low‐ and high‐resolution dynamic image patches at different spatio‐temporal scales without additional training. Finally, SR reconstruction is implemented based on PZ‐NSM and spatio‐temporal trans‐scale fusion of non‐local similarities between dynamic images. The proposed algorithm does not rely on accurate estimation of subpixel motion and can therefore be adapted to more complex motion patterns. It has high rotation invariance effectiveness and is robust to noise and illumination. Experimental results demonstrate that the proposed algorithm outperforms existing algorithms in terms of both subjective and objective evaluations.

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