2015
DOI: 10.3390/rs70505980
|View full text |Cite
|
Sign up to set email alerts
|

Image Segmentation Based on Constrained Spectral Variance Difference and Edge Penalty

Abstract: Segmentation, which is usually the first step in object-based image analysis (OBIA), greatly influences the quality of final OBIA results. In many existing multi-scale segmentation algorithms, a common problem is that under-segmentation and over-segmentation always coexist at any scale. To address this issue, we propose a new method that integrates the newly developed constrained spectral variance difference (CSVD) and the edge penalty (EP). First, initial segments are produced by a fast scan. Second, the gene… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(25 citation statements)
references
References 34 publications
0
24
0
1
Order By: Relevance
“…In the process of minor object elimination, the area ratio T − rat, the minimum similarity T − sim, and the minimal objects area T − min are set to 20%, 0.15, and 150 as suggested in Ref. [35]. The FNEA is embedded in the commercial software eCognition [36,42] and ready to use for comparison, working on the same initial segmentations in ADRM.…”
Section: Evaluation Methods and Metricsmentioning
confidence: 99%
See 1 more Smart Citation
“…In the process of minor object elimination, the area ratio T − rat, the minimum similarity T − sim, and the minimal objects area T − min are set to 20%, 0.15, and 150 as suggested in Ref. [35]. The FNEA is embedded in the commercial software eCognition [36,42] and ready to use for comparison, working on the same initial segmentations in ADRM.…”
Section: Evaluation Methods and Metricsmentioning
confidence: 99%
“…Likewise, cycle(R 4 , R 5 ) is constituted. Note that the global best [35] pair of regions must belong to the region pairs connected by cycle edges. Hence, it is a significant advantage to search among cycle edges for the global best pair since it can reduce the number of candidate pairs significantly.…”
Section: Dynamic Region Merging Based On Graph Modelsmentioning
confidence: 99%
“…When the spectral distance between adjacent regions was smaller than a metric, the adjacent segments were merged. Unlike other methods that use less intuitive metrics as MC [14,15,19], we employed an intuitive and physically-defined metric, SA as the MC. A preset SA threshold α was needed to determine if the spectral distance between two segments is close enough for them to be merged.…”
Section: Merging Criteriamentioning
confidence: 99%
“…Edge-based algorithms fracture the underlying images based on perceivable edges inferred by the dissimilarity between neighboring pixels [12]. However, edge-based algorithms are sensitive to noise or texture variation, thus apt to render over-segmentation around textured regions [14]. On the other hand, region-based algorithms exploit homogeneity or heterogeneity of adjacent regions to improve the robustness of the segmentation results against noise [13,15].…”
Section: Introductionmentioning
confidence: 99%
“…are in use for clustering high spatial resolution remote sensing images. Application of these approaches for clustering of images either leads to under-segmentation or over-segmentation [19,20]. Structural image indexing approach [21], semisupervised feature learning approach [22] and multi-scale manner using SVM approach [23] are also found fairly suitable in clustering high resolution images.…”
Section: Introductionmentioning
confidence: 99%