Abstract

Deformation congruence models form the basis for conventional deformation analysis (CDA). In geometrical sense, these models connect an epochal object states—represented by its characteristic points—at stable/congruent points to disclose possible deformations. To this day, the deformation congruence models are usually specified using the global congruence test (GCT) procedure which, however, has a weakness in the case of multiple displacements. More precisely, the GCT procedure is based on consecutive point-by-point specification which may suffer from so-called displacement smearing. To overcome the above weakness, a revolutionary—in the context of GCT—concept (two methods) involving combinatorial possibilities was suggested in recent years. Admittedly, this concept avoids the problem of consecutive point-by-point specification. Nevertheless, it generates another weakness, namely the problem of the comparison of different-dimensional models. This paper makes a step forward in this new combinatorial field and discusses a more sophisticated combinatorial procedure, denoted as CIDIA. It was shown that, thanks to an appropriately used the possibilities of combinatorics and generalized likelihood ratio tests performed in the detection–identification–adaptation (DIA) iterative steps, the above weaknesses can be overcome. In the context of GCT, the suggested procedure has rather evolutionary—than revolutionary—character and the general concepts of both procedures have similar heuristic substantiation. To demonstrate the efficacy of CIDIA against GCT and the two existing combinatorial methods, various deformation scenarios were being randomized independently many times with the use of comprehensive computer simulations and then processed. Generally, the obtained results confirmed the statement that the suggested CIDIA procedure—unlike the existing combinatorial methods—can be substantially more resistant to displacement smearing than the GCT procedure, at no significant costs. The efficacy of CIDIA—unlike the ones of the two existing combinatorial methods—turned out always higher (on average by several percentages) than the one of GCT for all considered deformation scenarios. At the same time, the CIDIA procedure turned out substantially less time-consuming than the other combinatorial methods.

Highlights

  • Geodetic absolute or relative control networks—which are measured in two or more epochs of time—form the framework for conventional deformation analysis (CDA)

  • Thanks to an appropriately used the possibilities of combinatorics and generalized likelihood ratio (GLR) tests (e.g., Teunissen 2006b, pp. 53–123; Koch 2010, pp. 276–295; Kargoll 2012, pp. 29–33) performed in the detection–identification–adaptation (DIA) steps (e.g., Baarda 1968; Teunissen 1990, 2018; Zaminpardaz and Teunissen 2019), both the problem of the consecutive point-by-point model specification which may suffer from displacement smearing and the problem of the comparison of different-dimensional models can be overcome, at no significant cost

  • Deformation congruence models are specified with the use of: the global congruence test (GCT) procedure, the method presented by Velsink (2015) denoted as the V method, the method presented by Lehmann and Lösler (2017) denoted as the Akaike’s information criterion with correction (AICc) method and the suggested combinatorial iterative DIA (CIDIA) procedure

Read more

Summary

Introduction

Geodetic absolute or relative control networks—which are measured in two or more epochs of time—form the framework for conventional deformation analysis (CDA), (see, e.g., Welsch and Heunecke 2001). It is not necessary here to consecutively point-by-point specify the congruence model, because all candidate congruence models can be compared at the same stage This concept allows imposing some geometrical conditions to displaced points (extended congruence analysis), which is not possible in GCT or robust approach. It is the case when some displaced points can be moved in the same way. The above combinatorial concept of congruence model specification overcomes the weakness of GCT, i.e., the problem of the consecutive point-by-point model specification which may suffer from displacement smearing.

Congruence analysis using the LS approach
Global congruence test procedure
Detection
Identification
Adaptation
Two existing combinatorial methods
Combinatorial iterative DIA testing procedure
Motivation
General form of mathematical model
Elementary congruence model
Extending part
Estimation
Testing procedure
Quality analysis
Numerical experiments
Experiment 1: arbitrary scenarios 1D
Method of model specification
Run Method of model specification
Experiment 2: comprehensive scenarios 1D
Step Method of model specification
Experiment 3: arbitrary scenario 2D
Experiment 4: comprehensive scenarios 2D
The eastern block is homogeneously displaced
The entire network is variously deformed
Summary and conclusions
Findings
Data availability statement
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call