#include <point_outlier.h>
Public Types | |
typedef vcg::KdTree< ScalarType > | KdTreeType |
typedef vcg::KdTree < ScalarType >::PriorityQueue | PriorityQueue |
typedef MeshType::ScalarType | ScalarType |
Static Public Member Functions | |
static void | ComputeLoOPScore (MeshType &mesh, KdTreeType &kdTree, int kNearest) |
static int | DeleteLoOPOutliers (MeshType &m, KdTreeType &kdTree, int kNearest, float threshold) |
static int | SelectLoOPOutliers (MeshType &mesh, KdTreeType &kdTree, int kNearest, float threshold) |
Definition at line 36 of file point_outlier.h.
typedef vcg::KdTree<ScalarType> vcg::tri::OutlierRemoval< MeshType >::KdTreeType |
Definition at line 41 of file point_outlier.h.
typedef vcg::KdTree<ScalarType>::PriorityQueue vcg::tri::OutlierRemoval< MeshType >::PriorityQueue |
Definition at line 42 of file point_outlier.h.
typedef MeshType::ScalarType vcg::tri::OutlierRemoval< MeshType >::ScalarType |
Definition at line 40 of file point_outlier.h.
static void vcg::tri::OutlierRemoval< MeshType >::ComputeLoOPScore | ( | MeshType & | mesh, |
KdTreeType & | kdTree, | ||
int | kNearest | ||
) | [inline, static] |
Compute an outlier probability value for each vertex of the mesh using the approch in the paper "LoOP: Local Outlier Probabilities". The outlier probability is stored in the vertex attribute "outlierScore". It use the input kdtree to find the kNearest of each vertex.
"LoOP: local outlier probabilities" by Hans-Peter Kriegel et al. Proceedings of the 18th ACM conference on Information and knowledge management
Definition at line 53 of file point_outlier.h.
static int vcg::tri::OutlierRemoval< MeshType >::DeleteLoOPOutliers | ( | MeshType & | m, |
KdTreeType & | kdTree, | ||
int | kNearest, | ||
float | threshold | ||
) | [inline, static] |
Delete all the vertex of the mesh with an outlier probability above the input threshold [0.0, 1.0].
Definition at line 129 of file point_outlier.h.
static int vcg::tri::OutlierRemoval< MeshType >::SelectLoOPOutliers | ( | MeshType & | mesh, |
KdTreeType & | kdTree, | ||
int | kNearest, | ||
float | threshold | ||
) | [inline, static] |
Select all the vertex of the mesh with an outlier probability above the input threshold [0.0, 1.0].
Definition at line 108 of file point_outlier.h.