Map segmentation: Difference between revisions

Revision as of 07:56, 6 January 2016

Revision as of 07:58, 6 January 2016

Line 19:

The map segmentation problem is to find:

:<math>\arg\min_X G(X_1,\dots,X_n | P)</math>

where the minimization is on the set of all partitions of C.

Often, there are geometric shape constraints on the partitions, e.g, it may be required that each part be a [[convex set]] or a [[connected set]] or at least a [[measurable set]].

== References ==