scholarly journals Parallel and Scalable Heat Methods for Geodesic Distance Computation

2021 ◽  
Vol 43 (2) ◽  
pp. 579-594 ◽  
Author(s):  
Jiong Tao ◽  
Juyong Zhang ◽  
Bailin Deng ◽  
Zheng Fang ◽  
Yue Peng ◽  
...  
2009 ◽  
Vol 25 (8) ◽  
pp. 743-755 ◽  
Author(s):  
Joon-Kyung Seong ◽  
Won-Ki Jeong ◽  
Elaine Cohen

2011 ◽  
Vol 64 (4) ◽  
pp. 739-749 ◽  
Author(s):  
Young Joon Ahn ◽  
Jian Cui ◽  
Christoph Hoffmann

We present an approximation method for geodesic circles on a spheroid. Our ap­proximation curve is the intersection of two spheroids whose axes are parallel, and it interpolates four points of the geodesic circle. Our approximation method has two merits. One is that the approximation curve can be obtained algebraically, and the other is that the approximation error is very small. For example, our approximation of a circle of radius 1000 km on the Earth has error 1·13 cm or less. We analyze the error of our approximation using the Hausdorff distance and confirm it by a geodesic distance computation.


2021 ◽  
Vol 40 (5) ◽  
pp. 247-260
Author(s):  
P. Trettner ◽  
D. Bommes ◽  
L. Kobbelt

2010 ◽  
Vol 30 (2) ◽  
pp. 362-363
Author(s):  
Sheng CHEN ◽  
Xun LIU

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 878
Author(s):  
C. T. J. Dodson ◽  
John Soldera ◽  
Jacob Scharcanski

Secure user access to devices and datasets is widely enabled by fingerprint or face recognition. Organization of the necessarily large secure digital object datasets, with objects having content that may consist of images, text, video or audio, involves efficient classification and feature retrieval processing. This usually will require multidimensional methods applicable to data that is represented through a family of probability distributions. Then information geometry is an appropriate context in which to provide for such analytic work, whether with maximum likelihood fitted distributions or empirical frequency distributions. The important provision is of a natural geometric measure structure on families of probability distributions by representing them as Riemannian manifolds. Then the distributions are points lying in this geometrical manifold, different features can be identified and dissimilarities computed, so that neighbourhoods of objects nearby a given example object can be constructed. This can reveal clustering and projections onto smaller eigen-subspaces which can make comparisons easier to interpret. Geodesic distances can be used as a natural dissimilarity metric applied over data described by probability distributions. Exploring this property, we propose a new face recognition method which scores dissimilarities between face images by multiplying geodesic distance approximations between 3-variate RGB Gaussians representative of colour face images, and also obtaining joint probabilities. The experimental results show that this new method is more successful in recognition rates than published comparative state-of-the-art methods.


Sign in / Sign up

Export Citation Format

Share Document