Change Detection and Image Time Series Analysis 2 - Группа авторов

Скачать книгу

alt="images"/> indicates its parent node in the same quad-tree (k = 1, 2,..., K). Similarly, if
with
i.e. s is not on the leaves layer, then
denotes the set of its four children nodes in the same quad-tree. Finally, if
with
and
i.e. if s is neither in the first quad-tree of the series nor in the root of the other quad-trees, then
indicates its parent node in the (k – 1)-th quad-tree, i.e. in the quad-tree associated with the previous image of the series (see Figure 1.4). From a graph-theoretic perspective, if the sites in the quad-trees are meant as nodes in a graph, then the pairs (s, s–), (s, s=) and (s, r) with
define the corresponding edges.

      Figure 1.4. Quad-trees associated with the input multisensor and multiresolution time series and related notations. For a color version of this figure, see www.iste.co.uk/atto/change2.zip

      Given this multiple quad-tree topology, a probabilistic graphical model based on a hierarchical MRF is defined. It is made of a series of random fields associated with the various scales and connected by transition relations associated with the links

among the sites. In particular, the quad-trees are meant to be in cascade, consistently with the input time series. Let
be the class label of site
and let
be the corresponding time series of random fields associated with all multiscale layers. Each realization of
corresponds to a set of classification maps for all images in the series and all scales in the corresponding quad-trees.

are Markovian, both across scales and time
(Kato and Zerubia 2012):

(Li 2009; Kato and Zerubia 2012):

      [1.2]

      In the case of the first quad-tree in the series, these Markovianity and conditional independence assumptions are naturally adapted as follows

      [1.3]

      Finally, the feature vectors in the image time series

:

      [1.4]

      where p(·) denotes the PDF of continuous random variables and fields. Again, this assumption is widely accepted in the literature of latent MRF models (Li 2009; Kato and Zerubia 2012).

      To ease the notations, in the following, we will simply write the feature vector

) and the class label
of site
and cs, respectively, dropping the explicit dependence on k and
for the sake of clarity. For this reason, we will explain the formulation of the first proposed method in the case of a series composed of K = 2 images
acquired by two different sensors and at two different resolutions on the considered area. In this case, two quad-trees in cascade are used. The extension to the case K > 2 is straightforward.

the class label that maximizes the posterior marginal probability
i.e. the distribution of its own individual label, given all feature vectors in the image series (Li 2009; Kato and Zerubia 2012). This decision rule is especially advantageous in the case of hierarchical graphs because it penalizes classification errors as a function of the scale at which they occur. Intuitively, an error on a site in the leaves layer only directly affects the corresponding pixel, whereas an error in a single pixel in the root layer may propagate into many erroneously labeled pixels on the leaves layer. MPM correctly penalizes the latter scenario more strongly than the former (Laferté et al. 2000).

      As proven in Laferté et al. (2000) and Hedhli et al. (2016), under suitable conditional independence assumptions, the posterior marginal

can be recursively expressed as a function of the posterior marginal
of the parent node s– in the same quad-tree and, in the case k = 2, also of the posterior marginal
of the parent node s= in the previous quad-tree:

Скачать книгу