Semantic Scholar uses AI to extract papers important to this topic.
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several… Expand Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the… Expand Optimization is the science of making a best choice in the face of conflicting requirements. Any convex optimization problem has… Expand A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in… Expand Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… Expand Abstract In this paper, we propose a new method to obtain the Euclidean distance transformation and the Voronoi diagram based on… Expand A distance transformation converts a binary digital image, consisting of feature and non-feature pixels, into an image where all… Expand 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 Abstract In many applications of digital picture processing, distances from certain feature elements to the nonfeature elements… Expand Abstract Based on a two-component descriptor, a distance label for each point, it is shown that Euclidean distance maps can be… Expand