نتایج جستجو برای: normalized euclidean distance

تعداد نتایج: 300059  

2010
MICHAEL W. TROSSET

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

2008
Gonzalo Sanguinetti Giovanna Citti Alessandro Sarti

In this paper we present an implementation of a perceptual completion model performed in the three dimensional space of position and orientation of level lines of an image. We show that the space is equipped with a natural subriemannian metric. This model allows to perform disocclusion representing both the occluding and occluded objects simultaneously in the space. The completion is accomplish...

2007
Houssain Kettani George Ostrouchov

Motivated by the problem of cluster identification, we consider two multivariate normally distributed points. We seek to find the distribution of the squared Euclidean distance between these two point. Consequently, we find the corresponding distribution in the general case. We then reduce this distribution for special cases based on the mean and covariance.

Journal: :Pattern Recognition 2009
Jing Li Bao-Liang Lu

Article history: Received 13 October 2007 Received in revised form 12 June 2008 Accepted 31 July 2008

2008
Bing-Long Chen

In this paper, we derive some local a priori estimates for Ricci flow. This gives rise to some strong uniqueness theorems. As a corollary, let g(t) be a smooth complete solution to the Ricci flow on R, with the canonical Euclidean metric E as initial data, then g(t) is trivial, i.e. g(t) ≡ E.

Journal: :SIAM J. Matrix Analysis Applications 2005
Maher Moakher

In this paper we introduce metric-based means for the space of positive-definite matrices. The mean associated with the Euclidean metric of the ambient space is the usual arithmetic mean. The mean associated with the Riemannian metric corresponds to the geometric mean. We discuss some invariance properties of the Riemannian mean and we use differential geometric tools to give a characterization...

2017
Alan M. Frieze Wesley Pegden

We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a geodesic of length arbitrarily close to their Euclidean distance, and analyze the minimum length Traveling Salesperson Tour, extending the BeardwoodHalton-Hammersl...

2010
Chi-Kwong Li Thomas Milligan Michael W. Trosset MICHAEL W. TROSSET

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

Journal: :Pattern Recognition 2007
Li Yu David Zhang Kuanquan Wang

Iris recognition has received increasing attention in recent years as a reliable approach to human identification. This paper makes an attempt to analyze the local feature structure of iris texture information based on the relative distance of key points. When preprocessed, the annular iris is normalized into a rectangular block. Multi-channel 2-D Gabor filters are used to capture the iris text...

Journal: :Discrete Mathematics 2003
Michelle R. DeDeo

Graphs are attached to the n-dimensional space Z 2r where Z2r is the ring with 2 r elements using an analogue of Euclidean distance. The graphs are shown to be non-Ramanujan for r=4. Comparisons are made with Euclidean graphs attached to Z pr for p an odd prime. The percentage of non-zero eigenvalues of the adjacency operator attached to these 1nite Euclidean graphs is shown to tend to zero as ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید