2011 IEEE 23rd International Conference on Tools With Artificial Intelligence 2011
DOI: 10.1109/ictai.2011.25
|View full text |Cite
|
Sign up to set email alerts
|

A Simple Hierarchical Clustering Method for Improving Flame Pixel Classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…Our proposal uses the algorithm HCM presented in [13] (see Algorithm 1) for simplifying color images in order to decrease the number of colors. This method needs six parameters [13]: (i) original image; (ii) number of colors, which represents the number of representative colors that will be identified; (iii) outlier threshold, which represents the smaller permitted connected component size in terms of color frequency; (iv) a color space, which is the basis for graph creation values; (v) a distance measure, which is used to define the weight of graph edges; and (vi) number of nearest points considered during the graph creation. The computation time is directly related to the number of colors and, of course, to the adjacency relation of the graph, which will influence the graph size.…”
Section: Proposed Approachmentioning
confidence: 99%
See 4 more Smart Citations
“…Our proposal uses the algorithm HCM presented in [13] (see Algorithm 1) for simplifying color images in order to decrease the number of colors. This method needs six parameters [13]: (i) original image; (ii) number of colors, which represents the number of representative colors that will be identified; (iii) outlier threshold, which represents the smaller permitted connected component size in terms of color frequency; (iv) a color space, which is the basis for graph creation values; (v) a distance measure, which is used to define the weight of graph edges; and (vi) number of nearest points considered during the graph creation. The computation time is directly related to the number of colors and, of course, to the adjacency relation of the graph, which will influence the graph size.…”
Section: Proposed Approachmentioning
confidence: 99%
“…Color image segmentation aims to group image regions using some criterium, however the choice of a strategy for grouping is a difficult task, and it is dependent on the application domain. One approach to cope with this problem is to model an image as a grid graph whose vertices correspond to the pixels and the edges connect the nearest neighbor pixels and their labels represent a dissimilarity measure computed from the connected pixels [4,13] followed by the computation of a minimum spanning tree (MST). The first appearance of this tree in pattern recognition dates back to the seminal work of Zahn [15].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations