Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Review

2014

Review

2014

Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several… Expand

Highly Cited

2009

Highly Cited

2009

Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the… Expand

Highly Cited

2004

Highly Cited

2004

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 sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in… Expand

Highly Cited

1999

Highly Cited

1999

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

Abstract In this paper, we propose a new method to obtain the Euclidean distance transformation and the Voronoi diagram based on… Expand

Highly Cited

1986

Highly Cited

1986

A distance transformation converts a binary digital image, consisting of feature and non-feature pixels, into an image where all… Expand

Highly Cited

1985

Highly Cited

1985

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

Highly Cited

1984

Highly Cited

1984

Abstract In many applications of digital picture processing, distances from certain feature elements to the nonfeature elements… Expand

Highly Cited

1980

Highly Cited

1980

Abstract Based on a two-component descriptor, a distance label for each point, it is shown that Euclidean distance maps can be… Expand