2008 IEEE Conference on Cybernetics and Intelligent Systems 2008
DOI: 10.1109/iccis.2008.4670856
|View full text |Cite
|
Sign up to set email alerts
|

Fast image segmentation using region merging with a k-Nearest Neighbor graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…The weakness is this method depends on the Lambda constant [30]. Some methods combine the classical approach with the neural network, such as combining the region-based method with k-NN [38]. Table 3 demonstrate the characteristic of each color space with the benefit and handicap, which then opened up a greater possibility of segmentation technique by utilizing the character of the spaces.…”
Section: Figure 3 Course Of the Studymentioning
confidence: 99%
See 1 more Smart Citation
“…The weakness is this method depends on the Lambda constant [30]. Some methods combine the classical approach with the neural network, such as combining the region-based method with k-NN [38]. Table 3 demonstrate the characteristic of each color space with the benefit and handicap, which then opened up a greater possibility of segmentation technique by utilizing the character of the spaces.…”
Section: Figure 3 Course Of the Studymentioning
confidence: 99%
“…They perform image enhancement followed by the dilation residue method to find the edges [45]. Liu et al in 2008 utilized the fast region imaging method, with the concept that all pixels with similar features should be segmented in the same region [46]. They focus on the relationship between nearby pixels instead of the whole image feature.…”
Section: Figure 3 Course Of the Studymentioning
confidence: 99%