Sciweavers

201 search results - page 21 / 41
» Computing nearest neighbors in real time
Sort
View
CVPR
2004
IEEE
14 years 10 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
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...
Kristen Grauman, Trevor Darrell
3DPVT
2006
IEEE
162views Visualization» more  3DPVT 2006»
14 years 2 months ago
How Far Can We Go with Local Optimization in Real-Time Stereo Matching
Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most realtime stereo applic...
Liang Wang, Mingwei Gong, Minglun Gong, Ruigang Ya...
RTSS
2005
IEEE
14 years 2 months ago
Decentralized Utilization Control in Distributed Real-Time Systems
Many real-time systems must control their CPU utilizations in order to meet end-to-end deadlines and prevent overload. Utilization control is particularly challenging in distribut...
Xiaorui Wang, Dong Jia, Chenyang Lu, Xenofon D. Ko...
CVPR
2005
IEEE
14 years 10 months ago
Efficient Image Matching with Distributions of Local Invariant Features
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...
Kristen Grauman, Trevor Darrell
CVPR
2008
IEEE
14 years 10 months ago
Beyond sliding windows: Object localization by efficient subwindow search
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
Christoph H. Lampert, Matthew B. Blaschko, Thomas ...