2019 1st International Conference on Advances in Information Technology (ICAIT) 2019
DOI: 10.1109/icait47043.2019.8987396
|View full text |Cite
|
Sign up to set email alerts
|

Comparative Analysis of Fractional Order Calculus in Image Processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…K-nearest neighbors on the other hand, is efficient and can be implemented easily as per the user needs, [17] but the limiting factor of this algorithm is the computational speed is very less when the number of data sets increases, which also interprets the computational speed, is quite high for the fewest amount of data for the processing. This KNN algorithm operates with the basic principle of the amount of weights or the calculated distance among the query and the selective examples in the data set by the specific number which is variable defined as 'k', and this 'k' is the closest among the query, [9,19,20] then the selection will be done on the relevant frequency label of the data for the classification of pixel in the image data or it identifies the average labels for the regression operations, [21,22] in the regression based operation it can be quoted that the selection of the suitable 'k' for the required data serve for the best of the 'k' states which will be the best one for the exchange and selection of pixel data [6,7]. Whereas the KNN algorithm is the best for the less amount of the data pixels for the query and processing [8,13].…”
Section: Methodsmentioning
confidence: 99%
“…K-nearest neighbors on the other hand, is efficient and can be implemented easily as per the user needs, [17] but the limiting factor of this algorithm is the computational speed is very less when the number of data sets increases, which also interprets the computational speed, is quite high for the fewest amount of data for the processing. This KNN algorithm operates with the basic principle of the amount of weights or the calculated distance among the query and the selective examples in the data set by the specific number which is variable defined as 'k', and this 'k' is the closest among the query, [9,19,20] then the selection will be done on the relevant frequency label of the data for the classification of pixel in the image data or it identifies the average labels for the regression operations, [21,22] in the regression based operation it can be quoted that the selection of the suitable 'k' for the required data serve for the best of the 'k' states which will be the best one for the exchange and selection of pixel data [6,7]. Whereas the KNN algorithm is the best for the less amount of the data pixels for the query and processing [8,13].…”
Section: Methodsmentioning
confidence: 99%
“…Fractional calculus is widely used in research foundation in different domains such as engineering, computer science and others [1]. It is a well-known fact, that Fractional calculus is a method that results from the function to a non-integer order.…”
Section: Introductionmentioning
confidence: 99%