Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems 2010
DOI: 10.1145/1869790.1869815
|View full text |Cite
|
Sign up to set email alerts
|

Cleaning massive sonar point clouds

Abstract: We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result of scans of (shoals of) fish, multiple reflections, scanner self-reflections, refraction in gas bubbles, and so on.We describe a new algorithm that avoids the problems of previous local-neighbourhood based algorithms. Our algorithm is theoretically I/O-efficient, that is, it is capable of efficiently processing massive sonar point clo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(23 citation statements)
references
References 13 publications
0
23
0
Order By: Relevance
“…Similar studies, examining the influence of TIN (triangulated irregular network) on the accuracy of created models, were described in publication (Agugiaro and Kolbe 2012;Isenburg et al 2006;Arge et al 2010). However, for large data sets it seems more justified to use grid (Brasington and Richards 1998;Falcao et al 2013;Jalving 1999;Luo et al 2014;Yanalak 2003).…”
Section: Introductionmentioning
confidence: 87%
“…Similar studies, examining the influence of TIN (triangulated irregular network) on the accuracy of created models, were described in publication (Agugiaro and Kolbe 2012;Isenburg et al 2006;Arge et al 2010). However, for large data sets it seems more justified to use grid (Brasington and Richards 1998;Falcao et al 2013;Jalving 1999;Luo et al 2014;Yanalak 2003).…”
Section: Introductionmentioning
confidence: 87%
“…To construct G, we find the graph vertices by computing connected components. This can be done in O(scan(N )) I/Os using existing I/O-efficient algorithms [11,12]. We then perform a scan to construct the graph edges.…”
Section: A Appendix: Computing Candidate Cellsmentioning
confidence: 99%
“…The reflection strength may also be recorded and, thus, enrich the feature vector [31]. Point cloud processing of large MBES (Multi-beam Echo Sounding) datasets is described, e.g., in Arge et al [32]. The case of MBES point clouds will not be discussed further.…”
Section: Acquisition Of Point Cloudsmentioning
confidence: 99%
“…In certain situations, even linear structures, such as a simple tiling space partition [81] or lexicographically sorting by point coordinates [32], may be satisfactory.…”
Section: Data Structures and Spatial Indicesmentioning
confidence: 99%