13 #ifndef mitkMultiLabelPredicateHelper_h
14 #define mitkMultiLabelPredicateHelper_h
#define MITKMULTILABEL_EXPORT
Abstract base class describing the geometry of a data object.
Abstract data management class that organizes DataNode objects in a directed acyclic graph.
Find image slices visible on a given plane.
unsigned int MITKMULTILABEL_EXPORT GetGeometryMismatchedSegmentationCount(const mitk::DataStorage *dataStorage, const mitk::BaseGeometry *referenceGeometry)
Number of segmentation nodes whose geometry does not fit the reference.
mitk::NodePredicateBase::Pointer MITKMULTILABEL_EXPORT GetMultiLabelSegmentationPredicate(const mitk::BaseGeometry *referenceGeometry=nullptr)
Creates a predicate that matches valid multi-label segmentation data nodes.
mitk::NodePredicateBase::Pointer MITKMULTILABEL_EXPORT GetSegmentationReferenceImagePredicate()
Creates a predicate that matches images suitable as reference for a segmentation.