IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i10p1589-d1654130.html
   My bibliography  Save this article

Contextual Peano Scan and Fast Image Segmentation Using Hidden and Evidential Markov Chains

Author

Listed:
  • Clément Fernandes

    (Department Automobiles, Segula Matra Automotive, Zone d’Activité Pissaloup, 8 Av. Jean d’Alembert, 78190 Trappes, France
    SAMOVAR, Télécom SudParis, Institut Polytechnique de Paris, 91120 Palaiseau, France)

  • Wojciech Pieczynski

    (SAMOVAR, Télécom SudParis, Institut Polytechnique de Paris, 91120 Palaiseau, France)

Abstract

Transforming bi-dimensional sets of image pixels into mono-dimensional sequences with a Peano scan (PS) is an established technique enabling the use of hidden Markov chains (HMCs) for unsupervised image segmentation. Related Bayesian segmentation methods can compete with hidden Markov fields (HMFs)-based ones and are much faster. PS has recently been extended to the contextual PS, and some initial experiments have shown the value of the associated HMC model, denoted as HMC-CPS, in image segmentation. Moreover, HMCs have been extended to hidden evidential Markov chains (HEMCs), which are capable of improving HMC-based Bayesian segmentation. In this study, we introduce a new HEMC-CPS model by simultaneously considering contextual PS and evidential HMC. We show its effectiveness for Bayesian maximum posterior mode (MPM) segmentation using synthetic and real images. Segmentation is performed in an unsupervised manner, with parameters being estimated using the stochastic expectation–maximization (SEM) method. The new HEMC-CPS model presents potential for the modeling and segmentation of more complex images, such as three-dimensional or multi-sensor multi-resolution images. Finally, the HMC-CPS and HEMC-CPS models are not limited to image segmentation and could be used for any kind of spatially correlated data.

Suggested Citation

  • Clément Fernandes & Wojciech Pieczynski, 2025. "Contextual Peano Scan and Fast Image Segmentation Using Hidden and Evidential Markov Chains," Mathematics, MDPI, vol. 13(10), pages 1-18, May.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:10:p:1589-:d:1654130
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/10/1589/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/10/1589/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:10:p:1589-:d:1654130. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.