TY - JOUR
T1 - Noisy image block matching based on dissimilarity measure in discrete cosine transform domain
AU - De Jesús Martínez Felipe, Miguel
AU - Felipe Riverón, Edgardo Manuel
AU - Martínez Castro, Jesús Alberto
AU - Pogrebnyak, Oleksiy
N1 - Publisher Copyright:
© 2019-IOS Press and the authors. All rights reserved.
PY - 2019
Y1 - 2019
N2 - In this paper, the problem of image block similarity measuring in noisy environment is considered. In different practical applications often is necessary to find groups of similar image blocks within an ample search area. In such situation, the full search algorithm is very slow; apart, its accuracy is low due to the presence of noise. New algorithms for similar image block matching in noisy environment are presented. The algorithms are based on the dissimilarity measure calculated as the distance between image patches in the discrete cosine transform domain. The proposed algorithms perform the hierarchical search for the similar image blocks and hereby have a reduced complexity in comparison to the full search algorithm. Adjusting the radius of the distance calculation for spectral coefficient matching, the characteristics of the block matching algorithm can easily be adjusted to obtain a better accuracy of the matched block group. A higher accuracy is obtained using the local adaptation of the radius for the distance calculation outperforming the existing algorithms used to find groups of similar blocks in different applications, such as image noise filtering and image clustering. The performance of the different block matching algorithms were evaluated on the base of the proposed accuracy measure that uses as a reference the list of patches obtained with the full search algorithm in the absence of noise.
AB - In this paper, the problem of image block similarity measuring in noisy environment is considered. In different practical applications often is necessary to find groups of similar image blocks within an ample search area. In such situation, the full search algorithm is very slow; apart, its accuracy is low due to the presence of noise. New algorithms for similar image block matching in noisy environment are presented. The algorithms are based on the dissimilarity measure calculated as the distance between image patches in the discrete cosine transform domain. The proposed algorithms perform the hierarchical search for the similar image blocks and hereby have a reduced complexity in comparison to the full search algorithm. Adjusting the radius of the distance calculation for spectral coefficient matching, the characteristics of the block matching algorithm can easily be adjusted to obtain a better accuracy of the matched block group. A higher accuracy is obtained using the local adaptation of the radius for the distance calculation outperforming the existing algorithms used to find groups of similar blocks in different applications, such as image noise filtering and image clustering. The performance of the different block matching algorithms were evaluated on the base of the proposed accuracy measure that uses as a reference the list of patches obtained with the full search algorithm in the absence of noise.
KW - Discrete cosine transform
KW - Dissimilarity measure
KW - Hierarchical search
KW - Local adaptation
KW - Noisy image block matching
UR - http://www.scopus.com/inward/record.url?scp=85064665572&partnerID=8YFLogxK
U2 - 10.3233/JIFS-18533
DO - 10.3233/JIFS-18533
M3 - Artículo
AN - SCOPUS:85064665572
SN - 1064-1246
VL - 36
SP - 3169
EP - 3176
JO - Journal of Intelligent and Fuzzy Systems
JF - Journal of Intelligent and Fuzzy Systems
IS - 4
ER -