2019 12th International Conference on Developments in eSystems Engineering (DeSE) 2019
DOI: 10.1109/dese.2019.00038
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced Algorithm of Superpixel Segmentation Using Simple Linear Iterative Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…Paper [11] proposes an improved method based on simple linear iterative clustering (SLIC)). The advantage of the method in [11] is to reduce the number of initial values for performing the threshold estimate and the total time to perform the image segmentation process. The disadvantage of [11] is the good segmentation results for simple images only.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
See 2 more Smart Citations
“…Paper [11] proposes an improved method based on simple linear iterative clustering (SLIC)). The advantage of the method in [11] is to reduce the number of initial values for performing the threshold estimate and the total time to perform the image segmentation process. The disadvantage of [11] is the good segmentation results for simple images only.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
“…The advantage of the method in [11] is to reduce the number of initial values for performing the threshold estimate and the total time to perform the image segmentation process. The disadvantage of [11] is the good segmentation results for simple images only.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
See 1 more Smart Citation
“…In the field of image segmentation, it is a common method to cluster the pixel points with similar color, brightness or texture into the same super-pixel block by using graph theory and clustering theory. At present, normalized cut (NCuts) [10], weighted k-means [11], simple linear iterative clustering (SLIC) [12] and other algorithms are commonly used. However, these algorithms have high computational complexity, they ignore the relationship between local and global images, and fail to make full use of small image feature information.…”
Section: Lsc Super-pixel Segmentationmentioning
confidence: 99%
“…Finally, receive the clustering and segmentation result of the image. So as to confirm the segmentation capability of the AMR-WT-WTWPSC algorithm, we use two superpixel segmentation methods [43], [44] and the other three novel subspace learning methods to form seven comparison algorithms, namely SLIC-LRR, AMR-WT-LRR, SLIC-JMKSC, AMR-WT-JMKSC, SLIC-LRMKC, AMR-WT-LRMKC, and SLIC-WTSPSC. Then, perform image segmentation experiments with the AMR-WT-WTSPSC method on the BSDS500 dataset [45], The dataset contains a total of 500 natural images, such as: people, animals, plants, buildings and landscapes, etc.…”
Section: B Segmentation Experiments Of Amr-wt-wtspscmentioning
confidence: 99%