1
|
Huang G, Wan Z, Liu X, Hui J, Wang Z, Zhang Z. Ship detection based on squeeze excitation skip-connection path networks for optical remote sensing images. Neurocomputing 2019. [DOI: 10.1016/j.neucom.2018.12.050] [Citation(s) in RCA: 17] [Impact Index Per Article: 2.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
|
2
|
Yang D, Fei R, Yao J, Gong M. Two-stage SAR image segmentation framework with an efficient union filter and multi-objective kernel clustering. Appl Soft Comput 2016. [DOI: 10.1016/j.asoc.2016.01.055] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
|
3
|
Du H, Wang Y, Dong X. Texture Image Segmentation Using Affinity Propagation and Spectral Clustering. INT J PATTERN RECOGN 2015. [DOI: 10.1142/s0218001415550095] [Citation(s) in RCA: 7] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
Abstract
Clustering is a popular and effective method for image segmentation. However, existing cluster methods often suffer the following problems: (1) Need a huge space and a lot of computation when the input data are large. (2) Need to assign some parameters (e.g. number of clusters) in advance which will affect the clustering results greatly. To save the space and computation, reduce the sensitivity of the parameters, and improve the effectiveness and efficiency of the clustering algorithms, we construct a new clustering algorithm for image segmentation. The new algorithm consists of two phases: coarsening clustering and exact clustering. First, we use Affinity Propagation (AP) algorithm for coarsening. Specifically, in order to save the space and computational cost, we only compute the similarity between each point and its t nearest neighbors, and get a condensed similarity matrix (with only t columns, where t << N and N is the number of data points). Second, to further improve the efficiency and effectiveness of the proposed algorithm, the Self-tuning Spectral Clustering (SSC) is used to the resulted points (the representative points gotten in the first phase) to do the exact clustering. As a result, the proposed algorithm can quickly and precisely realize the clustering for texture image segmentation. The experimental results show that the proposed algorithm is more efficient than the compared algorithms FCM, K-means and SOM.
Collapse
Affiliation(s)
- Hui Du
- School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi 710071, P. R. China
- College of Computer Science and Engineering, Northwest Normal University, Lanzhou, Gansu 710070, P. R. China
| | - Yuping Wang
- School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi 710071, P. R. China
| | - Xiaopan Dong
- School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi 710071, P. R. China
| |
Collapse
|