Sciweavers

14548 search results - page 2566 / 2910
» The Optimal Path-Matching Problem
Sort
View
CVPR
2009
IEEE
1133views Computer Vision» more  CVPR 2009»
17 years 2 months ago
Sparse Subspace Clustering
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 ...
Ehsan Elhamifar, René Vidal
CVPR
2009
IEEE
17 years 1 months ago
Tracking of Cell Populations to Understand their Spatio-Temporal Behavior in Response to Physical Stimuli
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...
David House, Matthew Walker, Zheng Wu, Joyce Wong,...
ICASSP
2009
IEEE
17 years 1 months ago
Image Recolorization for the Colorblind
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...
Jia-Bin Huang, Chu-Song Chen, Tzu-Cheng Jen, and S...
ICCV
2009
IEEE
17 years 11 days ago
TagProp: Discriminative Metric Learning in Nearest Neighbor Models for Image Auto-Annotation
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...
Matthieu Guillaumin, Thomas Mensink, Jakob Verbeek...
CVPR
1999
IEEE
16 years 9 months ago
A Multi-View Approach to Motion and Stereo
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...
Richard Szeliski
« Prev « First page 2566 / 2910 Last » Next »