Sequential convex programming for computing information-theoretic minimal partitions: nonconvex nonsmooth optimization (Q4689645)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6957104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequential convex programming for computing information-theoretic minimal partitions: nonconvex nonsmooth optimization |
scientific article; zbMATH DE number 6957104 |
Statements
Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization (English)
0 references
17 October 2018
0 references
information theory
0 references
total variation regularization
0 references
image partitioning
0 references
difference of convex functions
0 references
stochastic optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7933835387229919
0 references
0.7804926633834839
0 references
0.7686838507652283
0 references
0.7290210723876953
0 references
