Sciweavers

824 search results - page 8 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
STRINGOLOGY
2004
13 years 9 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö
TCSV
2010
13 years 2 months ago
Efficient and Robust Detection of Duplicate Videos in a Large Database
We present an efficient and accurate method for duplicate video detection in a large database using video fingerprints. We have empirically chosen the Color Layout Descriptor, a c...
Anindya Sarkar, Vishwakarma Singh, Pratim Ghosh, B...
ICCV
2003
IEEE
14 years 9 months ago
Minimum Risk Distance Measure for Object Recognition
Recently, the optimal distance measure for a given object discrimination task under the nearest neighbor framework was derived [1]. For ease of implementation and efficiency consi...
Shyjan Mahamud, Martial Hebert
DAWAK
2000
Springer
14 years 3 days ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...