Image analysis with partially ordered markov models
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Noel Cressie & Jun Zhu & Adrian J. Baddeley & M. Gopalan Nair, 2000. "Directed Markov Point Processes as Limits of Partially Ordered Markov Models," Methodology and Computing in Applied Probability, Springer, vol. 2(1), pages 5-21, April.
- R. Reeves, 2004. "Efficient recursions for general factorisable models," Biometrika, Biometrika Trust, vol. 91(3), pages 751-757, September.
- Noel Cressie & Craig Liu, 2001. "Binary Markov Mesh Models and Symmetric Markov Random Fields: Some Results on their Equivalence," Methodology and Computing in Applied Probability, Springer, vol. 3(1), pages 5-34, March.
- Wanchuang Zhu & Yanan Fan, 2023. "A synthetic likelihood approach for intractable markov random fields," Computational Statistics, Springer, vol. 38(2), pages 749-777, June.
- Noel Cressie & Andrew Zammit-Mangion, 2016. "Multivariate spatial covariance models: a conditional approach," Biometrika, Biometrika Trust, vol. 103(4), pages 915-935.
- Petter Arnesen & Håkon Tjelmeland, 2015. "Fully Bayesian Binary Markov Random Field Models: Prior Specification and Posterior Simulation," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 42(4), pages 967-987, December.
- Margrethe Kvale Loe & Håkon Tjelmeland, 2021. "Ensemble updating of binary state vectors by maximizing the expected number of unchanged components," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 48(4), pages 1148-1185, December.
- Xin Luo & Håkon Tjelmeland, 2019. "A multiple-try Metropolis–Hastings algorithm with tailored proposals," Computational Statistics, Springer, vol. 34(3), pages 1109-1133, September.
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:eee:csdana:v:29:y:1998:i:1:p:1-26. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.