The Kindest Cut: Minimum Message Length Segmentation

@inproceedings{Baxter1996TheKC,
  title={The Kindest Cut: Minimum Message Length Segmentation},
  author={Rohan A. Baxter and Jonathan J. Oliver},
  booktitle={ALT},
  year={1996}
}
We consider some particular instances of the segmentation problem. We derive minimum message length (MML) expressions for stating the region boundaries for some one and two dimensional examples. It is the found the message length cost of stating region boundaries is dependent on the noise of the data in the separated regions and also thèdegree of separation' of the two regions. The framework given here can be extended to diierent shaped cuts and also non-constant ts for the regions. Possible… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Estimation and inference by compact coding

  • C. S. Wallace, P. R. Freeman
  • J. R. Statist. Soc B,
  • 1987
Highly Influential
3 Excerpts

MDL estimation with Small Sample Sizes including an application to the problem of segmenting binary strings using bernoulli models

  • B. Dom
  • Two Segments: n = 80,
  • 1995
1 Excerpt

Parameter estimation of nite mixtures using the EM algorithm and information criteria with applications to medical image processing

  • Z. Liang
  • IEEE Trans. on Nuclear Science,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…