47 search results - page 2 / 10 » What Energy Functions Can Be Minimized via Graph Cuts |
ICIAR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
MVA
2007
13 years 6 months ago
2007
In the last few years, computer vision and image processing techniques have been developed to solve many problems. One of them, graph cut method is powerful optimization technique...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
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...
DAGM
2006
Springer
13 years 8 months ago
2006
Springer
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...
ISBI
2009
IEEE
13 years 11 months ago
2009
IEEE
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...