AbstractFuzzyIntersect
- class hybrid_learning.fuzzy_logic.predicates.custom_ops.AbstractFuzzyIntersect(*in_keys, logical_and=None, logical_or=None, mask_dims=(- 2, - 1), keep_dims=False, **kwargs)[source]
Bases:
TorchOperation,ABCAbstract class to define fuzzy intersection (over union) operations. The core method provided in this class is
torch_intersect_proportion().Public Data Attributes:
The arity of the operation.
Settings to reproduce the instance.
Defaults used for
settings.Inherited from : py: class:Merge
SYMBThe string symbol of this class (override for sub-classes).
The arity of the operation.
IS_COMMUTATIVEWhether instances are equivalent to ones with permuted
in_keys.is_variadicWhether the instance is variadic.
Settings to reproduce the instance.
Defaults used for
settings.pretty_op_symbName of the operation symbol suitable for filenames etc.
childrenThe input keys which are child operations.
all_childrenAll children operations in the flattened computational tree, sorted depth first.
constsThe constant string keys in the input keys.
operation_keysThe list of keys used for this parent operation in original order (constants and children output keys).
all_in_keysAll string input keys both of self and of all child operations.
all_out_keysOutput keys of self and all child operations.
Inherited from : py: class:DictTransform
Settings to reproduce the instance.
Inherited from : py: class:Transform
IDENTITY_CLASSThe identity class or classes for composition / addition.
Settings to reproduce the instance.
Public Methods:
torch_intersect(*masks)torch_union(*masks)torch_intersect_proportion(*masks[, iou, ...])Calculate to what degree
mask_ais covered bymask_b.Inherited from : py: class:TorchOperation
operation(annotation_vals)Calculate the predicate output.
Inherited from : py: class:Merge
to_infix_notation([sort_key, ...])Return an infix str encoding equal for differently sorted operations.
to_str(**infix_notation_kwargs)Alias for
to_infix_notation().to_pretty_str(**infix_notation_kwargs)Same as
to_str()but using pretty operation names suitable for filenames etc.to_repr([settings, defaults, sort_key, ...])Return str representation which can be used to reproduce and compare the instance.
treerecurse_replace_keys(**replace_map)Return a new formula with all occurences of variables in
replace_mapreplaced and else identical settings.treerecurse(fun)Apply the given function recursively to this and all children instances.
apply_to(annotations[, keep_keys])Apply this operation to the
annotationsdict.variadic_apply_to(annotations)Return the result of operation on the values/items of a mapping or sequence of arbitrary length.
operation(annotation_vals)Calculate the predicate output.
Inherited from : py: class:DictTransform
apply_to(annotations[, keep_keys])Apply this operation to the
annotationsdict.Inherited from : py: class:Transform
apply_to(annotations[, keep_keys])Apply this operation to the
annotationsdict.Special Methods:
__init__(*in_keys[, logical_and, ...])Init.
Inherited from : py: class:Merge
__init__(*in_keys[, logical_and, ...])Init.
__str__()Return str(self).
__repr__()Call
to_repr()without sorting.__eq__(other)Two merge operations are considered equal, if their normalized representations coincide.
__copy__()Return a deep copy of self using settings.
__call__(annotations[, keep_keys])Call method modifying a given dictionary.
Inherited from : py: class:DictTransform
__call__(annotations[, keep_keys])Call method modifying a given dictionary.
Inherited from : py: class:Transform
__repr__()Call
to_repr()without sorting.__eq__(other)Two merge operations are considered equal, if their normalized representations coincide.
__copy__()Return a deep copy of self using settings.
__add__(other)Return a flat composition of
selfwithother.__radd__(other)Return a flat composition of
otherandself.__call__(annotations[, keep_keys])Call method modifying a given dictionary.
- Parameters
- __init__(*in_keys, logical_and=None, logical_or=None, mask_dims=(- 2, - 1), keep_dims=False, **kwargs)[source]
Init.
Hand over input keys either as str or as a Merge operation of str.
- Parameters
in_keys – sequence of either
Mergeoperation instances or strings with placeholders for the input keysout_key – key for the output of this operation; used to init
out_keyoverwrite – on call, whether to overwrite the value at
out_keyin the given dict if the key already exists; raise if key exists andoverwriteis true; saved inoverwrite.replace_none – if not
None, the value to replace anyNonevalues with; seereplace_nonesymb – override the
SYMBfor this instancekeep_keys – intermediate output keys to add to call output; see
keep_keyscache_duplicates – whether outputs of children with identical keys should be cached and reused; see
cache_duplicates_variadic – the preferred way to specify this argument is
variadic_(); see there for detailskeep_dims (bool) –
- torch_intersect_proportion(*masks, iou=True, mask_dims=None)[source]
Calculate to what degree
mask_ais covered bymask_b.- Returns
Depending on
iou, this is the following for masksA=mask_a,B=mask_b, and fuzzy set membership function \(\in\):iou=True: intersection over union betweenmask_aandmask_bas \(\min(1, \frac{\sum_c c\in A \wedge c\in B}{(\sum_c c \in A \vee c \in B)})\)iou=False: what proportion ofmask_aarea intersects withmask_bas \(\min(1, \frac{\sum_c c\in A \wedge c\in B}{\sum_a a \in A})\) (here, \(a\vee b\) is calculated as \(1 - ((1-a) \wedge (1-b))\))
- Parameters
- Return type
FloatTensor
- logical_and: Optional[Merge]
The logical AND operation to use for calculating mask intersection (assumed to be commutative). If
None, product logic AND is used.
- logical_or: Optional[Merge]
The logical OR operation to use for calculating mask union (assumed to be commutative). If
None, it calculates as1-self.logical_and([1-mask_a, 1-mask_b]).