2014
DOI: 10.1186/1687-6180-2014-182
|View full text |Cite
|
Sign up to set email alerts
|

Texture classification using rotation invariant models on integrated local binary pattern and Zernike moments

Abstract: More and more attention has been paid to the invariant texture analysis, because the training and testing samples generally have not identical or similar orientations, or are not acquired from the same viewpoint in many practical applications, which often has negative influences on texture analysis. Local binary pattern (LBP) has been widely applied to texture classification due to its simplicity, efficiency, and rotation invariant property. In this paper, an integrated local binary pattern (ILBP) scheme inclu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 32 publications
0
6
0
Order By: Relevance
“…For verifying the role of multiple texture features, local binary pattern (LBP) [38] features are used to fuse in series GLCM ones because of the their advantages such as simpleness, validity, and spectrum form.…”
Section: Experimental Settingsmentioning
confidence: 99%
“…For verifying the role of multiple texture features, local binary pattern (LBP) [38] features are used to fuse in series GLCM ones because of the their advantages such as simpleness, validity, and spectrum form.…”
Section: Experimental Settingsmentioning
confidence: 99%
“…In the GLCM, component (1, 1) holds the esteem 1 because there is one and just case in the image where two, on a level plane bordering pixels have the qualities 1 and 1. Component (1,2) in the GLCM hold the esteem 2 since there are two cases in the image where two, equitably nearby pixels have the qualities 1 and 2. Component (1,3) in the GLCM has the esteem 0 because there are no events of two on a level plane neighboring pixels with the qualities 1 and 3.…”
Section: Grey Level Co-occurrence Matrixmentioning
confidence: 99%
“…Component (1,2) in the GLCM hold the esteem 2 since there are two cases in the image where two, equitably nearby pixels have the qualities 1 and 2. Component (1,3) in the GLCM has the esteem 0 because there are no events of two on a level plane neighboring pixels with the qualities 1 and 3. Grey co framework keeps preparing the info image, checking the image for other pixel sets (i, j) and recording the total in the relating component of the GLCM.GLCM tabulates the frequency of appearance of combination of gray levels in images.…”
Section: Grey Level Co-occurrence Matrixmentioning
confidence: 99%
See 1 more Smart Citation
“…Building on Zernike polynomials and the general theory of moments, Teague [26] derived the Zernike moments, in which the Zernike polynomials have been used as the basis functions for the moments, and applied them to visual pattern recognition [27]. This method has been widely applied in pattern recognition [28][29][30][31].…”
Section: Introductionmentioning
confidence: 99%