mmcfilters::ComponentTreePartitionHierarchyAdapter Class Reference

Explicit proper-part completion of a morphological component tree. More...

#include <HierarchySaliencyMap.hpp>

Static Public Member Functions
static void	validate (const MorphologicalTree &tree, const RegularGridAdjacency2D &adjacency)
	Validates the connected complete-partition interpretation.
static std::vector< int >	computePartitionAppearanceLevels (const MorphologicalTree &tree)
	Returns the structural partition-appearance levels of the completion.
template<class Value >
static EdgeSaliencyMap< Value >	computeSaliencyEdgeMap (const MorphologicalTree &tree, const RegularGridAdjacency2D &adjacency, std::span< const Value > partitionAppearanceLevels, HierarchyValuationPolicy policy=HierarchyValuationPolicy::AllowLevelCollapse)
	Projects explicit partition-appearance levels with level(LCA)-1.

Detailed Description

Explicit proper-part completion of a morphological component tree.

A component tree is a hierarchy of partial partitions, whereas Cousty's saliency correspondence uses complete connected partitions of the graph domain. This adapter states the completion used by this library:

• partition 0 contains graph-vertex singletons;
• zero-valued same-smallest-node edges form the connected atoms of direct proper parts;
• component-tree nodes merge those atoms and their child supports;
• every resulting node support must be connected in the selected graph.

The adapter is a semantic facade over HierarchySaliencyMap; it does not copy or rewrite the component-tree topology.

Definition at line 619 of file HierarchySaliencyMap.hpp.

Member Function Documentation

computePartitionAppearanceLevels()

static std::vector< int > mmcfilters::ComponentTreePartitionHierarchyAdapter::computePartitionAppearanceLevels ( const MorphologicalTree &  tree )

inlinestatic

Returns the structural partition-appearance levels of the completion.

Parameters

tree	Component-tree topology whose completion is ranked.

Returns

Dense internal-node-id buffer of positive appearance levels.

Definition at line 639 of file HierarchySaliencyMap.hpp.

computeSaliencyEdgeMap()

template<class Value >

static EdgeSaliencyMap< Value > mmcfilters::ComponentTreePartitionHierarchyAdapter::computeSaliencyEdgeMap ( const MorphologicalTree &  tree, const RegularGridAdjacency2D &  adjacency, std::span< const Value >  partitionAppearanceLevels, HierarchyValuationPolicy  policy = HierarchyValuationPolicy::AllowLevelCollapse  )

inlinestatic

Projects explicit partition-appearance levels with level(LCA)-1.

Template Parameters

Value

Partition-level scalar type.

Parameters

tree	Component-tree topology to complete and project.
adjacency	Projection graph on the pixel domain.
partitionAppearanceLevels	Dense positive level per internal node id.
policy	Whether equal parent/child appearance levels are accepted.

Returns

Full edge-indexed saliency map on adjacency.

Exceptions

std::invalid_argument

If the hierarchy, graph, valuation, or support connectivity contract is invalid.

Definition at line 656 of file HierarchySaliencyMap.hpp.

validate()

static void mmcfilters::ComponentTreePartitionHierarchyAdapter::validate ( const MorphologicalTree &  tree, const RegularGridAdjacency2D &  adjacency  )

inlinestatic

Validates the connected complete-partition interpretation.

Parameters

tree	Component-tree topology to validate.
adjacency	Projection graph on the tree pixel domain.

Exceptions

std::invalid_argument

If the graph domain is incompatible or a hierarchy support is disconnected.

Definition at line 629 of file HierarchySaliencyMap.hpp.

---

The documentation for this class was generated from the following file:

• mmcfilters/trees/saliency/HierarchySaliencyMap.hpp