19 July 2012 in IEEE Signal Processing Letters
Hidden Markov models are very robust and have been widely used in a wide range of application fields; however, they can prove some limitations for data restoration under some complex situations. These latter include cases when the data to be recovered are nonstationary. The recent triplet Markov models have overcome such difficulty thanks to their rich formalism, that allows considering more complex data structures while keeping the computational complexity of the different algorithms linear to the data size. In this letter, we propose a new triplet Markov chain that allows the unsupervised restoration of random discrete data hidden with switching noise distributions. We also provide genuine parameters estimation and MPM restoration algorithms. The new model is validated through experiments conducted on synthetic data and on real images, whose results show its interest with respect to the standard hidden Markov chain.
18 March 2016 in IEEE Transactions on Fuzzy Systems
Hidden Markov models have been extended in many directions, leading to pairwise Markov models, triplet Markov models, or discriminative random fields, all of which have been successfully applied in many fields covering signal and image processing. The Dempster-Shafer theory of evidence has also shown its interest in a wide range of situations involving reasoning under uncertainty and/or information fusion. There are, however, only few works dealing with both of these modeling tools simultaneously. The aim of this paper, which falls under this category of works, is to propose a general evidential Markov model offering wide modeling and processing possibilities regarding information imprecision, sensor unreliability, and data fusion. The main interest of the proposed model relies in the possibility of achieving, easily, the Dempster-Shafer fusion without destroying the Markovianity.
1 July 2016 in International Journal of Approximate Reasoning
3 June 2014 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Hidden Markov chains have been shown to be inadequate for data modeling under some complex conditions. In this work, we address the problem of statistical modeling of phenomena involving two heterogeneous system states. Such phenomena may arise in biology or communications, among other fields. Namely, we consider that a sequence of meaningful words is to be searched within a whole observation that also contains arbitrary one-by-one symbols. Moreover, a word may be interrupted at some site to be carried on later. Applying plain hidden Markov chains to such data, while ignoring their specificity, yields unsatisfactory results. The Phasic triplet Markov chain, proposed in this paper, overcomes this difficulty by means of an auxiliary underlying process in accordance with the triplet Markov chains theory. Related Bayesian restoration techniques and parameters estimation procedures according to the new model are then described. Finally, to assess the performance of the proposed model against the conventional hidden Markov chain model, experiments are conducted on synthetic and real data.
21 October 2016 in IEEE Geoscience and Remote Sensing Letters
Hidden Markov fields have been extensively applied in the field of synthetic aperture radar (SAR) image processing, mainly for segmentation and change detection. In such models, the hidden process of interest $X$ is assumed to be a Markov field that is to be searched from an observable process Y. The possibility of such estimation lies, however, on several assumptions that turn out to be unsuitable for many natural systems. These models have then been extended in many directions, leading to triplet Markov fields among other extensions. A link has then been established between these models and the theory of evidence, opening new possibilities of uncertainty modeling and information fusion. The aim of this letter is to further generalize the hidden evidential Markov field (EMF) to consider more general forms of noise with application to unsupervised segmentation of SAR images. For parameters estimation, we use iterative conditional estimation, whereas maximization is performed through iterative conditional mode. The performance of the proposed model is assessed against the original EMF on real SAR images.
2 March 2020 in IEEE Transactions on Aerospace and Electronic Systems
Statistical modeling of synthetic aperture radar (SAR) data is a crucial step in SAR image processing. In this context, the generalized Gamma (GGamma) distribution, which generalizes many common distributions, has been applied to model SAR image statistics. Parameter estimation remains, however, a challenging step that conditions the quality of model fitting to data and thus, of the required processing. In this paper, we propose a novel parameter estimation method for GGamma distribution in the log-domain, named as the maximum likelihood and logarithmic cumulants (ML-LC) method. The ML-LC method constructs a novel scale-independent shape parameter estimator in the log-domain based on the Mellin transform and maximum likelihood estimation, and estimates the distribution parameters based on the multistart local search (MLS), gradient descent (GD), and bisection methods, rather than solving the system of highly nonlinear equations in the traditional estimations. The ML-LC method is able to estimate the GGamma distribution parameters more accurately. To assess the performance of our estimation method, we perform the goodness-of-fit test on simulated data and real SAR images. In addition, we apply the ML-LC method in some SAR image processing tasks covering image segmentation, classification, and change detection. The results obtained confirm the interest of the proposed ML-LC method.