A Convex Approach to Minimal Partitions
نویسندگان
چکیده
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem finds a correct numerical approximation of the optimal solution: we give some arguments to explain why it should be so, and also discuss some situation where it fails.
منابع مشابه
A convex approach for computing minimal partitions
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem nds a correct (approximate) solution: we give some arguments to explain why it should be so, and also discuss some situation where it fails.
متن کاملInstitut für Informatik III der Rheinischen Friedrich-Wilhelms-Universität Bonn A convex approach for computing minimal partitions
We describe a convex relaxation for a family of problems of minimal perimeter partitions. The minimization of the relaxed problem can be tackled numerically, we describe an algorithm and show some results. In most cases, our relaxed problem finds a correct (approximate) solution: we give some arguments to explain why it should be so, and also discuss some situation where it fails.
متن کاملA local approach to the entropy of countable fuzzy partitions
This paper denes and investigates the ergodic proper-ties of the entropy of a countable partition of a fuzzy dynamical sys-tem at different points of the state space. It ultimately introducesthe local fuzzy entropy of a fuzzy dynamical system and proves itto be an isomorphism invariant.
متن کاملConvex Relaxation Techniques for Segmentation, Stereo and Multiview Reconstruction
1 Convex Relaxation Techniques for Segmentation, Stereo and Multiview Reconstruction 2 1.1 Variational Methods, Partial Differential Equations and Convexity 2 1.2 Image Segmentation and Minimal Partitions 4 1.2.1 Classical Variational Approaches 4 1.2.2 A General Variational Formulation 5 1.2.3 Convex Representation 6 1.2.4 Convex Relaxation 8 1.2.5 Experimental Segmentation Results 9 1.3 Stere...
متن کاملConvex Regression with Interpretable Sharp Partitions
We consider the problem of predicting an outcome variable on the basis of a small number of covariates, using an interpretable yet non-additive model. We propose convex regression with interpretable sharp partitions (CRISP) for this task. CRISP partitions the covariate space into blocks in a data-adaptive way, and fits a mean model within each block. Unlike other partitioning methods, CRISP is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Imaging Sciences
دوره 5 شماره
صفحات -
تاریخ انتشار 2012