2021
DOI: 10.1007/s11042-021-11097-3
|View full text |Cite
|
Sign up to set email alerts
|

Deterministic multikernel extreme learning machine with fuzzy feature extraction for pattern classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 56 publications
0
3
0
Order By: Relevance
“…Among the patterns of the ceramic body, some of the patterns are line drafts, and the background is similar to a solid color; this part of the pattern is cut out, as shown in Figure 4 . It is conducive to the reuse of ceramic patterns, and it is also convenient for copying [ 19 , 20 ]. To extract texture patterns from images, it is necessary to use image matting technology; that is, in a relatively clean background, extract the required foreground texture images, and remove the useless background image; that is, put the required part of the image, an image processing algorithm separated from other parts [ 21 ].…”
Section: Image Registrationmentioning
confidence: 99%
“…Among the patterns of the ceramic body, some of the patterns are line drafts, and the background is similar to a solid color; this part of the pattern is cut out, as shown in Figure 4 . It is conducive to the reuse of ceramic patterns, and it is also convenient for copying [ 19 , 20 ]. To extract texture patterns from images, it is necessary to use image matting technology; that is, in a relatively clean background, extract the required foreground texture images, and remove the useless background image; that is, put the required part of the image, an image processing algorithm separated from other parts [ 21 ].…”
Section: Image Registrationmentioning
confidence: 99%
“…Given a training set {(x i , t i )}N i = 1, assuming MKELM uses K different kernel functions {g 1 (·,·), g 2 (·,·), …, g K (·,·)}, then MKELM can be expressed as: subject to constraints: where d i ∈ [0, 1] represents the weight coefficient of the ith kernel function; β ij ∈ R m is the weight vector from the jth sample to the output layer under the kth kernel function; g i (·,·) is the ith kernel function. The MKELM leverages a variety of kernel functions, including Gaussian, linear, polynomial, and Sigmoid, to enhance the model's capability [18,20]. These kernel functions are also utilized in this study to construct the MKELM model.…”
Section: The Principle Of Mkelmmentioning
confidence: 99%
“…This innovation in MKELM has offered new possibilities for handling complex data categorization tasks. Furthermore, Ahuja and Vishwakarma adopted a deterministic approach to MKELM, incorporating fuzzy feature extraction for pattern classifications [20]. Notably, their efforts aimed at resolving face recognition problems, demonstrating the advanced applications of MKELM methods.…”
Section: Introductionmentioning
confidence: 99%