Sciweavers

18 search results - page 1 / 4
» Extracting Dense Features for Visual Correspondence with Gra...
Sort
View
CVPR
2003
IEEE
14 years 6 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
CRV
2007
IEEE
231views Robotics» more  CRV 2007»
13 years 10 months ago
Establishing Visual Correspondence from Multi-Resolution Graph Cuts for Stereo-Motion
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
Joshua Worby, W. James MacLean
ICCV
2003
IEEE
14 years 6 months ago
Visual Correspondence Using Energy Minimization and Mutual Information
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih
CVPR
2012
IEEE
11 years 7 months ago
Learning to segment dense cell nuclei with shape prior
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
Xinghua Lou, Ullrich Köthe, Jochen Wittbrodt,...
DAGM
2006
Springer
13 years 8 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz