2017
DOI: 10.1088/1742-6596/893/1/012055
|View full text |Cite
|
Sign up to set email alerts
|

Image indexing using color histogram and k-means clustering for optimization CBIR in image database

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 2 publications
0
1
0
Order By: Relevance
“…training pictures should be chosen for every of the categories, and once every element within the image (including those used as training set) are evaluated, and assigned to a land cover category, the accuracy of the classification needs to be assessed. [10] Unsupervised Classification: Categorization of digital image information by computer process based mostly only on the image statistics while not accessibility of training samples or a-priori data of the area. Category is not known and structure is to be discovered automatically.…”
Section: Local Binary Patternmentioning
confidence: 99%
See 2 more Smart Citations
“…training pictures should be chosen for every of the categories, and once every element within the image (including those used as training set) are evaluated, and assigned to a land cover category, the accuracy of the classification needs to be assessed. [10] Unsupervised Classification: Categorization of digital image information by computer process based mostly only on the image statistics while not accessibility of training samples or a-priori data of the area. Category is not known and structure is to be discovered automatically.…”
Section: Local Binary Patternmentioning
confidence: 99%
“…[10] Classification which has training and testing processes, wherever features extracted from training pictures are compared with those extracted from testing pictures. The image is then classified based on the matched features.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Simple and efficient: K-means clustering algorithm is a simple and efficient clustering algorithm, which is suitable for metal abrasive image segmentation tasks. Its principle is simple, the calculation speed is fast, and it can quickly process large-scale image data [14] 2. No prior knowledge required: The K-means clustering algorithm is an unsupervised learning method that does not require prior knowledge or labeled data.…”
Section: Algorithm Superioritymentioning
confidence: 99%
“…2: An example of the incremental frame for image portioning ii) K-Means Clustering: To obtain a cluster of regions, k-mean clustering was used. It is because is one of the most widely used clusterings and is the ease of implementation, simplicity, efficiency, and empirical success (Mamat et al, 2015;Zambre and Patil, 2013;Rejito et al, 2017). Fig.…”
Section: Step 2: Forming the Regionmentioning
confidence: 99%