AUTOMATIC MULTI-SCALE SEGMENTATION OF HIGH SPATIAL RESOLUTION SATELLITE IMAGES USING WATERSHEDS

Date

2013-07-26

Author

Sahin, Kerem
Ulusoy, İlkay

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

223
views

0
downloads

An automatic segmentation algorithm that is based on watersheds and region merging type multi-scale segmentation (MSS) is proposed, which can be used as the initial step of an object-based classifier. First, the image is segmented using watershed segmentation. Then, primitive segments are merged to create meaningful objects by the proposed hybrid region merging algorithm. During these steps, an unsupervised segmentation accuracy metric is considered so that best performing parameters of the proposed algorithm are determined automatically. By this way, the proposed segmentation algorithm has become fully automatic. Experiments are done on images taken from Google Earth (R) software. Algorithm performance is computed using the ground truths of these images. Also, results for some other Google Earth (R) images are presented for qualitative performance assessment.

Subject Keywords

Watershed Segmentation, Multi-Scale Segmentation, Automatic Segmentation, High Spatial Resolution Satellite Images, Object-Based Classification

URI

https://hdl.handle.net/11511/47973

DOI

https://doi.org/10.1109/igarss.2013.6723330

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Image segmentation with unified region and boundary characteristics within recursive shortest spanning tree Esen, E.; Alp, Y. K. (2007-06-13) The lack of boundary information in region based image segmentation algorithms resulted in many hybrid methods that integrate the complementary information sources of region and boundary, in order to increase the segmentation performance. In compliance with this trend, we propose a novel method to unify the region and boundary characteristics within the canonical Recursive Shortest Spanning Tree algorithm. The main idea is to incorporate the boundary information in the distance metric of RSST with minor cha...
Recursive shortest spanning tree algorithms for image segmentation Bayramoglu, NY; Bazlamaçcı, Cüneyt Fehmi (2005-11-24) Image segmentation has an important role in image processing and the speed of the segmentation algorithm may become a drawback for some applications. This study analyzes the run time performances of some variations of the Recursive Shortest Spanning Tree Algorithm (RSST) and proposes simple but effective modifications on these algorithms to improve their speeds. In addition, the effect of link weight cost function on the run time performance and the segmentation quality is examined. For further improvement ...
FUSION OF IMAGE SEGMENTATION ALGORITHMS USING CONSENSUS CLUSTERING Ozay, Mete; Yarman Vural, Fatoş Tunay; Kulkarni, Sanjeev R.; Poor, H. Vincent (2013-09-18) A new segmentation fusion method is proposed that ensembles the output of several segmentation algorithms applied on a remotely sensed image. The candidate segmentation sets are processed to achieve a consensus segmentation using a stochastic optimization algorithm based on the Filtered Stochastic BOEM (Best One Element Move) method. For this purpose, Filtered Stochastic BOEM is reformulated as a segmentation fusion problem by designing a new distance learning approach. The proposed algorithm also embeds th...
Image Annotation With Semi-Supervised Clustering Sayar, Ahmet; Yarman Vural, Fatoş Tunay (2009-09-16) Methods developed for image annotation usually make use of region clustering algorithms. Visual codebooks are generated from the region clusters of low level features. These codebooks are then, matched with the words of the text document related to the image, in various ways. In this paper, we supervise the clustering process by using three types of side information. The first one is the topic probability information obtained from the text document associated with the image. The second is the orientation an...
Efficient performance computations for trellis-coded modulation Abou Rajab, H; Yucel, MD (1999-06-01) In this letter, the algorithm given by Rouanne and Costello for the computation of the distance spectrum is improved for trellis-coded modulation schemes having uncoded bits, i.e., for trellis diagrams having parallel paths, It is shown that, when through a trellis corresponding to such kind of codes, all parallel transitions (labeled by signal selectors) between states are considered as a single branch labeled by a subset, then defining subset selector distance polynomials makes the computational complexit...

Citation Formats

K. Sahin and İ. Ulusoy, “AUTOMATIC MULTI-SCALE SEGMENTATION OF HIGH SPATIAL RESOLUTION SATELLITE IMAGES USING WATERSHEDS,” 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47973.