2005
DOI: 10.1109/pbg.2005.194067
|View full text |Cite
|
Sign up to set email alerts
|

Robust filtering of noisy scattered point data

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
56
0
1

Year Published

2006
2006
2020
2020

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 110 publications
(62 citation statements)
references
References 25 publications
0
56
0
1
Order By: Relevance
“…A first method shown in Point Cloud Library (2011) involves trimming points that are located further than a specified threshold, the interval between the mean and the standard deviation of the global distance, according to a Gaussian distribution of the distance. Other methods (Schall, Belyaev & Seidel, 2005) involve heavy calculations and, although they might produce a better result, the filtered point cloud may not significantly improve visualization.…”
Section: Point Cloud Visualization and Program Parallelizationmentioning
confidence: 99%
“…A first method shown in Point Cloud Library (2011) involves trimming points that are located further than a specified threshold, the interval between the mean and the standard deviation of the global distance, according to a Gaussian distribution of the distance. Other methods (Schall, Belyaev & Seidel, 2005) involve heavy calculations and, although they might produce a better result, the filtered point cloud may not significantly improve visualization.…”
Section: Point Cloud Visualization and Program Parallelizationmentioning
confidence: 99%
“…Using noise removal techniques to identify areas of noise-like characteristics can be beneficial to determining the location of the defect. Schall et al propose a noise removal method that also provides applications in outlier removal (Schall et al 2005). The statistical method estimates the density of each area of the point cloud, and uses the neighbouring points to adapt a probable surface to each point.…”
Section: Surface Shape Analysismentioning
confidence: 99%
“…A smooth kernel density function g(p) is defined to reflect the probability that a point pє R 3 is a point on the surface S sampled by a noisy point cloud Ω. Inspired by the previous work of Schall et al [21], we measure the probability density function g(p) by considering the squared distance of p to the plane H(p) fitted to a spatial k-neighborhood of p i as…”
Section: Mean Shift Filteringmentioning
confidence: 99%