@inproceedings{058e513fe9a645018471499b250b4a1c,
title = "MFDTs: Mean field dynamic trees",
abstract = "Tree structured belief networks al-e attractive for image segmentation tasks. However; networks with fixed architectures are not view suitable as they lead to blocky artefacts, and led to the introduction of Dynamic Trees (DTs) in [6]. The Dynamic Trees architecture provides a prior distribution over tree structures, and in [6] simulated annealing (SA) was used to search for structures with high pasterior probability. In this paper, Mle introduce a mean field approach to inference in DTs. We find that the mean field method captures the posterior better than just using the maximum a posterior solution found by SA.",
author = "NJ Adams and AJ Storkey and Z Ghahramani and CKI Williams",
year = "2000",
doi = "10.1109/ICPR.2000.903506",
language = "English",
isbn = "0-7695-0751-4",
series = "INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
pages = "147--150",
editor = "A Sanfeliu and JJ Villanueva and M Vanrell and R Alquezar and T Huang and J Serra",
booktitle = "15TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 3, PROCEEDINGS",
address = "United States",
note = "15th International Conference on Pattern Recognition (ICPR-2000) ; Conference date: 03-09-2000 Through 07-09-2000",
}