Sciweavers

343 search results - page 12 / 69
» Geodesic Methods in Computer Vision and Graphics
Sort
View
SCALESPACE
2005
Springer
15 years 3 months ago
Sparse Finite Element Level-Sets for Anisotropic Boundary Detection in 3D Images
Level-Set methods have been successfully applied to 2D and 3D boundary detection problems. The geodesic active contour model has been particularly successful. Several algorithms fo...
Martin Weber, Andrew Blake, Roberto Cipolla
CGI
2000
IEEE
15 years 1 months ago
Local and Global Geometric Methods for Analysis Interrogation, Reconstruction, Modification and Design of Shape
This paper gives an overview of some recent methods useful for local and global shape analysis and for the design of solids. These methods include as new tools for global and loca...
Franz-Erich Wolter, K.-I. Friese
ICPR
2000
IEEE
15 years 11 months ago
Multiple View Vision
The goal of this paper is to give a short historical overview of multiple view vision and in particular the estimation of both camera geometry and scene models using only images a...
Kalle Åström
IJCV
2006
299views more  IJCV 2006»
14 years 10 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
ISVC
2009
Springer
15 years 4 months ago
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
Ioannis Koutis, Gary L. Miller, David Tolliver