2017
DOI: 10.1016/j.cageo.2017.05.013
|View full text |Cite
|
Sign up to set email alerts
|

Computationally efficient variable resolution depth estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 23 publications
0
6
0
Order By: Relevance
“…However, although the several intrinsic advantages related to deal with grid data (e.g., higher processing and development speed) [36], we decided not to take such a direction because of the intrinsic variable-resolution nature of an ENC that makes it difficult to identify the best fixed resolution at which to grid the TIN. Regarding the possible creation of a variable-resolution grid, despite the recent development and successful application of this type of gridding algorithms to MBES data [61], a robust estimation of the local resolution based on ENC-derived data would have represented a challenge, and it is an open research question.…”
Section: Discussionmentioning
confidence: 99%
“…However, although the several intrinsic advantages related to deal with grid data (e.g., higher processing and development speed) [36], we decided not to take such a direction because of the intrinsic variable-resolution nature of an ENC that makes it difficult to identify the best fixed resolution at which to grid the TIN. Regarding the possible creation of a variable-resolution grid, despite the recent development and successful application of this type of gridding algorithms to MBES data [61], a robust estimation of the local resolution based on ENC-derived data would have represented a challenge, and it is an open research question.…”
Section: Discussionmentioning
confidence: 99%
“…The chrt (cube with Hierarchical Resolution Techniques) algorithm (Calder and Rice, 2017), a development of the cube (Combined Uncertainty and Bathymetry Estimator) algorithm (Calder and Mayer, 2003) was used as the basis for the current work. The chrt algorithm was developed to estimate variable resolution depths from raw observational data based on the premise that in regions where there is higher data density it should be possible to reconstruct with smaller sample spacings, giving higher resolution reconstructions of the surface.…”
Section: Core Estimatormentioning
confidence: 99%
“…In this paper, therefore, a spatial partitioning algorithm is proposed for the chrt (cube with Hierarchical Resolution Techniques) algorithm (Calder and Rice, 2017) which takes advantage of the structure of chrt to ensure that each computational resource can operate independently of the others without communication or interlocks so long as they have global access to all of the observations. (Section 2.1 has an outline of the chrt algorithm.)…”
Section: Introductionmentioning
confidence: 99%
“…The latest phase of improvement model was conducive to perform bathymetric estimation effectively on large-scale mass datasets under limited computing resources. The model was adaptive to different depths and sensor-driven data densities [25].…”
Section: State Of the Artmentioning
confidence: 99%