The application of cosegmentation in remote sensing image change detection can effectively overcome the salt and pepper phenomenon and generate multitemporal changing objects with consistent boundaries. Cosegmentation considers the image information, such as spectrum and texture, and mines the spatial neighborhood information between pixels. However, each pixel in the minimum cut/maximum flow algorithm for cosegmentation change detection is regarded as a node in the network flow diagram. This condition leads to a direct correlation between computation times and the number of nodes and edges in the diagram. It requires a large amount of computation and consumes excessive time for change detection of large areas. A superpixel segmentation method is combined into cosegmentation to solve this shortcoming. Simple linear iterative clustering is adopted to group pixels by using the similarity of features among pixels. Two-phase superpixels are overlaid to form the multitemporal consistent superpixel segmentation. Each superpixel block is regarded as a node for cosegmentation change detection, so as to reduce the number of nodes in the network flow diagram constructed by minimum cut/maximum flow. In this study, the Chinese GF-1 and Landsat satellite images are taken as examples, the overall accuracy of the change detection results is above 0.80, and the calculation time is only one-fifth of the original.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited