Cartesian to geodetic coordinates conversion on a triaxial ellipsoid

A new method of transforming Cartesian to geodetic (or planetographic) coordinates on a triaxial ellipsoid is presented. The method is based on simple reasoning coming from essentials of vector calculus. The reasoning results in solving a nonlinear system of equations for coordinates of the point being the projection of a point located outside or inside a triaxial ellipsoid along the normal to the ellipsoid. The presented method has been compared to a vector method of Feltens (J Geod 83:129–137, 2009) who claims that no other methods are available in the literature. Generally, our method turns out to be more accurate, faster and applicable to celestial bodies characterized by different geometric parameters. The presented method also fits to the classical problem of converting Cartesian to geodetic coordinates on the ellipsoid of revolution.     

The total optimal search criterion in solving the mixed integer linear model with GNSS carrier phase observations

Existing algorithms for GPS ambiguity determination can be classified into three categories, i.e. ambiguity resolution in the measurement domain, the coordinate domain and the ambiguity domain. There are many techniques available for searching the ambiguity domain, such as FARA (Frei and Beutler in Manuscr Geod 15(4):325–356, 1990), LSAST (Hatch in Proceedings of KIS’90, Banff, Canada, pp 299–308, 1990), the modified Cholesky decomposition method (Euler and Landau in Proceedings of the sixth international geodetic symposium on satellite positioning, Columbus, Ohio, pp 650–659, 1992), LAMBDA (Teunissen in Invited lecture, section IV theory and methodology, IAG general meeting, Beijing, China, 1993), FASF (Chen and Lachapelle in J Inst Navig 42(2):371–390, 1995) and modified LLL Algorithm (Grafarend in GPS Solut 4(2):31–44, 2000; Lou and Grafarend in Zeitschrift für Vermessungswesen 3:203–210, 2003). The widely applied LAMBDA method is based on the Least Squares Ambiguity Search (LSAS) criterion and employs an effective decorrelation technique in addition. G. Xu (J Glob Position Syst 1(2):121–131, 2002) proposed also a new general criterion together with its equivalent objective function for ambiguity searching that can be carried out in the coordinate domain, the ambiguity domain or both. Xu’s objective function differs from the LSAS function, leading to different numerical results. The cause of this difference is identified in this contribution and corrected. After correction, the Xu’s approach and the one implied in LAMBDA are identical. We have developed a total optimal search criterion for the mixed integer linear model resolving integer ambiguities in both coordinate and ambiguity domain, and derived the orthogonal decomposition of the objective function and the related minimum expressions algebraically and geometrically. This criterion is verified with real GPS phase data. The theoretical and numerical results show that (1) the LSAS objective function can be derived from the total optimal search criterion with the constraint on the fixed integer ambiguity parameters, and (2) Xu’s derivation of the equivalent objective function was incorrect, leading to an incorrect search procedure. The effects of the total optimal criterion on GPS carrier phase data processing are discussed and its practical implementation is also proposed.     

Using home buyers’ revealed preferences to define the urban–rural fringe

The location of new homes defines the urban–rural fringe and determines many facets of the urban–rural interaction set in motion by construction of new homes in previously rural areas. Home, neighborhood and school district characteristics play a crucial role in determining the spatial location of new residential construction, which in turn defines the boundary and spatial extent of the urban–rural fringe. We develop and apply a spatial hedonic variant of the Blinder (J Hum Resour 8:436–455, 1973) and Oaxaca (Int Econ Rev 9:693–709, 1973) price decomposition to newer versus older home sales in the Columbus, Ohio metropolitan area during the year 2000. The preferences of buyers of newer homes are compared to those who purchased the nearest neighboring older home located in the same census block group, during the same year. Use of the nearest older home purchased in the same location represents a methodology to control for various neighborhood, social–economic-demographic and school district characteristics that influence home prices. Since newer homes reflect current preferences for home characteristics while older homes reflect past preferences for these characteristics, we use the price differentials between newer and older home sales in the Blinder–Oaxaca decomposition to assess the relative significance of various house characteristics to home buyers.

Analysis of housing price by means of STAR models with neighbourhood effects: a Bayesian approach

In this paper, we extend the Bayesian methodology introduced by Beamonte et al. (Stat Modelling 8:285–311, 2008) for the estimation and comparison of spatio-temporal autoregressive models (STAR) with neighbourhood effects, providing a more general treatment that uses larger and denser nets for the number of spatial and temporal influential neighbours and continuous distributions for their smoothing weights. This new treatment also reduces the computational time and the RAM necessities of the estimation algorithm in Beamonte et al. (Stat Modelling 8:285–311, 2008). The procedure is illustrated by an application to the Zaragoza (Spain) real estate market, improving the goodness of fit and the outsampling behaviour of the model thanks to a more flexible estimation of the neighbourhood parameters.     

Vector methods to compute azimuth, elevation, ellipsoidal normal, and the Cartesian ( X , Y , Z ) to geodetic ( φ , λ , h ) transformation

Vector-based algorithms for the computation of azimuth, elevation and the ellipsoidal normal unit vector from 3D Cartesian coordinates are presented. As a by-product, the formulae for the ellipsoidal normal vector can also be used to iteratively transform rectangular Cartesian coordinates (X, Y, Z) into geodetic coordinates (φ, λ, h) for a height range from −5600 km to 10⁸ km. Comparisons with existing methods indicate that the new transformation can compete with them.     

Evaluation of the impact of atmospheric pressure loading modeling on GNSS data analysis

In recent years, several studies have demonstrated the sensitivity of Global Navigation Satellite System (GNSS) station time series to displacements caused by atmospheric pressure loading (APL). Different methods to take the APL effect into account are used in these studies: applying the corrections from a geophysical model on weekly mean estimates of station coordinates, using observation-level corrections during data analysis, or solving for regression factors between the station displacement and the local pressure. The Center for Orbit Determination in Europe (CODE) is one of the global analysis centers of the International GNSS Service (IGS). The current quality of the IGS products urgently asks to consider this effect in the regular processing scheme. However, the resulting requirements for an APL model are demanding with respect to quality, latency, and—regarding the reprocessing activities—availability over a long time interval (at least from 1994 onward). The APL model of Petrov and Boy (J Geophys Res 109:B03405, 2004) is widely used within the VLBI community and is evaluated in this study with respect to these criteria. The reprocessing effort of CODE provides the basis for validating the APL model. The data set is used to solve for scaling factors for each station to evaluate the geophysical atmospheric non-tidal loading model. A consistent long-term validation of the model over 15 years, from 1994 to 2008, is thus possible. The time series of 15 years allows to study seasonal variations of the scaling factors using the dense GNSS tracking network of the IGS. By interpreting the scaling factors for the stations of the IGS network, the model by (2004) is shown to meet the expectations concerning the order of magnitude of the effect at individual stations within the uncertainty given by the GNSS data processing and within the limitations due to the model itself. The repeatability of station coordinates improves by 20% when applying the effect directly on the data analysis and by 10% when applying a post-processing correction to the resulting weekly coordinates compared with a solution without taking APL into account.     

Income distribution dynamics and cross-region convergence in Europe

This paper presents a continuous version of the model of distribution dynamics to analyse the transition dynamics and implied long-run behaviour of the EU-27 NUTS-2 regions over the period 1995–2003. It departs from previous research in two respects: first, by introducing kernel estimation and three-dimensional stacked conditional density plots as well as highest density regions plots for the visualisation of the transition function, based on Hyndman et al. (J Comput Graph Stat 5(4):315–336, 1996), and second, by combining Getis’ spatial filtering view with kernel estimation to explicitly account for the spatial dimension of the growth process. The results of the analysis indicate a very slow catching-up of the poorest regions with the richer ones, a process of shifting away of a small group of very rich regions, and highlight the importance of geography in understanding regional income distribution dynamics.

Wide-angle airborne laser range data analysis for relative height determination of ground-based benchmarks

 A wide-angle airborne laser ranging system has been developed for the determination of relative heights of ground-based benchmarks in regional-scale networks (typically 100 laser reflectors spread over 100 km²). A first prototype demonstrated a 1–2 mm accuracy in radial distance measurement in a ground-based experiment in 1995. The first aircraft experiment was conducted in 1998, over a small area (1 km²) equipped with a network of 64 benchmarks. The instrument was modified before that experiment, in order to minimize echo superimposition due to the high density of benchmarks. New data processing algorithms have been developed, for the deconvolution of strongly overlapped echoes and a high a priori uncertainty in the aircraft flight path, and for the estimation of benchmark coordinates. A special methodology has been developed for the parameterization of these algorithms and of outlier detection tests. From a total of 2×10⁴ pseudo-range measurements, that have been acquired from two flights composed of 30 legs each, only 3×10³ remain after outlier detection. A positioning accuracy of 1.5 cm in the vertical coordinate (2.1 cm in the difference between the two flights) has been achieved. It is shown that the errors are normally distributed, with a nearly zero mean, and are consistent with the a posteriori uncertainty. It is also shown that the accuracy is limited mainly by the sensitivity of the photodetector used for this experiment (due to reduced response time). Another limiting factor is the effect of aircraft attitude changes during the measurements, which produces additional uncertainties in absolute distance measurements. It is planned to test new photodetectors with high internal gains. These should provide, in future experiments with smaller benchmark density, an improvement in signal-to-noise ratio of a factor of 5–10, leading to sub-centimeter vertical positioning accuracy. Received: 19 June 2001 / Accepted: 3 January 2002     

Closed-form solution of P4P or the three-dimensional resection problem in terms of Möbius barycentric coordinates

 The perspective 4 point (P4P) problem - also called the three-dimensional resection problem - is solved by means of a new algorithm: At first the unknown Cartesian coordinates of the perspective center are computed by means of M?bius barycentric coordinates. Secondly these coordinates are represented in terms of observables, namely space angles in the five-dimensional simplex generated by the unknown point and the four known points. Substitution of M?bius barycentric coordinates leads to the unknown Cartesian coordinates (2.8)–(2.10) of Box 2.2. The unknown distances within the five-dimensional simplex are determined by solving the Grunert equations, namely by forward reduction to one algebraic equation (3.8) of order four and backward linear substitution. Tables 1.–4. contain a numerical example. Finally we give a reference to the solution of the 3 point (P3P) problem, the two-dimensional resection problem, namely to the Ansermet barycentric coordinates initiated by C.F. Gau? (1842), A. Schreiber (1908) and A.␣Ansermet (1910). Received: 05 March 1996; Accepted: 15 October 1996     

Iterative vector methods for computing geodetic latitude and height from rectangular coordinates

 Two iterative vector methods for computing geodetic coordinates (φ, h) from rectangular coordinates (x, y, z) are presented. The methods are conceptually simple, work without modification at any latitude and are easy to program. Geodetic latitude and height can be calculated to acceptable precision in one iteration over the height range from −10⁶ to +10⁹ m. Received: 13 December 2000 / Accepted: 13 July 2001     

Influence of Atmospheric Water Vapour on IRS NIR Measurements for Detecting Vegetation Signal. Part II: Validation of Simulation Results using Hyperion Data

This is the second paper of the series on the influence of the atmospheric water vapour (WV) on IRS NIR measurements. In the first paper (Pandya et al. 2011) a simulation study was presented where through the radiative transfer calculations it was shown that the variation of 0 to 6 g/cm² in the WV hampered the IRS NIR reflectance up to 14%. In that study splitting of IRS NIR (0.770–0.860 μm) into two bands, such as NIR1 (0.775–0.805 μm) and NIR2 (0.845–0.875 μm) was also proposed, which facilitated a considerable improvement in NIR reflectance as well as in NDVI. Objective of the present paper is to validate the findings of simulation study with the use of EO1-Hyperion data. An improvement of the order of 7% in the top-of-atmosphere reflectance over vegetation target was obtained from the satellite data analysis, which is in good agreement to that of simulation results (3.7 to 7.9%) for the continental WV conditions of 1 to 3 g/cm². This is also true for NDVI values, which illustrated a good agreement between the satellite observations (2.5%) and simulation results (2 to 4.6%) for the magnitude of improvement. Findings of the present study are preliminary in the nature but it provides a basis for enhanced NIR observations for future IRS sensors.     

Nonlinear analysis of the three-dimensional datum transformation [conformal group ℂ7(3)]

 The weighted Procrustes algorithm is presented as a very effective tool for solving the three-dimensional datum transformation problem. In particular, the weighted Procrustes algorithm does not require any initial datum parameters for linearization or any iteration procedure. As a closed-form algorithm it only requires the values of Cartesian coordinates in both systems of reference. Where there is some prior information about the variance–covariance matrix of the two sets of Cartesian coordinates, also called pseudo-observations, the weighted Procrustes algorithm is able to incorporate such a quality property of the input data by means of a proper choice of weight matrix. Such a choice is based on a properly designed criterion matrix which is discussed in detail. Thanks to the weighted Procrustes algorithm, the problem of incorporating the stochasticity measures of both systems of coordinates involved in the seven parameter datum transformation problem [conformal group ℂ₇(3)] which is free of linearization and any iterative procedure can be considered to be solved. Illustrative examples are given. Received: 7 January 2002 / Accepted: 9 September 2002 Correspondence to: E. W. Grafarend     

An iterative solution of weighted total least-squares adjustment

Total least-squares (TLS) adjustment is used to estimate the parameters in the errors-in-variables (EIV) model. However, its exact solution is rather complicated, and the accuracies of estimated parameters are too difficult to analytically compute. Since the EIV model is essentially a non-linear model, it can be solved according to the theory of non-linear least-squares adjustment. In this contribution, we will propose an iterative method of weighted TLS (WTLS) adjustment to solve EIV model based on Newton–Gauss approach of non-linear weighted least-squares (WLS) adjustment. Then the WLS solution to linearly approximated EIV model is derived and its discrepancy is investigated by comparing with WTLS solution. In addition, a numerical method is developed to compute the unbiased variance component estimate and the covariance matrix of the WTLS estimates. Finally, the real and simulation experiments are implemented to demonstrate the performance and efficiency of the presented iterative method and its linearly approximated version as well as the numerical method. The results show that the proposed iterative method can obtain such good solution as WTLS solution of Schaffrin and Wieser (J Geod 82:415–421, 2008) and the presented numerical method can be reasonably applied to evaluate the accuracy of WTLS solution.     

On non-linear low–low SST observation equations for the determination of the geopotential based on an analytical solution

In satellite data analysis, one big advantage of analytical orbit integration, which cannot be overestimated, is missed in the numerical integration approach: spectral analysis or the lumped coefficient concept may be used not only to design efficient algorithms but overall for much better insight into the force-field determination problem. The lumped coefficient concept, considered from a practical point of view, consists of the separation of the observation equation matrix A=BT into the product of two matrices. The matrix T is a very sparse matrix separating into small block-diagonal matrices connecting the harmonic coefficients with the lumped coefficients. The lumped coefficients are nothing other than the amplitudes of trigonometric functions depending on three angular orbital variables; therefore, the matrix N=B ^T B will become for a sufficient length of a data set a diagonal dominant matrix, in the case of an unlimited data string length a strictly diagonal one. Using an analytical solution of high order, the non-linear observation equations for low–low SST range data can be transformed into a form to allow the application of the lumped concept. They are presented here for a second-order solution together with an outline of how to proceed with data analysis in the spectral domain in such a case. The dynamic model presented here provides not only a practical algorithm for the parameter determination but also a simple method for an investigation of some fundamental questions, such as the determination of the range of the subset of geopotential coefficients which can be properly determined by means of SST techniques or the definition of an optimal orbital configuration for particular SST missions. Numerical results have already been obtained and will be published elsewhere. Received: 15 January 1999 / Accepted: 30 November 1999     

The parallel sum of matrices and its application in geodetic adjustments

Summary . It is well known that for the comparison and combination of geodetic networks their heterogeneous datum definitions are well to be considered. Various algorithms have been developed for this purpose. As an alternative concept to deal with hybrid datum problems, the operator parallel sum of matrices is introduced in this paper. To begin with, a definition is given and some basic properties are explained. To demonstrate the usefulness of the operator, two practical applications are given. The first deals with the estimation of parameters describing the deformation of two networks which are to be compared to each other. The second one treats the estimation of parameters representing the heterogeneous datum definitions of two networks which are to be merged into a hybrid network. It will be shown that – regardless of the datum definitions of the preadjusted individual networks – the parallel sum of matrices can be used to simplify the algorithms applied for the estimation of those parameters. Received 15 December 1995; Accepted 24 September 1996     

Computer algebra solution of the GPS N-points problem

A computer algebra solution is applied here to develop and evaluate algorithms for solving the basic GPS navigation problem: finding a point position using four or more pseudoranges at one epoch (the GPS N-points problem). Using Mathematica 5.2 software, the GPS N-points problem is solved numerically, symbolically, semi-symbolically, and with Gauss–Jacobi, on a work station. For the case of N > 4, two minimization approaches based on residuals and distance norms are evaluated for the direct numerical solution and their computational duration is compared. For N = 4, it is demonstrated that the symbolic computation is twice as fast as the iterative direct numerical method. For N = 6, the direct numerical solution is twice as fast as the semi-symbolic, with the residual minimization requiring less computation time compared to the minimization of the distance norm. Gauss–Jacobi requires eight times more computation time than the direct numerical solution. It does, however, have the advantage of diagnosing poor satellite geometry and outliers. Besides offering a complete evaluation of these algorithms, we have developed Mathematica 5.2 code (a notebook file) for these algorithms (i.e., Sturmfel’s resultant, Dixon’s resultants, Groebner basis, reduced Groebner basis and Gauss–Jacobi). These are accessible to any geodesist, geophysicist, or geoinformation scientist via the GPS Toolbox () website or the Wolfram Information Center ().

Modeling and estimation of C1–P1 bias in GPS receivers

 Modern dual-frequency global positioning system (GPS) receivers are capable of providing direct measurements of both L1 C/A (C1) and P code (P1) without the use of the Y-codes under Anti-Spoofing. A discrepancy or bias between the C1 and P1 measurements from these receivers has however been of concern to operators and users of GPS reference networks. For the purpose of modeling and estimation, the nature and characteristics of the discrepancy must be investigated. The research results presented indicate that the discrepancy between the C1 and P1 measurements contains two different types of components: one is of constant type while another is time variant. A method has been developed for their modeling and estimation. The residual C1–P1 time series after a satellite-dependent bias removal agree at a few-centimeter level, indicating the effectiveness of the proposed model. This allows the C1–P1 discrepancy, both constant and non-constant components, to be removed from GPS reference network solutions. Numerical results are provided to support the analysis. Received: 12 October 1999 / Accepted: 11 May 2000     

Fast transform from geocentric to geodetic coordinates

 A new iterative procedure to transform geocentric rectangular coordinates to geodetic coordinates is derived. The procedure solves a modification of Borkowski's quartic equation by the Newton method from a set of stable starters. The new method runs a little faster than the single application of Bowring's formula, which has been known as the most efficient procedure. The new method is sufficiently precise because the resulting relative error is less than 10⁻¹⁵, and this method is stable in the sense that the iteration converges for all coordinates including the near-geocenter region where Bowring's iterative method diverges and the near-polar axis region where Borkowski's non-iterative method suffers a loss of precision. Received: 13 November 1998 / Accepted: 27 August 1999     

Apropos laser tracking to GPS satellites

. Laser tracking to GPS satellites (PRN5 and 6) provides an opportunity to compare GPS and laser systems directly and to combine data of both in a single solution. A few examples of this are given in this study. The most important results of the analysis are that (1) daily SLR station coordinate solutions could be generated with a few cm accuracy; (2) coordinates of nine stations were determined in a 2.3-year-long arc solution; (3) the contribution of laser data on the `SLR-GPS' combined orbit, resulting from the simultaneous processing of SLR and GPS data, is significant and (4) laser-only orbits have an accuracy of 10–20 cm, 1-day predictions of SLR orbits differ from IGS orbits by about 20–40 cm, 2-day predictions by 50–60 cm. Received: 1 October 1996 / Accepted: 14 February 1997     

An evaluation of solar radiation pressure strategies for the GPS constellation

The subtle effects of different Global Positioning System (GPS) satellite force models are becoming apparent now that mature processing strategies are reaching new levels of accuracy and precision. For this paper, we tested several approaches to solar radiation pressure (SRP) modeling that are commonly used by International GNSS Service (IGS) analysis centers. These include the GPS Solar Pressure Model (GSPM; Bar-Sever and Kuang in The Interplanetary Network Progress Report 42-160, 2005) and variants of the so-called DYB model (Springer et al. in Adv Space Res 23:673–676, 1999). Our results show that currently observed differences between GPS orbit solutions from the various IGS analysis centers are in large part explained by differences between their respective approaches to modeling SRP. DYB-based strategies typically generate orbit solutions that have the smallest differences with respect to the IGS final combined solution, largely because the DYB approach is most commonly used by the contributing analysis centers. However, various internal and external metrics, including ambiguity resolution statistics and satellite laser ranging observations, support continued use of the GSPM-based approach for precise orbit determination of the GPS constellation, at least when using the GIPSY-OASIS software.