scholarly journals Image-Based Angular Distortion Metric of Map Projections by Using Surface Fitting for Noise Reduction

2021 ◽  
Vol 11 (1) ◽  
pp. 1
Author(s):  
Jin Yan ◽  
Tiansheng Xu ◽  
Ni Li ◽  
Guanghong Gong
Keyword(s):  
Noise Reduction ◽  
Linear Equations ◽  
Surface Fitting ◽  
Angular Distortion ◽  
Polynomial Functions ◽  
Explicit Dependence ◽  
Map Projections ◽  
Mapping Software ◽  
Systems Of Linear Equations ◽  
Forward Equations

Measuring, analyzing, reducing, and optimizing distortions in map projections is important in cartography. In this study, we introduced a novel image-based angular distortion metric based on the previous spherical great circle arcs-based metric. Images with predefined patterns were used to generate distorted images using mapping software. The generated distorted images with known patterns were then exploited to calculate the proposed angular distortion metric. The mapping software performed the underlying transformation of map projections. Therefore, there was no direct explicit dependence on the forward equations of the map projections in our proposed metric. However, there were fairly large computation errors in the ordinary image-based approach without special correction. To reduce the error, we introduced surface-fitting-based noise reduction in our approach. We established and solved systems of linear equations based on bivariate polynomial functions in the process of noise reduction. Sufficient experiments were made to validate the proposed image-based metric and the accompanying noise reduction approach. In the experiment, the NASA G.Projector was employed as the mapping software for evaluating more than 200 map projections. Experimental results demonstrated that the proposed image-based approach and surface fitting-based noise reduction are feasible and practical for the evaluation of the angular distortion of map projections.

scholarly journals Regression and Evaluation on a Forward Interpolated Version of the Great Circle Arcs–Based Distortion Metric of Map Projections

2021 ◽  
Vol 10 (10) ◽  
pp. 649
Author(s):  
Jin Yan ◽  
Tiansheng Xu ◽  
Ni Li ◽  
Guanghong Gong
Keyword(s):  
Numerical Approximation ◽  
Spherical Surface ◽  
Approximation Problem ◽  
Great Circle ◽  
Angular Distortion ◽  
Numerical Estimation ◽  
Partial Derivatives ◽  
Map Projections ◽  
Forward Equations ◽  
Derivatives Of

We studied the numerical approximation problem of distortion in map projections. Most widely used differential methods calculate area distortion and maximum angular distortion using partial derivatives of forward equations of map projections. However, in certain map projections, partial derivatives are difficult to calculate because of the complicated forms of forward equations, e.g., equations with iterations, integrations, or multi-way branches. As an alternative, the spherical great circle arcs–based metric employs the inverse equations of map projections to transform sample points from the projection plane to the spherical surface, and then calculates a differential-independent distortion metric for the map projections. We introduce a novel forward interpolated version of the previous spherical great circle arcs–based metric, solely dependent on the forward equations of map projections. In our proposed numerical solution, a rational function–based regression is also devised and applied to our metric to obtain an approximate metric of angular distortion. The statistical and graphical results indicate that the errors of the proposed metric are fairly low, and a good numerical estimation with high correlation to the differential-based metric can be achieved.

On Some Properties of Semi-rings

2018 ◽  
pp. 35-50
Author(s):  
A. I. Belousov
Keyword(s):  
Linear Equations ◽  
Oriented Graph ◽  
Theoretical Computer Science ◽  
Alternative Methods ◽  
Main Role ◽  
Cost Matrix ◽  
Sequential Elimination ◽  
The Matrix ◽  
Systems Of Linear Equations ◽  
The Cost

The main objective of this paper is to prove a theorem according to which a method of successive elimination of unknowns in the solution of systems of linear equations in the semi-rings with iteration gives the really smallest solution of the system. The proof is based on the graph interpretation of the system and establishes a relationship between the method of sequential elimination of unknowns and the method for calculating a cost matrix of a labeled oriented graph using the method of sequential calculation of cost matrices following the paths of increasing ranks. Along with that, and in terms of preparing for the proof of the main theorem, we consider the following important properties of the closed semi-rings and semi-rings with iteration.We prove the properties of an infinite sum (a supremum of the sequence in natural ordering of an idempotent semi-ring). In particular, the proof of the continuity of the addition operation is much simpler than in the known issues, which is the basis for the well-known algorithm for solving a linear equation in a semi-ring with iteration.Next, we prove a theorem on the closeness of semi-rings with iteration with respect to solutions of the systems of linear equations. We also give a detailed proof of the theorem of the cost matrix of an oriented graph labeled above a semi-ring as an iteration of the matrix of arc labels.The concept of an automaton over a semi-ring is introduced, which, unlike the usual labeled oriented graph, has a distinguished "final" vertex with a zero out-degree.All of the foregoing provides a basis for the proof of the main theorem, in which the concept of an automaton over a semi-ring plays the main role.The article's results are scientifically and methodologically valuable. The proposed proof of the main theorem allows us to relate two alternative methods for calculating the cost matrix of a labeled oriented graph, and the proposed proofs of already known statements can be useful in presenting the elements of the theory of semi-rings that plays an important role in mathematical studies of students majoring in software technologies and theoretical computer science.

scholarly journals A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Zhijun Luo ◽  
Lirong Wang
Keyword(s):  
Constrained Optimization ◽  
Optimization Problems ◽  
Linear Equations ◽  
Coefficient Matrix ◽  
Descent Direction ◽  
Constrained Optimization Problems ◽  
Inequality Constrained Optimization ◽  
Globally Convergent ◽  
Variable Distribution ◽  
Systems Of Linear Equations

A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.

Mutual Embeddings

2015 ◽  
Vol 15 (01n02) ◽  
pp. 1550001
Author(s):  
ILKER NADI BOZKURT ◽  
HAI HUANG ◽  
BRUCE MAGGS ◽  
ANDRÉA RICHA ◽  
MAVERICK WOO
Keyword(s):  
Iterative Methods ◽  
Lower Bounds ◽  
Linear Equations ◽  
Graph Embedding ◽  
Open Problems ◽  
Linear Arrays ◽  
Systems Of Linear Equations

This paper introduces a type of graph embedding called a mutual embedding. A mutual embedding between two n-node graphs [Formula: see text] and [Formula: see text] is an identification of the vertices of V1 and V2, i.e., a bijection [Formula: see text], together with an embedding of G1 into G2 and an embedding of G2 into G1 where in the embedding of G1 into G2, each node u of G1 is mapped to π(u) in G2 and in the embedding of G2 into G1 each node v of G2 is mapped to [Formula: see text] in G1. The identification of vertices in G1 and G2 constrains the two embeddings so that it is not always possible for both to exhibit small congestion and dilation, even if there are traditional one-way embeddings in both directions with small congestion and dilation. Mutual embeddings arise in the context of finding preconditioners for accelerating the convergence of iterative methods for solving systems of linear equations. We present mutual embeddings between several types of graphs such as linear arrays, cycles, trees, and meshes, prove lower bounds on mutual embeddings between several classes of graphs, and present some open problems related to optimal mutual embeddings.

Sign in / Sign up

Export Citation Format

Share Document