1093 search results - page 156 / 219 » Clustering from Constraint Graphs |
139
click to vote
CVPR
2010
IEEE
16 years 1 days ago
2010
IEEE
We explore the problem of reconstructing an image from a bag of square, non-overlapping image patches, the jigsaw puzzle problem. Completing jigsaw puzzles is challenging and requ...
154
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
131
Voted
APJOR
2010
15 years 3 months ago
2010
Earth mover's distance (EMD for short) is a perceptually meaningful dissimilarity measure between histograms. The computation of EMD reduces to a network flow optimization pro...
146
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
190
Voted
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...