Sciweavers

244 search results - page 12 / 49
» Generalized RANSAC Framework for Relaxed Correspondence Prob...
Sort
View
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 7 months ago
Stretch 'n' shrink: resizing queries to user preferences
We present Stretch `n' Shrink, a query design framework that explicitly takes into account user preferences about the desired answer size, and subsequently modifies the query...
Chaitanya Mishra, Nick Koudas
CVPR
2009
IEEE
15 years 2 months ago
A Tensor-Based Algorithm for High-Order Graph Matching
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in...
Francis R. Bach, In-So Kweon, Jean Ponce, Olivier ...

Publication
433views
14 years 3 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
IJCV
2002
84views more  IJCV 2002»
13 years 7 months ago
Algorithmic Fusion for More Robust Feature Tracking
We present a framework for merging the results of independent featurebased motion trackers using a classification based approach. We demonstrate the efficacy of the framework usin...
Brendan McCane, Ben Galvin, Kevin Novins
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...