Efficient Incorporation of Markov Random Fields in Change Detection

Henrik Aanæs, Allan Aasbjerg Nielsen, Jens Michael Carstensen, Rasmus Larsen, Bjarne Kjær Ersbøll

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

340 Downloads (Pure)


Many change detection algorithms work by calculating the probability of change on a pixel-wise basis. This is a disadvantage since one is usually looking for regions of change, and such information is not used in pixel-wise classification - per definition. This issue becomes apparent in the face of noise, implying that the pixel-wise classifier is also noisy. There is thus a need for incorporating local homogeneity constraints into such a change detection framework. For this modelling task Markov Random Fields are suitable. Markov Random Fields have, however, previously been plagued by lack of efficient optimization methods or numerical solvers. We here address the issue of efficient incorporation of local homogeneity constraints into change detection algorithms. We do this by exploiting recent advances in graph based algorithms for Markov Random Fields. This is combined with an IR-MAD change detector, and demonstrated on real data with good results.
Original languageEnglish
Title of host publicationIEEE International Geoscience and remote sensing symposium
Publication date2009
ISBN (Print)978-1-4244-3394-0
Publication statusPublished - 2009
Event2009 IEEE International Geoscience and Remote Sensing Symposium - University of Cape Town, Cape Town, South Africa
Duration: 12 Jul 200917 Jul 2009


Conference2009 IEEE International Geoscience and Remote Sensing Symposium
LocationUniversity of Cape Town
Country/TerritorySouth Africa
CityCape Town

Bibliographical note

Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.


  • Markov Random Fields
  • IR-MAD
  • Homogeneity Constraints
  • Graph Based Algorithms
  • Change Detection


Dive into the research topics of 'Efficient Incorporation of Markov Random Fields in Change Detection'. Together they form a unique fingerprint.

Cite this