0

In this paper, the largest and the smallest observations are considered, at the time when a new record of either kind (upper or lower) occurs based on a sequence of independent random variables with identical continuous distributions. We prove that sequences of the residual or past entropy of the current records characterizes F in the family of continuous distributions. The exponential and the ...

The paper presents a modification of the Frechet distance for nonisomorphic trees. While classical between trees is undefined, new measure called similarity tree to reference given that defined wider class A polynomial-time algorithm determine whether one tree’s another less than number.

Compared with Diffusion Tensor Imaging (DTI), High Angular Resolution Imaging (HARDI) can better explore the complex microstructure of white matter. Orientation Distribution Function (ODF) is used to describe the probability of the fiber direction. Fisher information metric has been constructed for probability density family in Information Geometry theory and it has been successfully applied fo...

A basic problem in classifying, or searching for similar objects in, a large set of geometric objects is computing similarity between two objects. This has led to extensive work on computing geometric similarity between two objects. This talk discusses some old and some new geometric-similarity algorithms, with an emphasis on transportation distance (also called earth mover’s distance) and Frec...