Sciweavers

6005 search results - page 83 / 1201
» Graph-Theoretical Methods in Computer Vision
Sort
View
CVPR
2001
IEEE
14 years 12 months ago
On Computing Exact Visual Hulls of Solids Bounded by Smooth Surfaces
This paper presents a method for computing the visual hull that is based on two novel representations: the rim mesh, which describes the connectivity of contour generators on the ...
Svetlana Lazebnik, Edmond Boyer, Jean Ponce
ECCV
1994
Springer
14 years 11 months ago
Non-parametric Local Transforms for Computing Visual Correspondence
Abstract. We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms re...
Ramin Zabih, John Woodfill
ICPR
2006
IEEE
14 years 11 months ago
Gaussian mixture pdf in one-class classification: computing and utilizing confidence values
In this study a confidence measure for probability density functions (pdfs) is presented. The measure can be used in one-class classification to select a pdf threshold for class i...
Jarmo Ilonen, Pekka Paalanen, Joni-Kristian Kamara...
CVPR
2007
IEEE
14 years 4 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
APGV
2004
ACM
176views Visualization» more  APGV 2004»
14 years 3 months ago
Towards perceptually realistic talking heads: models, methods and McGurk
Motivated by the need for an informative, unbiased and quantitative perceptual method for the development and evaluation of a talking head we are developing, we propose a new test...
Darren Cosker, Susan Paddock, A. David Marshall, P...