Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Euclidean distance

Known as: Euclidean metric, Euclidean, Euclidian distance 
In mathematics, the Euclidean distance or Euclidean metric is the "ordinary" (i.e. straight-line) distance between two points in Euclidean space… Expand
Wikipedia

Related topics

Related topics

50 relations
Alignment-free sequence analysisBackpropagationChemical databaseChemical similarity
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Euclidean Distance Geometry and Applications
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several… Expand
  • figure 1.7
  • table 1.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
Highly Cited
2009
Highly Cited
2009
Beyond the Euclidean distance: Creating effective visual codebooks using the Histogram Intersection Kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Highly Cited
2004
Highly Cited
2004
Convex Optimization & Euclidean Distance Geometry
Optimization is the science of making a best choice in the face of conflicting requirements. Any convex optimization problem has… Expand
Highly Cited
2003
Highly Cited
2003
A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions
A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Highly Cited
1999
Highly Cited
1999
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… Expand
Highly Cited
1994
Highly Cited
1994
New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications
Abstract In this paper, we propose a new method to obtain the Euclidean distance transformation and the Voronoi diagram based on… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1986
Highly Cited
1986
Distance transformations in digital images
  • G. Borgefors
  • Comput. Vis. Graph. Image Process.
  • 1986
    • Corpus ID: 36889447
A distance transformation converts a binary digital image, consisting of feature and non-feature pixels, into an image where all… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1985
Highly Cited
1985
Properties of Euclidean and non-Euclidean distance matrices
Abstract A distance matrix D of order n is symmetric with elements − 1 2 d ij 2 , where dii=0. D is Euclidean when the 1 2 n(n−1… Expand
  • figure 1
  • figure 2
Highly Cited
1984
Highly Cited
1984
Distance transformations in arbitrary dimensions
Abstract In many applications of digital picture processing, distances from certain feature elements to the nonfeature elements… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Highly Cited
1980
Highly Cited
1980
Euclidean distance mapping
Abstract Based on a two-component descriptor, a distance label for each point, it is shown that Euclidean distance maps can be… Expand
  • figure 3
  • figure 4
  • figure 6
  • figure 8
  • figure 10
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE