The whole and the parts: the minimum description length principle and the a-contrario framework
From MaRDI portal
Abstract: This work explores the connections between the Minimum Description Length (MDL) principle as developed by Rissanen, and the a-contrario framework for structure detection proposed by Desolneux, Moisan and Morel. The MDL principle focuses on the best interpretation for the whole data while the a-contrario approach concentrates on detecting parts of the data with anomalous statistics. Although framed in different theoretical formalisms, we show that both methodologies share many common concepts and tools in their machinery and yield very similar formulations in a number of interesting scenarios ranging from simple toy examples to practical applications such as polygonal approximation of curves and line segment detection in images. We also formulate the conditions under which both approaches are formally equivalent.
Recommendations
Cites work
- \textit{A contrario} line segment detection
- A formal theory of inductive inference. Part I
- A formal theory of inductive inference. Part II
- Algorithmic Information Theory
- An introduction to Kolmogorov complexity and its applications
- Control of the mean number of false discoveries, Bonferroni and stability of multiple testing
- Edge detection by Helmholtz principle
- Elements of Information Theory
- Enumerative source encoding
- From Gestalt theory to image analysis. A probabilistic approach.
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 45100 (Why is no real title available?)
- scientific article; zbMATH DE number 50804 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1302286 (Why is no real title available?)
- Meaningful alignments
- Modeling by shortest data description
- On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
- Probability Inequalities for Sums of Bounded Random Variables
- Stochastic complexity and modeling
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The minimum description length principle in coding and modeling
- Universal coding, information, prediction, and estimation
This page was built for publication: The whole and the parts: the minimum description length principle and the a-contrario framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043732)