Download presentation

Presentation is loading. Please wait.

Published byReagan Hurdle Modified about 1 year ago

1
Theoretical foundations of ITRF determination The algebraic and the kinematic approach The VII Hotine-Marussi Symposium Rome, July 6–10, 2009 Zuheir Altamimi 1 & Athanasios Dermanis 2 ( 1 ) IGN-LAREG - ( 2 ) Aristotle University of Thessaloniki

2
THE ITRF FORMULATION PROBLEM given a time sequence of sub-network coordinates (one from each technique T = VLBI, SLR, GPS, DORIS) combine them into coordinates for the whole network obeying a time-evolution model Essentially: Determine the model parameters for each network point i t

3
THE ITRF FORMULATION PROBLEM t given a time sequence of sub-network coordinates (one from each technique T = VLBI, SLR, GPS, DORIS) combine them into coordinates for the whole network obeying a time-evolution model Essentially: Determine the model parameters for each network point i

4
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM Given a time sequence of sub-network shapes (one from each technique: VLBI, SLR, GPS, DORIS) t

5
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM Replace them with a smooth sequence of shapes t

6
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM Replace them with a smooth sequence of shapes t

7
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM Note that although shape variation is insignificant coordinates may vary significantly due to temporal instability in reference system maintenance t

8
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM To remove coordinate variation assign a different reference system at each epoch t

9
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM To remove coordinate variation assign a different reference system at each epoch t

10
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM To remove coordinate variation assign a different reference system at each epoch such that when networks are viewed in the “same” system t

11
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM To remove coordinate variation assign a different reference system at each epoch such that when networks are viewed in the “same” system coordinates vary in a smooth way t

12
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM To remove coordinate variation assign a different reference system at each epoch such that when networks are viewed in the “same” system coordinates vary in a smooth way in conformance with a coordinate time-variation model t

13
THE COORDINATE-FREE APPROACH (ALMOST) TO THE ITRF FORMULATION PROBLEM currently: To remove coordinate variation assign a different reference system at each epoch such that when networks are viewed in the “same” system coordinates vary in a smooth way in conformance with a coordinate time-variation model t

14
STACKING FOR EACH PARTICULAR TECHNIQUE t t t data: coordinate transformation parameters: model parameters: coordinate variation model:

15
THE ITRF FORMULATION PROBLEM = SIMULTANEOUS STACKING FOR ALL TECHNIQUES t SLR VLBI DORIS GPS ITRF

16
THE ITRF FORMULATION PROBLEM IN AN OPERATIONALLY CONVENIENT COMPROMISE Separation into 2 steps: (1) Separate stackings one for each technique: Provides initial coordinates and velocities for the subnetwork of each technique

17
THE ITRF FORMULATION PROBLEM IN AN OPERATIONALLY CONVENIENT COMPROMISE Separation into 2 steps: (1) Separate stackings one for each technique: Provides initial coordinates and velocities for the subnetwork of each technique (2) Combination of initial coordinates and velocities: Provides initial coordinates and velocities for the whole ITRF network

18
The (general) model: Point P i coordinates: a i = point P i parameters The current model: THE MODEL FOR TIME EVOLUTION OF COORDINATES

19
SMOOTHING Replaces observes time sequences of sub-network shapes with a single smooth time sequence for the whole ITRF network INTERPOLATION Provides shapes expressed by coordinates for epochs other than observation ones IMPOSES THE USE OF A REFERENCE SYSTEM so that network shapes are represented by coordinates WHAT THE MODEL DOES

20
WHAT THE MODEL DOES NOT DO SMOOTHING Replaces observes time sequences of sub-network shapes with a single smooth time sequence for the whole ITRF network MAIN ITRF FORMULATION PROBLEM Assign a reference system for each epoch INTERPOLATION Provides shapes expressed by coordinates for epochs other than observation ones IMPOSES THE USE OF A REFERENCE SYSTEM so that network shapes are represented by coordinates It does not resolve the problem of the choice of the reference system

