1871 search results - page 247 / 375 » The Ephemeral Pairing Problem |
209
click to vote
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
17 years 1 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
249
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...
314
click to vote
ICASSP
2009
IEEE
17 years 11 days ago
2009
IEEE
In this paper, we propose a new re-coloring algorithm to enhance the accessibility for the color vision deficient (or colorblind). Compared to people with normal color vision, peop...
192
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We consider a class of region-based energies for image
segmentation and inpainting which combine region integrals
with curvature regularity of the region boundary. To
minimize s...
193
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Mean shift clustering is a powerful unsupervised data
analysis technique which does not require prior knowledge
of the number of clusters, and does not constrain the shape
of th...