10608 search results - page 1684 / 2122 » Complexity of O'Hara's Algorithm |
141
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
141
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
Most algorithms for 3D reconstruction from images use cost functions based on SSD, which assume that the surfaces being reconstructed are visible to all cameras. This makes it dif...
154
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Dimensionality reduction is an important issue when facing high-dimensional data. For supervised dimensionality reduction, Linear Discriminant Analysis (LDA) is one of the most po...
139
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
138
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
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...