Sciweavers

221 search results - page 1 / 45
» A linear-time algorithm for Euclidean feature transform sets
Sort
View
IPL
2007
104views more  IPL 2007»
13 years 4 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
ICML
2009
IEEE
14 years 5 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
PAMI
2002
103views more  PAMI 2002»
13 years 4 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette
CVPR
2008
IEEE
14 years 6 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
CVPR
2007
IEEE
14 years 6 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell