905 search results - page 21 / 181 » On the Complexity of uSPR Distance |
ICIP
2000
IEEE
15 years 2 months ago
2000
IEEE
The focus of this work is on using texture information for searching, browsing and retrieving images from a large database. In the wavelet approaches, texture is characterized by ...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
JMM2
2007
14 years 9 months ago
2007
— In this paper, a single-ended quality measurement algorithm for noise suppressed speech is described. The proposed algorithm computes fast approximations of KullbackLeibler dis...
112
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
CVPR
2005
IEEE
15 years 11 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...