IDEAS home Printed from https://ideas.repec.org/a/bla/jorssc/v51y2002i2p209-221.html
   My bibliography  Save this article

Maximum a posteriori estimation of image boundaries by dynamic programming

Author

Listed:
  • C. A. Glasbey
  • M. J. Young

Abstract

Summary. We seek a computationally fast method for solving a difficult image segmentation problem: the positioning of boundaries on medical scanner images to delineate tissues of interest. We formulate a Bayesian model for image boundaries such that the maximum a posterioriestimator is obtainable very efficiently by dynamic programming. The prior model for the boundary is a biased random walk and the likelihood is based on a border appearance model, with parameter values obtained from training images. The method is applied successfully to the segmentation of ultrasound images and X‐ray computed tomographs of sheep, for application in sheep breeding programmes.

Suggested Citation

  • C. A. Glasbey & M. J. Young, 2002. "Maximum a posteriori estimation of image boundaries by dynamic programming," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 51(2), pages 209-221, May.
  • Handle: RePEc:bla:jorssc:v:51:y:2002:i:2:p:209-221
    DOI: 10.1111/1467-9876.00264
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/1467-9876.00264
    Download Restriction: no

    File URL: https://libkey.io/10.1111/1467-9876.00264?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:bla:jorssc:v:51:y:2002:i:2:p:209-221. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/rssssea.html .

    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.