Pairwise Markov Models and Hybrid Segmentation Approach

نویسندگان

چکیده

Abstract The article studies segmentation problem (also known as classification problem) with pairwise Markov models (PMMs). A PMM is a process where the observation and underlying state sequence form two-dimensional chain, it natural generalization of hidden model. To demonstrate richness class PMMs, we examine closer few examples rather different types PMMs: model for two related chains, that allows to an inhomogeneous chain conditional marginal homogeneous PMM, semi-Markov assumes one processes observed other not, estimate unobserved path given observations. standard estimators often used are so-called Viterbi (a maximum probability observations) or pointwise posteriori (PMAP) maximizes observations pointwise). Both these have their limitations, therefore derive formulas calculating hybrid which interpolate between PMAP path. We apply introduced algorithms studied in order properties methods, illustrate large variation behaviour methods PMMs. show method should always be chosen care by taking into account purpose modelling particular interest.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pairwise Markov random fields and segmentation

The use of random elds, which allows one to take into account the spatial interaction among random variables in complex systems, becomes a frequent tool in numerous problems of statistical mechanics, spatial statistics, neural network modelling, and others. In particular, Markov random eld based techniques can be of exceptional eeciency in some image processing problems, like segmen-tation or e...

متن کامل

Switching Pairwise Markov Chains for Non Stationary Textured Images Segmentation

Hidden Markov chains (HMCs) have been extensively used to solve a wide range of problems related to computer vision, signal processing (Cappé, O., et al 2005) or bioinformatics (Koski, T., 2001). Such notoriety is due to their ability to recover the hidden data of interest using the entire observable signal thanks to some Bayesian techniques like MPM and MAP. HMCs have then been generalized to ...

متن کامل

SAR Image Segmentation using Generalized Pairwise Markov Chains

The efficiency of Markov models in the context of SAR image segmentation mainly relies on their spatial regularity constraint. However, a pixel may have a rather different visual aspect when it is located near a boundary or inside a large set of pixels of the same class. According to the classical hypothesis in Hidden Markov Chain (HMC) models, this fact can not be taken into consideration. Thi...

متن کامل

Pairwise Markov Chains

We propose a new model called a Pairwise Markov Chain (PMC), which generalizes the classical Hidden Markov Chain (HMC) model. The generalization, which allows one to model more complex situations, in particular implies that in PMC the hidden process is not necessarily a Markov process. However, PMC allows one to use the classical Bayesian restoration methods like Maximum A Posteriori (MAP), or ...

متن کامل

Pairwise Choice Markov Chains

As datasets capturing human choices grow in richness and scale—particularly in online domains—there is an increasing need for choice models that escape traditional choice-theoretic axioms such as regularity, stochastic transitivity, and Luce’s choice axiom. In this work we introduce the Pairwise Choice Markov Chain (PCMC) model of discrete choice, an inferentially tractable model that does not ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Methodology and Computing in Applied Probability

سال: 2023

ISSN: ['1387-5841', '1573-7713']

DOI: https://doi.org/10.1007/s11009-023-10044-z