Abstract

In this paper, we present an unsupervised change detection approach in temporal sets of SAR images. The change detection is represented as a task of energy minimization and the energy function is minimized using graph cuts. Neighboring pixels are taken into account in a priority sequence according to their distance from the center pixel, and the energy function is formed based on Markov Random Field (MRF) model. Graph cuts algorithm is employed for computing maximum a-posteriori (MAP) estimates of the MRF. Experiments results obtained on a SAR data set confirm the effectiveness of the proposed approach. The comparisons between graph cuts algorithm and iterated conditional modes (ICM) algorithm about the quality of change map and running time of energy minimization illustrate that graph cuts algorithm is a huge improvement over ICM.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.