14548 search results - page 2566 / 2910 » The Optimal Path-Matching Problem |
166
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a method based on sparse representation
(SR) to cluster data drawn from multiple low-dimensional
linear or affine subspaces embedded in a high-dimensional
space. Our ...
208
Voted
CVPR
2009
IEEE
17 years 26 days ago
2009
IEEE
We have developed methods for segmentation and tracking of cells in time-lapse phase-contrast microscopy images. Our multi-object Bayesian algorithm detects and tracks large num...
318
click to vote
ICASSP
2009
IEEE
17 years 17 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...
196
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Image auto-annotation is an important open problem in
computer vision. For this task we propose TagProp, a discriminatively
trained nearest neighbor model. Tags of test
images a...
190
click to vote
CVPR
1999
IEEE
16 years 8 months ago
1999
IEEE
This paper presents a new approach to computing dense depth and motion estimates from multiple images. Rather than computing a single depth or motion map from such a collection, w...