Sciweavers

2157 search results - page 259 / 432
» Optimal Fast Hashing
Sort
View
VLDB
2001
ACM
146views Database» more  VLDB 2001»
16 years 3 months ago
Combining multi-visual features for efficient indexing in a large image database
Abstract. The optimized distance-based access methods currently available for multidimensional indexing in multimedia databases have been developed based on two major assumptions: ...
Anne H. H. Ngu, Quan Z. Sheng, Du Q. Huynh, Ron Le...

Presentation
2175views
17 years 4 months ago
Robust Robotic Path Planning Using Level Sets
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surround...
M. Sabry Hassouna
CVPR
2005
IEEE
16 years 5 months ago
Interactive Shape from Shading
Shape from shading (SfS) has always been difficult for real applications due to its intrinsic ill-posedness. In this paper, we propose an interactive SfS method which efficiently ...
Gang Zeng, Yasuyuki Matsushita, Long Quan, Heung-Y...
ICCV
2005
IEEE
16 years 5 months ago
The Pyramid Match Kernel: Discriminative Classification with Sets of Image Features
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
Kristen Grauman, Trevor Darrell
ICCV
2003
IEEE
16 years 5 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu