Sciweavers

942 search results - page 136 / 189
» Distance Constraint Satisfaction Problems
Sort
View
159
Voted
CVPR
2010
IEEE
16 years 15 days ago
Online Visual Vocabulary Pruning Using Pairwise Constraints
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
Pavan Mallapragada, Rong Jin and Anil Jain
LPAR
2010
Springer
15 years 1 months ago
A Syntactical Approach to Qualitative Constraint Networks Merging
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
Jean-François Condotta, Souhila Kaci, Pierr...
130
Voted
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 9 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
CVPR
2012
IEEE
13 years 5 months ago
Large scale metric learning from equivalence constraints
In this paper, we raise important issues on scalability and the required degree of supervision of existing Mahalanobis metric learning methods. Often rather tedious optimization p...
Martin Köstinger, Martin Hirzer, Paul Wohlhar...
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 5 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz