2010 International Conference on Electrical and Control Engineering 2010
DOI: 10.1109/icece.2010.346
|View full text |Cite
|
Sign up to set email alerts
|

Object-Oriented Port Detection Based on Mean Shift Segmentation

Abstract: In this paper, we propose a new method for port detection using remote sensing image. This technique is a combination of image segmentation and object-oriented detection. We use mean shift method to initially segment the remote sensing image. Based on the initial segmentation map we build the spatial adjacency relation of the regions. Significant department has been observed in object-oriented detection. Generally, ports have inherent characteristic of half close region of seawater. Convex polygon created by c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…The algorithm based on image segmentation which cleverly combines the regional color and edge information has recently become a hot research. The graph cut algorithm applying to the image is completed in 1989 by Greig et al [4][5][6], and subsequent studies have used a binary image, but its importance has not been in a very long time until the beginning of this century, Boykov et al [7][8][9], defined the definition of graph cut algorithm applying to image map and determined weights, and proposed a more efficient algorithm for solving the maximum flow based on the maximum flow algorithm of augmenting path algorithm. Their pioneering work led to the hot of image segmentation once again, and the algorithm based on image segmentation is endless.…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm based on image segmentation which cleverly combines the regional color and edge information has recently become a hot research. The graph cut algorithm applying to the image is completed in 1989 by Greig et al [4][5][6], and subsequent studies have used a binary image, but its importance has not been in a very long time until the beginning of this century, Boykov et al [7][8][9], defined the definition of graph cut algorithm applying to image map and determined weights, and proposed a more efficient algorithm for solving the maximum flow based on the maximum flow algorithm of augmenting path algorithm. Their pioneering work led to the hot of image segmentation once again, and the algorithm based on image segmentation is endless.…”
Section: Introductionmentioning
confidence: 99%