The kindest cut: Minimum message length segmentation

DOI10.1007/3-540-61863-5_36MaRDI QIDQ3556981zbMATH OpenOpenAlexFDO

Authors Rohan A. Baxter, Jonathan J. Oliver

Publication date 27 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61863-5_36

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 2080440
• A Minimum Description Length-Based Image Segmentation Procedure, and Its Comparison with a Cross-Validation-Based Segmentation Procedure
• scientific article; zbMATH DE number 431941
• Minimum entropy approach to word segmentation problems
• scientific article; zbMATH DE number 1929170

Cited in

(3)

• scientific article; zbMATH DE number 2080440 (Why is no real title available?)
• scientific article; zbMATH DE number 1929170 (Why is no real title available?)
• Minimum entropy approach to word segmentation problems

This page was built for publication: The kindest cut: Minimum message length segmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3556981)