Medical Imaging Interaction Toolkit
2024.12.99-d991a09f
Medical Imaging Interaction Toolkit
|
This filter uses the DBSCAN algorithm for clustering an mitk::UnstructuredGrid. "MinPts" defines the number of neighbours which are required to be a kernel point if a point is in range of a kernel point but hasn't enough neighbours this point is added to the cluster but is a density reachable point and the cluster ends at this point. "eps" is the range in which the neighbours are searched. If "Meshing" is set the clusteres UnstructuredGrid is meshed and visible in 2D renderwindows. More...
#include <mitkUnstructuredGridClusteringFilter.h>
Public Member Functions | |
mitkClassMacro (UnstructuredGridClusteringFilter, UnstructuredGridToUnstructuredGridFilter) | |
Pointer | Clone () const |
virtual void | Seteps (double _arg) |
virtual double | Geteps () |
virtual void | SetMinPts (int _arg) |
virtual int | GetMinPts () |
virtual void | SetMeshing (bool _arg) |
virtual std::vector< mitk::UnstructuredGrid::Pointer > | GetAllClusters () |
virtual int | GetNumberOfFoundClusters () |
![]() | |
mitkClassMacro (UnstructuredGridToUnstructuredGridFilter, UnstructuredGridSource) | |
Pointer | Clone () const |
void | GenerateOutputInformation () override |
const mitk::UnstructuredGrid * | GetInput (void) |
virtual const mitk::UnstructuredGrid * | GetInput (unsigned int idx) |
virtual void | SetInput (const UnstructuredGrid *grid) |
virtual void | SetInput (unsigned int idx, const UnstructuredGrid *grid) |
virtual void | CreateOutputsForAllInputs (unsigned int idx) |
![]() | |
mitkClassMacro (UnstructuredGridSource, BaseDataSource) | |
Pointer | Clone () const |
mitkBaseDataSourceGetOutputDeclarations itk::DataObject::Pointer | MakeOutput (DataObjectPointerArraySizeType idx) override |
itk::DataObject::Pointer | MakeOutput (const DataObjectIdentifierType &name) override |
![]() | |
virtual std::vector< std::string > | GetClassHierarchy () const |
virtual const char * | GetClassName () const |
OutputType * | GetOutput () |
const OutputType * | GetOutput () const |
OutputType * | GetOutput (DataObjectPointerArraySizeType idx) |
const OutputType * | GetOutput (DataObjectPointerArraySizeType idx) const |
virtual void | GraftOutput (OutputType *output) |
Graft the specified BaseData onto this BaseDataSource's output. More... | |
virtual void | GraftOutput (const DataObjectIdentifierType &key, OutputType *output) |
virtual void | GraftNthOutput (unsigned int idx, OutputType *output) |
Graft the specified base data object onto this BaseDataSource's idx'th output. More... | |
bool | Updating () const |
Access itk::ProcessObject::m_Updating. More... | |
Static Public Member Functions | |
static Pointer | New () |
![]() | |
static Pointer | New () |
![]() | |
static Pointer | New () |
![]() | |
static const char * | GetStaticNameOfClass () |
Protected Member Functions | |
UnstructuredGridClusteringFilter () | |
~UnstructuredGridClusteringFilter () override | |
void | GenerateOutputInformation () override |
void | GenerateData () override |
![]() | |
UnstructuredGridToUnstructuredGridFilter () | |
~UnstructuredGridToUnstructuredGridFilter () override | |
![]() | |
UnstructuredGridSource () | |
~UnstructuredGridSource () override | |
![]() | |
BaseDataSource () | |
~BaseDataSource () override | |
Additional Inherited Members | |
![]() | |
typedef mitk::UnstructuredGrid | OutputType |
![]() | |
typedef BaseDataSource | Self |
typedef itk::ProcessObject | Superclass |
typedef itk::SmartPointer< Self > | Pointer |
typedef itk::SmartPointer< const Self > | ConstPointer |
typedef BaseData | OutputType |
typedef itk::DataObject::DataObjectIdentifierType | DataObjectIdentifierType |
![]() | |
static Pointer | New () |
This filter uses the DBSCAN algorithm for clustering an mitk::UnstructuredGrid. "MinPts" defines the number of neighbours which are required to be a kernel point if a point is in range of a kernel point but hasn't enough neighbours this point is added to the cluster but is a density reachable point and the cluster ends at this point. "eps" is the range in which the neighbours are searched. If "Meshing" is set the clusteres UnstructuredGrid is meshed and visible in 2D renderwindows.
DBSCAN algorithm:
DBSCAN(D, eps, MinPts) C = 0 for each unvisited point P in dataset D mark P as visited N = D.regionQuery(P, eps) if sizeof(N) < MinPts mark P as NOISE else C = next cluster expandCluster(P, N, C, eps, MinPts) expandCluster(P, N, C, eps, MinPts) add P to cluster C for each point P' in N if P' is not visited mark P' as visited N' = D.regionQuery(P', eps) if sizeof(N') >= MinPts N = N joined with N' if P' is not yet member of any cluster add P' to cluster C
Definition at line 62 of file mitkUnstructuredGridClusteringFilter.h.
|
protected |
Constructor
|
overrideprotected |
Destructor
Pointer mitk::UnstructuredGridClusteringFilter::Clone | ( | ) | const |
|
overrideprotected |
Is called by the Update() method
|
overrideprotected |
Defines the output of the filter
|
virtual |
Returns all clusters as UnstructuredGrids which were found
|
virtual |
|
virtual |
|
virtual |
Returns the number of the clusters which were found
mitk::UnstructuredGridClusteringFilter::mitkClassMacro | ( | UnstructuredGridClusteringFilter | , |
UnstructuredGridToUnstructuredGridFilter | |||
) |
|
static |
|
virtual |
Sets the distance for the neighbour search
|
virtual |
If activated the clusteres UnstructuredGrid is meshed
|
virtual |
Sets the number of required neighbours