21
WHAT THE MODEL DOES NOT DO MAIN ITRF FORMULATION PROBLEM Assign a reference system for each epoch It does not resolve the problem of the choice of the reference system

22
WHAT THE MODEL DOES NOT DO MAIN ITRF FORMULATION PROBLEM Assign a reference system for each epoch It does not resolve the problem of the choice of the reference system PROBLEM SOLUTION: Introduce additional minimal constraints in the Least-Square data analysis problem Minimal constraints:At any epoch t they determine the reference system without affecting the optimal network shape uniquely determined by the least-squares principle for the determination of ITRF parameters

23
WHAT THE MODEL DOES NOT DO MAIN ITRF FORMULATION PROBLEM Assign a reference system for each epoch It does not resolve the problem of the choice of the reference system PROBLEM SOLUTION: Introduce additional minimal constraints in the Least-Square data analysis problem Minimal constraints:At any epoch t they determine the reference system without affecting the optimal network shape uniquely determined by the least-squares principle for the determination of ITRF parameters How to choose the minimal inner constraints? 2 approaches:(1) The algebraic approach (classical Meissl inner constraints) (2) The kinematic approach (new!)

24
THE ALGEBRAIC APPROACH Formulation of Least Squares problem with infinite solutions for different choices of reference system THE KINEMATIC APPROACH

25
THE ALGEBRAIC APPROACH Formulation of Least Squares problem with infinite solutions for different choices of reference system or partial inner constraints: Choice of unique solution by inner constraints: THE KINEMATIC APPROACH

26
THE ALGEBRAIC APPROACHTHE KINEMATIC APPROACH Formulation of Least Squares problem with infinite solutions for different choices of reference system or partial inner constraints: Choice of unique solution by inner constraints: Choice of reference system by minimization of apparent variation of coordinate for network points

27
THE ALGEBRAIC APPROACH Discrete Tisserand Reference System THE KINEMATIC APPROACH Formulation of Least Squares problem with infinite solutions for different choices of reference system or partial inner constraints: Choice of unique solution by inner constraints: Choice of reference system by minimization of apparent variation of coordinate for network points (3) constant mean quadratic scale Measures of coordinate variation: (1) Minimum relative kinetic energy = = vanishing relative angular momentum (2) constant network barycenter

28
Inner constraints determined from the linear variation of unknown parameters x when coordinate system changes with small transformation parameters p THE ALGEBRAIC APPROACH – INNER CONSTRAINTS rotation angles translation vector scale parameter

29
Inner constraints determined from the linear variation of unknown parameters x when coordinate system changes with small transformation parameters p THE ALGEBRAIC APPROACH – INNER CONSTRAINTS Determine the parameter variation equations rotation angles translation vector scale parameter

30
Inner constraints determined from the linear variation of unknown parameters x when coordinate system changes with small transformation parameters p Then the (total) inner constraints are THE ALGEBRAIC APPROACH – INNER CONSTRAINTS Determine the parameter variation equations rotation angles translation vector scale parameter

31
MODEL PRESERVING APPROXIMATE TRANSFORMATIONS OF INITIAL COORDINATES AND VELOCITIES Transformation of coordinates in first order approximation

32
MODEL PRESERVING APPROXIMATE TRANSFORMATIONS OF INITIAL COORDINATES AND VELOCITIES Model preserving transformations Transformation of coordinates in first order approximation

33
MODEL PRESERVING APPROXIMATE TRANSFORMATIONS OF INITIAL COORDINATES AND VELOCITIES Transformation of model parameters Model preserving transformations Transformation of coordinates in first order approximation

34
THE ALGEBRAIC APPROACH – INNER CONSTRAINTS PER STATION The (total) inner constraints are For each station P i determine the parameter variation equations The inner constraints per station are

35
MODEL PRESERVING APPROXIMATE TRANSFORMATIONS OF INITIAL COORDINATES AND VELOCITIES The use of model preserving transformations instead of arbitrary transformations leads to a sub-optimal solution: No matter what the optimality criterion, there exist an arbitrary transformation leading to a better solution which does not conform with the chosen model Strict optimality leads the solution OUTSIDE the adopted model !

36
MODEL PRESERVING APPROXIMATE TRANSFORMATIONS OF INITIAL COORDINATES AND VELOCITIES Transformation of model parameters in terms of corrections to approximate values Transformation of corrections to model parameters

37
Transformation of model parameters in terms of corrections to approximate values Transformation of corrections to model parameters MODEL PRESERVING APPROXIMATE TRANSFORMATIONS OF INITIAL COORDINATES AND VELOCITIES

38
Transformation of model parameters in terms of corrections to approximate values Transformation of corrections to model parameters MODEL PRESERVING APPROXIMATE TRANSFORMATIONS OF INITIAL COORDINATES AND VELOCITIES inner constraints sub-matrix

39
THE STACKING PROBLEM Transformation parameters from ITRF system to technique-system at epoch t k Observed coordinates in particular technique at epoch t k ITRF model coordinates at epoch t k GIVEN SOUGHT NUISANCE Original observation model

40
THE STACKING PROBLEM In first order approximation In terms of corrections to approximate values Transformation parameters from ITRF system to technique-system at epoch t k Observed coordinates in particular technique at epoch t k ITRF model coordinates at epoch t k GIVEN SOUGHT Original observation model NUISANCE

41
INNER CONSTRAINTS FOR THE STACKING PROBLEM Change of ITRF reference system

42
INNER CONSTRAINTS FOR THE STACKING PROBLEM (Total) inner constraints initial orientation initial translation initial scale orientation rate translation rate scale rate

43
INNER CONSTRAINTS FOR THE STACKING PROBLEM Partial inner constraints – Coordinates & velocities initial orientation initial translation initial scale orientation rate translation rate scale rate

44
INNER CONSTRAINTS FOR THE STACKING PROBLEM Partial inner constraints – Transformation parameters initial orientation initial translation initial scale orientation rate translation rate scale rate

45
THE COMBINATION PROBLEM Transformation parameters from ITRF system to technique (stacking) system Initial coordinates and velocities from each technique T Unknown ITRF initial coordinates and velocities GIVEN SOUGHTNUISANCE Observation model

46
INNER CONSTRAINTS FOR THE COMBINATION PROBLEM Change of ITRF reference system

47
INNER CONSTRAINTS FOR THE COMBINATION PROBLEM (Total) inner constraints initial orientation initial translation initial scale orientation rate translation rate scale rate

48
INNER CONSTRAINTS FOR THE COMBINATION PROBLEM initial orientation initial translation initial scale orientation rate translation rate scale rate Partial inner constraints – Coordinates & velocities

49
INNER CONSTRAINTS FOR THE COMBINATION PROBLEM initial orientation initial translation initial scale orientation rate translation rate scale rate Partial inner constraints – Coordinates & velocities Same as for the stacking problem !

50
INNER CONSTRAINTS FOR THE COMBINATION PROBLEM initial orientation initial translation initial scale orientation rate translation rate scale rate Partial inner constraints – Transformation parameters

51
THE KINEMATIC APPROACH Translation Orientation Scale Establish a reference system in such a way that the apparent motion of network points (variation of their coordinates) is minimized with respect to:

52
THE KINEMATIC APPROACH Establish a reference system in such a way that the apparent motion of network points (variation of their coordinates) is minimized with respect to: Translation: The network barycenter does not move Scale Orientation

53
THE KINEMATIC APPROACH Establish a reference system in such a way that the apparent motion of network points (variation of their coordinates) is minimized with respect to: Translation: The network barycenter does not move Orientation:The relative kinematic energy is minimized = = the relative angular momentum vanishes Scale

54
THE KINEMATIC APPROACH Establish a reference system in such a way that the apparent motion of network points (variation of their coordinates) is minimized with respect to: Translation: The network barycenter does not move Orientation:The relative kinematic energy is minimized = = the relative angular momentum vanishes Scale:The network mean quadratic scale remains constant

55
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Initial translation: Initial orientation: Initial scale: Translation rate: Orientation rate: Scale rate: NOT available (to be borrowed from the algebraic approach)

56
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Translation rate: Orientation rate: Scale rate: Under the choice Initial translation: Initial orientation: Initial scale: NOT available (to be borrowed from the algebraic approach)

57
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Translation rate: Orientation rate: Scale rate: Under the choice Initial translation: Initial orientation: Initial scale: NOT available (to be borrowed from the algebraic approach)

58
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Translation rate: Orientation rate: Scale rate: Under the choice Initial translation: Initial orientation: Initial scale: NOT available (to be borrowed from the algebraic approach)

59
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Translation rate: Orientation rate: Scale rate: Under the choice Initial translation: Initial orientation: Initial scale: NOT available (to be borrowed from the algebraic approach)

60
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Translation rate: Orientation rate: Scale rate: NOT available (to be borrowed from the algebraic approach) Under the choice Initial translation: Initial orientation: Initial scale:

61
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Translation rate: Orientation rate: Scale rate: Under the choice Initial translation: Initial orientation: Initial scale: NOT available (to be borrowed from the algebraic approach)

62
MINIMAL CONSTRAINTS IN THE KINEMATIC APPROACH Translation rate: Orientation rate: Scale rate: Under the choice Same as the partial inner constraints of the algebraic approach ! Initial translation: Initial orientation: Initial scale: NOT available (to be borrowed from the algebraic approach)

63
SUMMARY AND CONCLUSIONS MODEL for smooth shape variation (removal of data noise) OPTIMALITY CRITERION Best reference system among all equivalent ones connected by arbitrary transformations INCONCISTENT

64
SUMMARY AND CONCLUSIONS MODEL for smooth shape variation (removal of data noise) OPTIMALITY CRITERION Best reference system among all equivalent ones connected by arbitrary transformations INCONCISTENT

65
SUMMARY AND CONCLUSIONS MODEL for smooth shape variation (removal of data noise) OPTIMALITY CRITERION Best reference system among all equivalent ones connected by approximate transformations INCONCISTENT

66
SUMMARY AND CONCLUSIONS MODEL for smooth shape variation (removal of data noise) OPTIMALITY CRITERION Best reference system among all equivalent ones connected by approximate transformations CONCISTENT which preserve the model

67
SUMMARY AND CONCLUSIONS MODEL for smooth shape variation (removal of data noise) OPTIMALITY CRITERION Best reference system among all equivalent ones connected by approximate transformations CONCISTENT which preserve the model SUB-OPTIMALITY

68
SUMMARY AND CONCLUSIONS SUB-OPTIMAL REFERENCE SYSTEM (close to the identity, model preserving transformations) BY USING MINIMAL CONSTRAINTS

69
SUMMARY AND CONCLUSIONS SUB-OPTIMAL REFERENCE SYSTEM (close to the identity, model preserving transformations) BY USING MINIMAL CONSTRAINTS ALGEBRAIC APPROACH Minimization of parameter sum of squares PARTIAL INNER CONSTRAINTS KINEMATIC APPROACH Minimization of apparent coordinate variation MINIMAL CONSTRAINTS

70
SUMMARY AND CONCLUSIONS SUB-OPTIMAL REFERENCE SYSTEM (close to the identity, model preserving transformations) BY USING MINIMAL CONSTRAINTS ALGEBRAIC APPROACH Minimization of parameter sum of squares PARTIAL INNER CONSTRAINTS IDENTICAL RESULTS under proper choice of approximate values KINEMATIC APPROACH Minimization of apparent coordinate variation MINIMAL CONSTRAINTS

71
Thanks For Your Attention ! a copy of this presentation can be downloaded from H O T I N E M A R U S S I htpp://der.topo.auth.gr

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google